Submission #557798

#TimeUsernameProblemLanguageResultExecution timeMemory
557798Yazan_AlattarZagrade (COI20_zagrade)C++14
14 / 100
1427 ms324 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define F first #define S second #define pb push_back #define endl "\n" #define all(x) x.begin(), x.end() const int M = 500007; const ll inf = 2e9; const ll mod = 1e9 + 7; const double pi = acos(-1); const double eps = 1e-6; const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0}; const int block = 320; char ans[M]; int n, q; int ask(int l, int r){ cout << "? " << l << " " << r << endl; cout.flush(); int ret; cin >> ret; return ret; } void solve(int l, int r){ if(l > r) return; for(int i = l + 1; i <= r; i += 2){ if(ask(l, i)){ ans[l] = '('; ans[i] = ')'; solve(l + 1, i - 1); solve(i + 1, r); return; } } solve(l + 1, r); return; } int main(){ // ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; solve(1, n); int rem = n / 2; for(int i = 1; i <= n; ++i) if(ans[i] == ')') --rem; cout << "! "; for(int i = 1; i <= n; ++i){ if(ans[i]) cout << ans[i]; else if(rem) cout << ')', --rem; else cout << '('; } 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...