Submission #640279

#TimeUsernameProblemLanguageResultExecution timeMemory
640279devariaotaZagrade (COI20_zagrade)C++17
0 / 100
1400 ms1364 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define db double #define pairll pair<ll,ll> #define lpairll pair<ll,pairll> #define repp(i,a,b) for (ll i = a; i <= b; i++) #define repz(i,a,b) for (ll i = a; i < b; i++) #define repm(i,a,b) for (ll i = a; i >= b; i--) #define fr first #define sc second #define mp make_pair #define pb push_back const ll N = 1e5+5, MOD = 1e9+7; ll tc = 1, n, m, fnd[N]; ll x, y, k; string s, s1, s2, ye = "YES", no = "NO"; char cr[N]; void input(){ cin >> n >> k; } void solve(){ ll tot = 0; for (ll i = 1; i <= n; i++){ for (ll j = i+1; j <= n; j += 2){ cout << "? " << i << " " << j << endl; cout.flush(); cin >> m; if (m == 1){ cr[i] = '('; cr[j] = ')'; if (fnd[i] == 0){ fnd[i] = 1; tot++; } if (fnd[j] == 0){ fnd[j] = 1; tot++; } } if (tot >= n) break; } if (tot >= n) break; } cout << "! "; for (ll i = 1; i <= n; i++){ cout << cr[i]; } cout << endl; cout.flush(); } int main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); //cin >> tc; while(tc--){ input(); solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...