Submission #2213636
Source Code Expand
#include<iostream> #include<string> using namespace std; bool ans[100001]; bool start[4][2] = {{true,true},{true,false},{false,true},{false,false}}; int main(){ int N; string s; cin >> N >> s; for(int i=0;i<4;i++){ ans[0] = start[i][0]; ans[1] = start[i][1]; if(ans[0]){ if(s[0] == 'o') ans[N+1] = ans[1]; else ans[N+1] = !ans[1]; } else{ if(s[0] == 'o') ans[N+1] = !ans[1]; else ans[N+1] = ans[1]; } for(int j=1;j<N;j++){ if(ans[j]){ if(s[j] == 'o') ans[j+1] = ans[j-1]; else ans[j+1] = !ans[j-1]; } else{ if(s[j] == 'o') ans[j+1] = !ans[j-1]; else ans[j+1] = ans[j-1]; } } if(ans[N+1] != ans[N-1]||ans[N] != ans[0]) continue; for(int i=0;i<N;i++){ if(ans[i]) cout << 'S'; else cout << 'W'; } cout << endl; return 0;; } cout << -1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Menagerie |
User | yankeiori |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1110 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 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 | AC | 6 ms | 512 KB |
02.txt | AC | 4 ms | 384 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 9 ms | 640 KB |
06.txt | AC | 8 ms | 640 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | AC | 2 ms | 384 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 2 ms | 256 KB |
11.txt | AC | 10 ms | 640 KB |
12.txt | AC | 10 ms | 640 KB |
13.txt | AC | 10 ms | 640 KB |