# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69991 | 2018-08-22T08:05:41 Z | octopuses | parentrises (BOI18_parentrises) | C++17 | 3 ms | 588 KB |
//Giorgi Kldiashvili #include <bits/stdc++.h> #define ll long long #define fr first #define sc second #define M 1000000007ll using namespace std; const int N = 1000020; int n, k; int used[N]; bool f[N]; char ch[N]; void go1() { vector < int > c; c.clear(); scanf("%s", &ch); n = strlen(ch); for(int i = 0; i < n; ++ i) used[i] = 0, f[i] = 0; if(ch[0] == ')' || ch[n - 1] == '(') { printf("impossible\n"); return; } int now = 1; for(int i = 1; i < n; ++ i) { if(ch[i] == ')' && ch[i] == ch[i - 1] && !(f[i - 1])) c.push_back(i - 1), f[i] = true; now += (ch[i] == ')')?-1:1; if(now < 0) { if(c.size() == 0) { printf("impossible\n"); return; } used[c.back()] = 1; used[c.back() + 1] = 2; c.pop_back(); now = 0; } } now = 1; c.clear(); for(int i = n - 1; i >= 0; -- i) f[i] = 0; for(int i = n - 2; i >= 0; -- i) { if(ch[i] == '(' && ch[i] == ch[i + 1] && !(f[i + 1])) c.push_back(i), f[i] = true; if(used[i] == 2) continue; now += (ch[i] == '(')?-1:1; if(now < 0) { if(c.size() == 0) { printf("impossible\n"); return; } used[c.back()] = 1; used[c.back() + 1] = 2; c.pop_back(); now = 0; } } for(int i = 0; i < n; ++ i) { if(used[i] == 0) putchar('G'); if(used[i] == 1) putchar('R'); if(used[i] == 2) putchar('B'); } printf("\n"); } int sub, T; int main() { scanf("%d", &sub); scanf("%d\n", &T); if(sub == 1) { while(T --) go1(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 3 ms | 412 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 3 ms | 412 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 3 ms | 412 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 588 KB | Unexpected end of file - int32 expected |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 588 KB | Unexpected end of file - int32 expected |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 588 KB | Unexpected end of file - int32 expected |