답안 #1073500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073500	2024-08-24T15:26:54 Z	Hugo1729	Gap (APIO16_gap)	C++11	100 / 100	32 ms	4340 KB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;


ll solve1(int N){
	ll s=0,t=1e18,ml=0,mr;

	vector<ll> ans,sus2;
	
	for(int i=0;i<N;i+=2){
		MinMax(s,t,&ml,&mr);

		if(mr==-1)break;

		ans.push_back(ml);
		if(ml==mr)break;
		sus2.push_back(mr);

		s=ml+1;
		t=mr-1;
	}

	for(int j=sus2.size()-1;j>=0;j--){
		ans.push_back(sus2[j]);
	}

	ll out=0;

	for(int i=0;i<N;i++){
		out=max(out,ans[i+1]-ans[i]);
	}

	// for(int i : ans)cout << i << ' ';
	// cout << '\n';
	

	return out;
}

ll solve2(int N){
	ll ml,mr;
	
	MinMax(0,1e18,&ml,&mr);

	ll lo=ml,hi=mr;
	ll L=hi-lo;
	ll sus=(L+N-2)/(N-1);

	ll ans = sus;

	ll prev=lo;

	for(ll i=ml+1;i<hi;i+=sus){
		sus=ans;
		MinMax(i,min(i+sus,hi-1),&ml,&mr);

		if(ml==-1)continue;

		ans=max(ans,ml-prev);

		prev=mr;
	}

	return max(ans,hi-prev);
}

ll findGap(int T, int N){
	if(T==1)return solve1(N);
	else return solve2(N);
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	2392 KB	Output is correct
3	Correct	0 ms	2392 KB	Output is correct
4	Correct	0 ms	2392 KB	Output is correct
5	Correct	0 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	0 ms	2392 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	0 ms	2392 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2392 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	10 ms	3008 KB	Output is correct
17	Correct	6 ms	2904 KB	Output is correct
18	Correct	7 ms	2904 KB	Output is correct
19	Correct	7 ms	2904 KB	Output is correct
20	Correct	6 ms	2904 KB	Output is correct
21	Correct	26 ms	4220 KB	Output is correct
22	Correct	25 ms	4212 KB	Output is correct
23	Correct	27 ms	4340 KB	Output is correct
24	Correct	25 ms	4320 KB	Output is correct
25	Correct	25 ms	4212 KB	Output is correct
26	Correct	26 ms	4220 KB	Output is correct
27	Correct	26 ms	4220 KB	Output is correct
28	Correct	29 ms	4220 KB	Output is correct
29	Correct	26 ms	4220 KB	Output is correct
30	Correct	21 ms	4220 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	1 ms	2392 KB	Output is correct

Subtask #2

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2392 KB	Output is correct
3	Correct	0 ms	2392 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	0 ms	2392 KB	Output is correct
6	Correct	0 ms	2392 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2488 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	0 ms	2392 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2392 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	5 ms	2392 KB	Output is correct
17	Correct	5 ms	2392 KB	Output is correct
18	Correct	4 ms	2508 KB	Output is correct
19	Correct	5 ms	2392 KB	Output is correct
20	Correct	4 ms	2392 KB	Output is correct
21	Correct	16 ms	2860 KB	Output is correct
22	Correct	16 ms	2648 KB	Output is correct
23	Correct	16 ms	2648 KB	Output is correct
24	Correct	17 ms	2740 KB	Output is correct
25	Correct	32 ms	2648 KB	Output is correct
26	Correct	16 ms	2648 KB	Output is correct
27	Correct	17 ms	2648 KB	Output is correct
28	Correct	20 ms	2864 KB	Output is correct
29	Correct	16 ms	2800 KB	Output is correct
30	Correct	17 ms	2648 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	0 ms	2392 KB	Output is correct