Submission #1648932
Source Code Expand
//#include "IntMod.h"
//typedef IntMod<1000000007> MInt;
//#include "Union_Find.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <list>
#include <bitset>
using namespace std;
#define REP(i,a,n) for(int i = (a); i < (int)(n); ++i)
#define REPM(i,n,a) for(int i = ((n) - 1); i >= (a); --i)
#define EPS 0.0001
#define INF 0x3FFFFFFF
#define INFLL 0x3FFFFFFF3FFFFFFF
#define INFD 1.0e+308
#define FLOAT setprecision(16)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(begin(dest), end(dest), val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
//sum, 累積和
// 負のときの割り算に注意
#if 1
#include <array>
#include <unordered_set>
#include <unordered_map>
template<class T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >; // コスト小を優先
#endif
//#include "Union_Find.h"
int N;
string S;
vector<bool> ans;
int main() {
cin >> N >> S;
S += S.substr(0, 2);
REP(k, 0, 4) {
ans = { !(k & 2), !(k & 1) };
REP(i, 2, N + 2) {
bool b = (S[i - 1] == 'o') == ans[i - 1];
ans.push_back(b ? ans[i - 2] : !ans[i - 2]);
}
if (ans[0] == ans[N] && ans[1] == ans[N + 1]) {
REP(i, 0, N) {
cout << (ans[i] ? 'S' : 'W');
}
cout << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Menagerie |
User |
Aquarius |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2105 Byte |
Status |
AC |
Exec Time |
11 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 |
7 ms |
384 KB |
02.txt |
AC |
5 ms |
384 KB |
03.txt |
AC |
2 ms |
256 KB |
04.txt |
AC |
1 ms |
256 KB |
05.txt |
AC |
9 ms |
512 KB |
06.txt |
AC |
8 ms |
512 KB |
07.txt |
AC |
3 ms |
256 KB |
08.txt |
AC |
3 ms |
256 KB |
09.txt |
AC |
2 ms |
256 KB |
10.txt |
AC |
3 ms |
256 KB |
11.txt |
AC |
11 ms |
512 KB |
12.txt |
AC |
11 ms |
512 KB |
13.txt |
AC |
10 ms |
512 KB |