# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967604 | 2024-04-22T13:41:27 Z | Isam | Superpozicija (COCI22_superpozicija) | C++17 | 50 ms | 512 KB |
#include<bits/stdc++.h> using namespace std; constexpr int sz = 200002; int n, a[sz], b[sz]; string z; signed main(){ ios_base::sync_with_stdio(0); int T; cin >> T; function<void()> test_case = [](){ cin >> n >> z; for(register int i = 1; i <= n; ++i){ cin >> a[i] >> b[i]; a[i]--, b[i]--; } //assert(n<=10); for(register int mask = 0; mask < (1 << n); ++mask){ bool flag = true; int tot(0); for(register int i = 1; i <= n && flag; ++i){ if(mask & (1<<(i-1))){ tot += (z[b[i]]=='('?1:-1); }else{ tot += (z[a[i]]=='('?1:-1); } flag &= (tot >= 0); } flag &= !tot; if(flag){ for(register int i = 0; i < n; ++i){ cout << (bool)(mask & (1 << i)) << " \n"[i==n-1]; } return; } } cout << -1 << '\n'; }; while(T--) test_case(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 50 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 50 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |