제출 #1152393

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1152393		YSH2020	Zagrade (COI20_zagrade)	C++20	0 / 100	0 ms	416 KiB

zagrade

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n, q; cin >> n >> q;
  //suppose this is a valid bracket sequence.
  int ans[n];
  ans[0] = 0;
  ans[n-1] = 1;
  int s = 0, e = n-1; //you know s, e is a valid sequence
  while (e-s >= 1) {
    cout << '?' << s << ' ' << s+1 << '\n';
    int x; cin >> x;
    if (x == 1) {
      ans[s+1] = 1;
      ans[s+2] = 0;
      s += 2;
    }
    else {
      ans[s+1] = 0;
      ans[e-1] = 1;
      s++;
      e--;
    }
  }
  for (int i = 0; i < n; i++) {
    if (ans[i] == 0) cout << '(';
    else cout << ')';
  }
}

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