# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666811 | 2022-11-29T18:42:05 Z | Hacv16 | Superpozicija (COCI22_superpozicija) | C++17 | 248 ms | 516 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAX = 2e6 + 50; const int INF = 0x3f3f3f3f; int tc, n, a[MAX], b[MAX]; string s; bool valid(string& t){ stack<char> s; for(int i = 0; i < t.size(); i++){ if(t[i] == ')'){ if(s.empty()) return false; else s.pop(); }else{ s.push('('); } } if(s.size()) return false; return true; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> tc; while(tc--){ cin >> n >> s; for(int i = 0; i < n; i++) cin >> a[i] >> b[i]; for(int i = 0; i < n; i++) a[i]--, b[i]--; int ans = -1; for(int mask = 0; mask < (1 << n); mask++){ string cur = ""; for(int i = 0; i < n; i++){ if(mask & (1 << i)) cur += s[a[i]]; else cur += s[b[i]]; } if(valid(cur)){ ans = mask; break; } } if(ans == -1){ cout << -1 << '\n'; }else{ for(int i = 0; i < n; i++) cout << (ans & (1 << i) ? 0 : 1) << ' '; cout << '\n'; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 248 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 248 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |