Submission #1003809

#TimeUsernameProblemLanguageResultExecution timeMemory
1003809mariaclaraZagrade (COI20_zagrade)C++17
0 / 100
512 ms1256 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; const int MAXN = 1e5+5; #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() #define pb push_back #define fr first #define sc second int n, q; string ans; int main() { cin >> n >> q; for(int i = 1; i <= n; i++) ans += '.'; stack<int> fila; fila.push(1); for(int i = 2; i <= n; i++) { int x = fila.top(), aux; cout << "? " << x << " " << i << endl; cout.flush(); cin >> aux; if(aux) { fila.pop(); ans[x-1] = '('; ans[i-1] = ')'; continue; } fila.push(i); } int s = sz(fila); for(int i = 1; i <= s; i++) { if(i <= s/2) ans[fila.top()-1] = '('; else ans[fila.top()-1] = ')'; fila.pop(); } cout << "! " << ans << endl; cout.flush(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...