Submission #2695534
Source Code Expand
#include <bits/stdc++.h> using namespace std; int n; bool b[100010],a[100010]; int main() { ios::sync_with_stdio(false); cin>>n; for(int i=1;i<=n;i++){ char c; cin>>c; if(c=='o') b[i]=true; } for(int k=0;k<=1;k++){ for(int i=0;i<=1;i++){ a[1]=k;a[2]=i; for(int j=2;j<n;j++){ if(b[j]) a[j+1]=a[j-1]; else a[j+1]=!a[j-1]; if(!a[j]) a[j+1]^=1; } if(((a[1]==b[1]&&a[2]==a[n])||(a[1]!=b[1]&&a[2]!=a[n]))&&((a[n]==b[n]&&a[1]==a[n-1])||(a[n]!=b[n]&&a[1]!=a[n-1]))){ for(int j=1;j<=n;j++){ if(a[j]) cout<<"S"; else cout<<"W"; } cout<<endl; return 0; } /*for(int j=1;j<=n;j++){ if(a[j]) cout<<"S"; else cout<<"W"; } cout<<endl;*/ } } cout<<-1<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Menagerie |
User | sjc061031 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 789 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 512 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 | 5 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 | 7 ms | 512 KB |
06.txt | AC | 8 ms | 512 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 | 7 ms | 512 KB |
12.txt | AC | 7 ms | 512 KB |
13.txt | AC | 7 ms | 512 KB |