이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/* Quick Note :
* Jangan Mikir Lama - lama, sampahin dulu aja kalo OI
* Always Try to reset
*/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ld PI = 4*atan((ld)1);
const ll mod = 1e9 + 7;
const ll inf = 922337203685477;
const ll nax = 1e5 + 5;
ll n, q;
char ans[nax];
ll ask(ll l, ll r){
cout << "? " << l << " " << r << endl;
ll ret;
cin >> ret;
return ret;
}
int main(){
cin >> n >> q;
// reset
for(ll i = 1; i <= n; i++){
ans[i] = '*';
}
vector<ll> stk;
stk.pb(1);
ll half = 0;
for(ll i = 2; i <= n; i++){
if(stk.size() == 0){
stk.pb(i);
continue;
}
ll ls = stk.back();
ll ret = ask(ls, i);
if(ret == 0){
stk.pb(i);
}
else{
stk.pop_back();
half++;
ans[ls] = '(';
ans[i] = ')';
}
}
cout << "! ";
for(ll i = 1; i <= n; i++){
if(ans[i] == '*'){
if(half != n / 2){
half++;
ans[i] = ')';
}
else{
ans[i] = '(';
}
}
cout << ans[i];
}
cout << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |