# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
593521 |
2022-07-11T10:19:00 Z |
jiahng |
Zagrade (COI20_zagrade) |
C++14 |
|
0 ms |
208 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,ll> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 500100
#define INF (ll)1e14
#define MOD 1000000007
#define getchar_unlocked _getchar_nolock
int N,Q;
char ans[maxn];
bool qry(int a,int b){
cout << "? " << a << ' ' << b << '\n';
cout.flush();
bool res; cin >> res;
return res;
}
int32_t main(){
fast;
cin >> N >> Q;
stack <int> st; st.push(1);
FOR(i,2,N){
if (!st.empty() && qry(st.top(), i)){
ans[i] = ')'; ans[st.top()] = '('; st.pop();
}else st.push(i);
}
int M = st.size();
FOR(i,1,M){
ans[st.top()] = (i <= M/2 ? '(' : ')'); st.pop();
}
cout << st.size() << '\n';
cout << "! "; FOR(i,1,N) cout << ans[i]; cout << '\n';
cout.flush();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect query 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect query 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect query 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect query 0 |
2 |
Halted |
0 ms |
0 KB |
- |