Submission #1003845

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003845		Lobo	Zagrade (COI20_zagrade)	C++17	0 / 100	542 ms	1112 KiB

zagrade

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
const int maxn = 5e5+10;
const int inf = 1e18+10;
int n;
int query(int l, int r) {
	if(l > r) return 0;
	if(l < 0 or r >= n) return 0;
	cout << "? " << l+1 << " " << r+1 << endl;
	cout.flush(); 
	int x; cin >> x;
	return x;
}

int32_t main() {
	// #ifndef ONLINE_JUDGE
	// freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
	// #endif

	int q;
	cin >> n >> q;
	vector<int> ans(n,0);
	int antok = -inf;
	int pos = 0;
	int qtd = n/2;
	while(pos+1 < n) {
		int l = pos+1;
		int r = pos;
		while(l-1 > antok && query(l-1,r+1)) {
			l--;
			r++;
			ans[l] = +1;
			ans[r] = -1;
			qtd--;
		}
		if(l <= r) antok = r;
		pos = r+1;
	}

	for(int i = 0; i < n; i++) {
		if(ans[i] == 0) {
			if(qtd == 0) {
				ans[i] = +1;
			}
			else {
				qtd--;
				ans[i] = -1;
			}
		}
	}

	cout << "! ";
	for(int i = 0; i < n; i++) {
		if(ans[i] == -1) cout << ')';
		else cout << '(';
	}
	cout.flush();
}

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