제출 #957809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957809		ono_de206	Mađioničar (COI22_madionicar)	C++14	0 / 100	0 ms	460 KiB

Main

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

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
int p[mxn];

int ask(int l, int r) {
	cout << l << ' ' << r << endl;
	int res;
	cin >> res;
	return res;
}

void go() {
	int n;
	cin >> n;
	p[1] = 0;
	int l = 1, r = 1;
	for(int i = 2; i <= n; i++) {
		p[i] = max(0, min(r - i, p[l + (r - i)]));
		while(i - p[i] - 1 >= 1 && i + p[i] + 1 <= n) {
			if(ask(i - p[i] - 1, i + p[i] + 1) == 1) p[i]++;
			else break;
		}
		if(i + p[i] > r) {
			l = i - p[i];
			r = i + p[i];
		}
	}
	int ans = 0;
	for(int i = 1; i <= n; i++) {
		mxx(ans, p[i] * 2 + 1);
		p[i] = 0;
	}
	l = 0, r = 0;
	for(int i = 2; i <= n; i++) {
		p[i] = max(0, min(r - i, (l + (r - i) > 0 ? p[l + (r - i)] : 0)));
		while(i - p[i] - 1 >= 1 && i + p[i] <= n) {
			if(ask(i - p[i] - 1, i + p[i]) == 1) p[i]++;
			else break;
		}
		if(i + p[i] > r) {
			l = i - p[i] + 1;
			r = i + p[i];
		}
	}
	for(int i = 1; i <= n; i++) {
		mxx(ans, p[i] * 2);
	}
	cout << "! " << ans << endl;
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37