Submission #640258

#	Time	Username	Problem	Language	Result	Execution time	Memory
640258		devariaota	Zagrade (COI20_zagrade)	C++17	0 / 100	1260 ms	1104 KiB

zagrade

#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, M = 1e3+5;
ll tc = 1, n, m, ar[N], br[N];
ll x, y, k, open = 0, close = 0;
string s, s1, s2, ye = "YES", no = "NO";
vector<pairll> v;

void opex(){
  cout << "! ((((((((((((((" << endl;
  exit(0);
}

ll ask(ll l, ll r){
  // if(ar[l] != -1 && ar[r] != -1 && (r-l) == 1){
  //   if (ar[l] == 0 && ar[r] == 1) return 1;
  //   return 0;
  // }
  k++;
  if (k > (n*n)/4) opex();
  cout << "? " << l << " " << r << endl;
  ll dum; cin >> dum;
  return dum;
}

void input(){
  cin >> n >> k;
  k = 0;
}

void answ(){
  cout << "! ";
  repp(i,1,n){
    if (ar[i] == 0) cout << "(";
    else cout << ")";
  }
  cout << endl;
}

void sub12(){
  memset(ar,-1,sizeof(ar));
  repp(i,1,n){
    for (int j = i+1; j <= n; j += 2){
      cout << "? " << i << " " << j << endl;
      ll tmp;
      cin >> tmp;
      if (tmp == 1)
      {
        ar[i] = 0;
        ar[j] = 1;
      }
    }
  }
  answ();
}

void solve(){
  sub12();
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  //cin >> tc;
  while(tc--){
    input();
    solve();
  }
}

void sub3(){
  ll l = 1, r = n;
  memset(ar,-1,sizeof(ar));
  while(l < r){
    ll a1 = ask(l,r);
    if (a1 == 1){
      ar[l] = 0;
      ar[r] = 1;
      l++;
      r--;
      continue;
    }
    else{
      ll a2 = ask(l-1,l);
      //1 -> 0 1
      //0 -> 0 0
      if (a2 == 1){
        ar[l] = 1;
      }
      else ar[l] = 0;

      //1 -> 0 1
      //0 -> 1 1
      ll a3 = ask(r,r+1);
      if (a3 == 1){
        ar[r] = 0;
      }
      else ar[r] = 1;
      if (ar[l] && ar[r] == 0){
        l++;
        r--;
        if (l < r){
          ar[l] = 0;
          ar[r] = 1;
          l++;
          r--;
        }
      }
      else if (ar[l] && ar[r]){
        l++;
        // if (l >= r) break;
        ar[l] = 0;
        l++;
      }
      else{
        r--;
        // if (l >= r) break;
        ar[r] = 1;
        r--;
      }
    }
  }
  answ();
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 7
• Subtask 3: 0 / 57
• Subtask 4: 0 / 22