Submission #1989586


Source Code Expand

#include<iostream>

using namespace std;

int n;
bool a[100002]{ true },r[100002];

bool solve(int k) {
	a[k+1] = !(!(a[k - 1] ^ r[k])^a[k]);
	if (k == n) {
		if (a[0] == a[n] && a[1] == a[n + 1])
			return true;
		else
			return false;
	}
	else
		return solve(k + 1);
}

int main() {
	string s;
	cin >> n >> s;
	for (int i = 0; i < n; i++) {
		if (s[i] == 'o')
			r[i+1] = true;
		else
			r[i+1] = false;
	}
	a[0] = true; a[1] = true;
	if (solve(1)) {
		for (int i = 1; i <= n; i++) {
			if (a[i])cout << "S";
			else cout << "W";
		}
		cout << endl;
		return 0;
	}
	a[0] = true; a[1] = false;
	if (solve(1)) {
		for (int i = 1; i <= n; i++) {
			if (a[i])cout << "S";
			else cout << "W";
		}
		cout << endl;
		return 0;
	}
	a[0] = false; a[1] = true;
	if (solve(1)) {
		for (int i = 1; i <= n; i++) {
			if (a[i])cout << "S";
			else cout << "W";
		}
		cout << endl;
		return 0;
	}
	a[0] = false; a[1] = false;
	if (solve(1)) {
		for (int i = 1; i <= n; i++) {
			if (a[i])cout << "S";
			else cout << "W";
		}
		cout << endl;
		return 0;
	}
	else
		cout << -1 << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Menagerie
User NOSS
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1152 Byte
Status AC
Exec Time 9 ms
Memory 768 KB

Judge Result

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