Submission #2214547


Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
const int INF = sizeof(int) == sizeof(long long) ? LLONG_MAX : INT_MAX;
const int MOD = 1000000007;
const long double EPS = 1e-8;

signed main() {
	int n;
	string s;
	cin >> n >> s;
	rep (i, 2) {
		string ans = i ? "S" : "W";
		string tmp = ans;
		rep (j, 2) {
			ans = tmp;
			ans += j ? "S" : "W";
			range (k, 1, s.size()) {
				if (s[k] == 'o') {
					if (ans[k] == 'S')
						ans += ans[k - 1] == 'S' ? "S" : "W";
					else
						ans += ans[k - 1] == 'S' ? "W" : "S";
				}
				else {
					if (ans[k] == 'S')
						ans += ans[k - 1] == 'S' ? "W" : "S";
					else
						ans += ans[k - 1] == 'S' ? "S" : "W";
				}
			}
			if (ans.front() == ans.back()) {
				ans.pop_back();
				cout << ans << endl;
				return 0;
			}
		}
	}
	cout << -1 << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Menagerie
User Masumi
Language C++14 (GCC 5.4.1)
Score 0
Code Size 960 Byte
Status WA
Exec Time 8 ms
Memory 768 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 10
WA × 6
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 WA 1 ms 256 KB
01.txt AC 5 ms 512 KB
02.txt AC 3 ms 512 KB
03.txt AC 1 ms 256 KB
04.txt WA 1 ms 256 KB
05.txt AC 7 ms 740 KB
06.txt WA 6 ms 640 KB
07.txt AC 2 ms 256 KB
08.txt WA 2 ms 384 KB
09.txt WA 1 ms 256 KB
10.txt WA 2 ms 384 KB
11.txt AC 6 ms 768 KB
12.txt AC 6 ms 768 KB
13.txt AC 8 ms 728 KB