Submission #640268

#TimeUsernameProblemLanguageResultExecution timeMemory
640268christinelynnZagrade (COI20_zagrade)C++17
0 / 100
1408 ms308 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, ar[N]; ll x, y, k; string s, s1, s2, ye = "YES", no = "NO"; vector<pairll> v; char cr[N]; void input(){ cin >> n >> k; } void solve(){ repp(i,1,n){ for (ll j = i+1; j <= n; j += 2){ cout << "? " << i << " " << j << endl; cin >> m; if (m == 1){ cr[i] = '('; cr[j] = ')'; } } } cout << "! "; repp(i,1,n){ cout << cr[i]; } cout << endl; } 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...