Submission #1115978
Source Code Expand
#include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <numeric> #include <functional> #include <cmath> #include <queue> #include <stack> #include <set> #include <map> #include <sstream> #include <string> #define _repargs(_1,_2,_3,name,...) name #define _rep(i,n) repi(i,0,n) #define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i) #define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__) #define all(x) (x).begin(),(x).end() #define mod 1000000007 #define inf 2000000007 #define mp make_pair #define pb push_back typedef long long ll; using namespace std; template <typename T> inline void output(T a, int p = 0) { if(p) cout << fixed << setprecision(p) << a << "\n"; else cout << a << "\n"; } // end of template void ok(vector<int> &A){ string s = ""; rep(i, A.size()){ if(A[i] == 0) s += 'S'; else s += 'W'; } output(s); exit(0); } int main() { cin.tie(0); ios::sync_with_stdio(0); // source code int N; cin >> N; string s; cin >> s; rep(a, 2) rep(b, 2){ vector<int> A(N, -1); // 0: S, 1: W A[0] = a, A[1] = b; rep(i, 1, N - 1){ if(A[i] == 0 && s[i] == 'o'){ A[i + 1] = A[i - 1]; } else if(A[i] == 0 && s[i] == 'x'){ A[i + 1] = A[i - 1] ^ 1; } else if(A[i] == 1 && s[i] == 'o'){ A[i + 1] = A[i - 1] ^ 1; } else{ A[i + 1] = A[i - 1]; } } if(A[N - 1] == 0 && s[N - 1] == 'o' && A[N - 2] == A[0]){ ok(A); } else if(A[N - 1] == 0 && s[N - 1] == 'x' && A[N - 2] != A[0]){ ok(A); } else if(A[N - 1] == 1 && s[N - 1] == 'o' && A[N - 2] != A[0]){ ok(A); } else if(A[N - 1] == 1 && s[N - 1] == 'x' && A[N - 2] == A[0]){ ok(A); } } output(-1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Menagerie |
User | ctyl |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2095 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 1104 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 1 ms | 256 KB |
01.txt | WA | 3 ms | 772 KB |
02.txt | AC | 2 ms | 640 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | WA | 4 ms | 1052 KB |
06.txt | AC | 3 ms | 1024 KB |
07.txt | WA | 2 ms | 384 KB |
08.txt | AC | 2 ms | 384 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | WA | 2 ms | 384 KB |
11.txt | WA | 3 ms | 1104 KB |
12.txt | WA | 3 ms | 1104 KB |
13.txt | WA | 4 ms | 1096 KB |