Submission #920456

#TimeUsernameProblemLanguageResultExecution timeMemory
920456zeta7532Zagrade (COI20_zagrade)C++17
0 / 100
443 ms2184 KiB
#include <bits/stdc++.h> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; using ll = long long; const ll mod = 998244353; #define fi first #define se second #define rep(i,n) for(ll i=0;i<n;i++) #define all(x) x.begin(),x.end() #define faster ios::sync_with_stdio(false);cin.tie(nullptr) int main() { ll N,Q; cin >> N >> Q; vector<char> ans(N,'-'); deque<ll> que; ll l=0; ans[0]='('; que.push_back(0); ll r=1; while(1){ if(r>=N) break; cout << "?" << " " << l+1 << " " << r+1 << endl; ll q; cin >> q; if(q==0){ ans[r]='('; que.push_back(r); l=r; r=l+1; } if(q==1){ que.pop_back(); ans[r]=')'; if(que.empty()){ l=r+1; if(r+1!=N) ans[r+1]='('; if(r+1!=N) que.push_back(r+1); r=l+1; }else{ l=l-1; r=r+1; } } } cout << "!" << " "; rep(i,N) cout << ans[i]; cout << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...