Submission #1117531
Source Code Expand
#include <stdio.h>
char re[100001],ans[100001],tmp;
int main()
{
int n,i;
bool flag=1;
scanf("%d%s",&n,&re);
ans[0]='S';
if(re[0]=='o') ans[1]='S',ans[n-1]=tmp='S';
else ans[1]='S',ans[n-1]=tmp='W';
//printf("first : %s\n",ans);
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
//printf("%d : %s\n",i,ans);
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='S';
if(re[0]=='o') ans[1]='S',ans[n-1]=tmp='S';
else ans[1]='W',ans[n-1]=tmp='S';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='S';
if(re[0]=='o') ans[1]='W',ans[n-1]=tmp='W';
else ans[1]='W',ans[n-1]=tmp='S';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='W';
if(re[0]=='o') ans[1]='S',ans[n-1]=tmp='W';
else ans[1]='W',ans[n-1]=tmp='W';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='W';
if(re[0]=='o') ans[1]='W',ans[n-1]=tmp='S';
else ans[1]='W',ans[n-1]=tmp='W';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='W';
if(re[0]=='o') ans[1]='W',ans[n-1]=tmp='S';
else ans[1]='S',ans[n-1]=tmp='S';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='W';
if(re[0]=='o') ans[1]='S',ans[n-1]=tmp='W';
else ans[1]='S',ans[n-1]=tmp='S';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
//
if(flag) return 0;
flag=1;
ans[0]='S';
if(re[0]=='o') ans[1]='W',ans[n-1]=tmp='W';
else ans[1]='S',ans[n-1]=tmp='W';
for(i=1;i<n-1;i++)
{
if(re[i]=='o' && ans[i]=='S') ans[i+1]=ans[i-1];
else if(re[i]=='o' && ans[i]=='W') ans[i+1]='S'+'W'-ans[i-1];
else if(re[i]=='x' && ans[i]=='S') ans[i+1]='S'+'W'-ans[i-1];
else ans[i+1]=ans[i-1];
}
if(ans[n-1]!=tmp) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='S' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='W' && ans[0]!=ans[n-2]) flag=0;
else if(re[n-1]=='o' && ans[n-1]=='W' && ans[0]==ans[n-2]) flag=0;
else if(re[n-1]=='x' && ans[n-1]=='S' && ans[0]==ans[n-2]) flag=0;
else printf("%s\n",ans);
if(!flag) printf("-1\n");
}
Submission Info
Submission Time
2017-02-18 21:54:11+0900
Task
D - Menagerie
User
baluteshih
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
5788 Byte
Status
AC
Exec Time
3 ms
Memory
384 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:9:21: warning: format ‘%s’ expects argument of type ‘char*’, but argument 3 has type ‘char (*)[100001]’ [-Wformat=]
scanf("%d%s",&n,&re);
^
./Main.cpp:9:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%s",&n,&re);
^
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
128 KB
00_example_02.txt
AC
1 ms
128 KB
00_example_03.txt
AC
0 ms
128 KB
01.txt
AC
2 ms
384 KB
02.txt
AC
1 ms
256 KB
03.txt
AC
1 ms
128 KB
04.txt
AC
0 ms
128 KB
05.txt
AC
3 ms
384 KB
06.txt
AC
1 ms
384 KB
07.txt
AC
1 ms
256 KB
08.txt
AC
1 ms
256 KB
09.txt
AC
1 ms
128 KB
10.txt
AC
1 ms
256 KB
11.txt
AC
3 ms
384 KB
12.txt
AC
3 ms
384 KB
13.txt
AC
3 ms
384 KB