제출 #781313

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
781313		makanhulia	Zagrade (COI20_zagrade)	C++17	100 / 100	809 ms	1204 KiB

zagrade

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define pque priority_queue
#define pqueg priority_queue<ll,vector<ll>,greater<ll>>
#define que queue<ll>
#define FOR(m,i,n) for(int i=(m); i<=(n); i++)
#define FORM(m,i,n) for(int i=(m); i>=(n); i--)
ll n,q,temp;
ll a,cnt;
stack<ll> st;
char ans[100100];
int main() {
  cin >> n >> q;
  FOR(1,i,n) {
    if(!st.empty()) {
      cout << "? " << st.top() << " " << i << endl;
      cin >> a;
      if(a == 1) {
        ans[st.top()] = '(';
        ans[i] = ')';
        cnt += 2;
        st.pop();
      }
      else {
        st.push(i);
      }
    }
    else {
      st.push(i);
    }
  }
  cnt = n - cnt;
  temp = cnt;
  FOR(1,i,n) {
    if(temp > cnt/2 && ans[i] != ')' && ans[i] != '(') {
      ans[i] = ')';
      temp--;
    }
    else if(ans[i] != ')' && ans[i] != '(') {
      ans[i] = '(';
    }
  }
  cout << "! ";
  FOR(1,i,n) {
    cout << ans[i];
  }
  cout << endl;
}

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