Submission #1964042
Source Code Expand
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstring>
#include<iterator>
#include<bitset>
#include<assert.h>
using namespace std;
//#define int ll
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
typedef vector<int> VI;
typedef vector<long long int> VL;
static const int MOD = 1000000007;
static const int INF = 2147483647;
//static const long long INF = 9223372000000000000;
//static const long long INF = 9223372000000000000/2;
//static const int INF = 1000010000;
//int dx4[4] = {0,1,0,-1}, dy4[4] = {-1,0,1,0};
//int dx5[5] = {-1,0,0,0,1}, dy5[5] = {0,-1,0,1,0};
//int dx8[8] = {-1,0,1,1,1,0,-1,-1}, dy8[8] = {1,1,1,0,-1,-1,-1,0};
//int dx9[9] = {-1,0,1,1,1,0,-1,-1,0}, dy9[9] = {1,1,1,0,-1,-1,-1,0,0};
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define NP next_permutation
#define PQ priority_queue
#define UB upper_bound
#define LB lower_bound
#define ALL(x) (x).begin(),(x).end()
#define SZ(a) int((a).size())
#define LEN(a) int((a).length())
#define MAX(a,b,c) max((a),max((b),(c)))
#define MIN(a,b,c) min((a),min((b),(c)))
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REP1(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREP1(i,x) for(int i=((int)(x));i>0;i--)
//struct edge {int to,cost;};
int n;
string s;
bool rullonz = false;
int a[114514] = {};
bool isOK(){
bool ret = true;
REP(i,n){
if(s[i]=='o'&&a[i] || s[i]=='x'&&!a[i]) {if(a[(i+n-1)%n]!=a[(i+1)%n]) ret = false;}
else {if(a[(i+n-1)%n]==a[(i+1)%n]) ret = false;}
}
return ret;
}
void output(){
REP(i,n) putchar(a[i]?'S':'W');
puts("");
}
signed main(){
cin >> n >> s;
REP(i,8){
a[0] = (i>>0)&1;
a[1] = (i>>1)&1;
a[n-1] = (i>>2)&1;
FOR(i,2,n-1){
if (s[i-1]=='o') a[i] = a[i-1]?a[i-2]:abs(1-a[i-2]);
else a[i] = !a[i-1]?a[i-2]:abs(1-a[i-2]);
}
if(isOK()){
output();
return 0;
}
}
puts("-1");
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Menagerie |
User |
r67pr |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2523 Byte |
Status |
AC |
Exec Time |
18 ms |
Memory |
924 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 |
8 ms |
640 KB |
02.txt |
AC |
5 ms |
640 KB |
03.txt |
AC |
2 ms |
256 KB |
04.txt |
AC |
1 ms |
256 KB |
05.txt |
AC |
10 ms |
896 KB |
06.txt |
AC |
18 ms |
896 KB |
07.txt |
AC |
3 ms |
384 KB |
08.txt |
AC |
4 ms |
384 KB |
09.txt |
AC |
2 ms |
256 KB |
10.txt |
AC |
5 ms |
384 KB |
11.txt |
AC |
15 ms |
896 KB |
12.txt |
AC |
14 ms |
924 KB |
13.txt |
AC |
11 ms |
896 KB |