답안 #861962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861962 2023-10-17T09:27:22 Z maks007 parentrises (BOI18_parentrises) C++14
22 / 100
1000 ms 11252 KB
#include "bits/stdc++.h"

using namespace std;

#define int long long

pair <int,int> mn(pair <int,int> a, pair <int,int> b) {
	if(max(a.first, a.second) < max(b.first, b.second) ) return a;
	return b;
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T;
	cin >> T;
	int q;
	cin >> q;
	while(q --) {
		string str;
		cin >> str;
		int n = str.size();
		stack <int> st;
		vector <int> cnt(n, 0), nope;
		for(int i = 0; i < n; i ++) {
			if(str[i] == ')') {
				if(st.size() == 0) {
					nope.push_back(i);
					continue;
				}
				cnt[i] ++;
				st.pop();
			}else {
				st.push(i);
				cnt[i] ++;
			}
		}
		while(st.size() != 0) nope.push_back(st.top()), st.pop();
		for(auto i : nope) {
			if(str[i] == '(') {
				for(int j = i + 1; j < str.size(); j ++) {
					if(str[j] == ')' && cnt[j] <= 1) {
						cnt[j] ++;
						cnt[i] = 5;
						break;
					}
				}
				if(cnt[i] == 5) continue;
				cout << "impossible\n";
				goto end;
			}else {
				for(int j = 0; j < i; j ++) {
					if(str[j] == '(' && cnt[j] <= 1) {
						cnt[j] ++;
						cnt[i] = 5;
						break;  
					}
				}
				if(cnt[i] == 5) continue;
				cout << "impossible\n";
				goto end;
			}
		}
		for(auto i : cnt) {
			if(i == 2) cout << "G";
			else if(i == 1) cout << "R";
			else cout << "B";
			assert(i > 0);
		}
		cout << "\n";
		continue;
		end:;
	}
	return 0;
}

Compilation message

parentrises.cpp: In function 'int main()':
parentrises.cpp:41:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int j = i + 1; j < str.size(); j ++) {
      |                        ~~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 4 ms 1628 KB Output is correct
18 Correct 28 ms 604 KB Output is correct
19 Correct 4 ms 1372 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 28 ms 2172 KB Output is correct
22 Correct 26 ms 11252 KB Output is correct
23 Execution timed out 1066 ms 2636 KB Time limit exceeded
24 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 456 KB Expected integer, but "impossible" found
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 456 KB Expected integer, but "impossible" found
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 456 KB Expected integer, but "impossible" found
2 Halted 0 ms 0 KB -