oj.uz

답안 #959978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959978 2024-04-09T11:39:24 Z pcc Mađioničar (COI22_madionicar) C++17
100 / 100
 1369 ms 14848 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")

#define pii pair<int,int>
#define fs first
#define sc second
#define ll long long

const int mxn = 2e5+10;
int N;
int Z[mxn];
map<pii,int> mp;

bool check(int l,int r){
	assert((r-l)%2==0);
	if(l<=0||r>=N*2)return false;
	assert(l<=r);
	if(l%2==0)l++,r--;
	if(r<=l)return true;
	l = (l+1)>>1;
	r = (r+1)>>1;
	if(mp.find(pii(l,r)) != mp.end())return mp[pii(l,r)];
	cout<<"? "<<l<<' '<<r<<endl;
	/*
	cerr<<"? "<<l<<' '<<r<<endl;
   */
	int re;
	cin>>re;
	return mp[pii(l,r)] = re;
}

int main(){
	cin>>N;
	int cen = 1,rp = 2;
	Z[1] = 1;
	for(int i = 2;i<N*2;i++){
		//cerr<<i<<":"<<cen<<','<<rp<<endl;
		if(i>=rp);
		else if(Z[cen*2-i]+i<rp){
			Z[i] = Z[cen*2-i];
			continue;
		}
		else if(Z[cen*2-i]+i>rp){
			Z[i] = rp-i;
			continue;
		}
		cen = i,rp = max(i+1,rp);
		while(check(cen*2-rp,rp))rp++;
		Z[i] = rp-i;
		//cerr<<i<<"::"<<Z[i]<<endl;
	}
	//for(int i = 1;i<N*2;i++)cerr<<Z[i]<<' ';cerr<<endl;
	int ans = 0;
	for(int i = 1;i<N*2;i++){
		if(i&1)ans = max(ans,(Z[i]+1)/2*2-1);
		else{
			ans = max(ans,Z[i]-(Z[i]&1));
		}
	}
	cout<<"! "<<ans<<endl;
}

Compilation message

Main.cpp: In function 'bool check(int, int)':
Main.cpp:32:22: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   32 |  return mp[pii(l,r)] = re;

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2256 KB Output is correct
2 Correct 89 ms 1536 KB Output is correct
3 Correct 77 ms 1636 KB Output is correct
4 Correct 59 ms 1776 KB Output is correct
5 Correct 64 ms 2392 KB Output is correct
6 Correct 56 ms 1920 KB Output is correct
7 Correct 69 ms 2148 KB Output is correct
8 Correct 65 ms 2128 KB Output is correct
9 Correct 71 ms 2180 KB Output is correct
10 Correct 90 ms 2248 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2256 KB Output is correct
2 Correct 89 ms 1536 KB Output is correct
3 Correct 77 ms 1636 KB Output is correct
4 Correct 59 ms 1776 KB Output is correct
5 Correct 64 ms 2392 KB Output is correct
6 Correct 56 ms 1920 KB Output is correct
7 Correct 69 ms 2148 KB Output is correct
8 Correct 65 ms 2128 KB Output is correct
9 Correct 71 ms 2180 KB Output is correct
10 Correct 90 ms 2248 KB Output is correct
11 Correct 633 ms 8132 KB Output is correct
12 Correct 785 ms 9608 KB Output is correct
13 Correct 757 ms 9740 KB Output is correct
14 Correct 676 ms 9232 KB Output is correct
15 Correct 721 ms 9476 KB Output is correct
16 Correct 741 ms 9852 KB Output is correct
17 Correct 765 ms 9884 KB Output is correct
18 Correct 586 ms 7736 KB Output is correct
19 Correct 750 ms 10088 KB Output is correct
20 Correct 672 ms 8836 KB Output is correct
21 Correct 622 ms 8388 KB Output is correct
22 Correct 729 ms 9872 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 868 ms 11796 KB Output is correct
2 Correct 795 ms 11536 KB Output is correct
3 Correct 909 ms 11332 KB Output is correct
4 Correct 1273 ms 14700 KB Output is correct
5 Correct 1219 ms 14424 KB Output is correct
6 Correct 892 ms 10676 KB Output is correct
7 Correct 1250 ms 14728 KB Output is correct
8 Correct 897 ms 11164 KB Output is correct
9 Correct 833 ms 11112 KB Output is correct
10 Correct 872 ms 11432 KB Output is correct
11 Correct 1300 ms 14724 KB Output is correct
12 Correct 1211 ms 14336 KB Output is correct
13 Correct 847 ms 11700 KB Output is correct
14 Correct 903 ms 11460 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2256 KB Output is correct
2 Correct 89 ms 1536 KB Output is correct
3 Correct 77 ms 1636 KB Output is correct
4 Correct 59 ms 1776 KB Output is correct
5 Correct 64 ms 2392 KB Output is correct
6 Correct 56 ms 1920 KB Output is correct
7 Correct 69 ms 2148 KB Output is correct
8 Correct 65 ms 2128 KB Output is correct
9 Correct 71 ms 2180 KB Output is correct
10 Correct 90 ms 2248 KB Output is correct
11 Correct 633 ms 8132 KB Output is correct
12 Correct 785 ms 9608 KB Output is correct
13 Correct 757 ms 9740 KB Output is correct
14 Correct 676 ms 9232 KB Output is correct
15 Correct 721 ms 9476 KB Output is correct
16 Correct 741 ms 9852 KB Output is correct
17 Correct 765 ms 9884 KB Output is correct
18 Correct 586 ms 7736 KB Output is correct
19 Correct 750 ms 10088 KB Output is correct
20 Correct 672 ms 8836 KB Output is correct
21 Correct 622 ms 8388 KB Output is correct
22 Correct 729 ms 9872 KB Output is correct
23 Correct 868 ms 11796 KB Output is correct
24 Correct 795 ms 11536 KB Output is correct
25 Correct 909 ms 11332 KB Output is correct
26 Correct 1273 ms 14700 KB Output is correct
27 Correct 1219 ms 14424 KB Output is correct
28 Correct 892 ms 10676 KB Output is correct
29 Correct 1250 ms 14728 KB Output is correct
30 Correct 897 ms 11164 KB Output is correct
31 Correct 833 ms 11112 KB Output is correct
32 Correct 872 ms 11432 KB Output is correct
33 Correct 1300 ms 14724 KB Output is correct
34 Correct 1211 ms 14336 KB Output is correct
35 Correct 847 ms 11700 KB Output is correct
36 Correct 903 ms 11460 KB Output is correct
37 Correct 870 ms 11580 KB Output is correct
38 Correct 1127 ms 14112 KB Output is correct
39 Correct 1223 ms 14684 KB Output is correct
40 Correct 951 ms 12332 KB Output is correct
41 Correct 1085 ms 14660 KB Output is correct
42 Correct 1161 ms 14344 KB Output is correct
43 Correct 1181 ms 14604 KB Output is correct
44 Correct 934 ms 12216 KB Output is correct
45 Correct 1369 ms 14264 KB Output is correct
46 Correct 1090 ms 13456 KB Output is correct
47 Correct 1055 ms 13720 KB Output is correct
48 Correct 1141 ms 14556 KB Output is correct
49 Correct 1207 ms 14400 KB Output is correct
50 Correct 1006 ms 11384 KB Output is correct
51 Correct 1166 ms 14616 KB Output is correct
52 Correct 1203 ms 14848 KB Output is correct