Submission #1117148
Source Code Expand
#include<iostream> #include<bits/stdc++.h> #define pq priority_queue #define Pi acos(-1.0) using namespace std; #define INFF 10000000007 #define MOD 1000000007 char s[100005]; int len; bool life[100005],flag=0; bool ok(bool x,bool y) { life[0]=x; life[1]=y; for(int i=1;i<len;i++) { if(s[i]=='o') { if(life[i]) life[i+1]=!life[i-1]; else life[i+1]=life[i-1]; } else { if(life[i]==0) life[i+1]=!life[i-1]; else life[i+1]=life[i-1]; } } if((s[0]=='o' && !life[0]) || (s[0]!='o' && life[0])) { if(life[1]==life[len]) { if((s[len]=='o' && !life[len]) || (s[len]!='o' && life[len])) return life[0]==life[len-1]; else return life[0]!=life[len-1]; } else return 0; } else { if(life[1]!=life[len]) { if((s[len]=='o' && !life[len]) || (s[len]!='o' && life[len])) return life[0]==life[len-1]; else return life[0]!=life[len-1]; } else return 0; } } int main() { cin>>len; len--; scanf("%s",s); if(ok(0,0)) flag=1; else { if(ok(0,1)) flag=1; else { if(ok(1,0)) flag=1; else flag=ok(1,1); } } if(!flag) printf("-1\n"); else { for(int i=0;i<=len;i++) { if(life[i]) printf("W"); else printf("S"); } printf("\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Menagerie |
User | TryMyEdge |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1858 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:61:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s); ^
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 | 3 ms | 384 KB |
02.txt | AC | 2 ms | 384 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 4 ms | 512 KB |
06.txt | AC | 3 ms | 512 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | AC | 2 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 2 ms | 256 KB |
11.txt | AC | 5 ms | 512 KB |
12.txt | AC | 5 ms | 512 KB |
13.txt | AC | 4 ms | 512 KB |