답안 #1050597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050597 2024-08-09T11:39:31 Z matere Gap (APIO16_gap) C++14
89.0375 / 100
39 ms 2984 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int T, int N){
	if(T==1){
		long long mn=-1,mx=-1;
		MinMax(1,1000000000000000000,&mn,&mx);
		long long premn=mn,premx=mx;
		long long ans=0;
		for(int i=1;i<(N+1)/2;i++){
			premn=mn,premx=mx;
			MinMax(mn+1,mx-1,&mn,&mx);
			ans=max(ans,mn-premn);
			ans=max(ans,premx-mx);
		}
		ans=max(ans,mx-mn);
		return ans;
	}
	long long mn=-1,mx=-1;
	MinMax(1,1000000000000000000,&mn,&mx);
	long long diff = mx-mn;
	long long mxx = mx;
	long long mnd=diff/(N-1);
	long long ans=mnd,curm=mn;
	for(long long i=mn+1;i<=mxx-1;i+=mnd){
		// cout<<i<<' '<<i+mnd-1<<' ';
		MinMax(i,min(mxx,i+mnd-1),&mn,&mx);
		// cout<<mn<<' '<<mx<<endl;
		if(mn==-1) continue;
		// cout<<mn<<' '<<curm<<endl;
		ans=max(ans,mn-curm);
		curm=mx;
	}
	return ans;
}
# 결과 실행 시간 메모리 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 0 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 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 0 ms 2392 KB Output is correct
12 Correct 1 ms 2436 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 2496 KB Output is correct
17 Correct 7 ms 2392 KB Output is correct
18 Correct 6 ms 2392 KB Output is correct
19 Correct 8 ms 2392 KB Output is correct
20 Correct 5 ms 2392 KB Output is correct
21 Correct 32 ms 2872 KB Output is correct
22 Correct 29 ms 2648 KB Output is correct
23 Correct 21 ms 2648 KB Output is correct
24 Correct 32 ms 2644 KB Output is correct
25 Correct 20 ms 2868 KB Output is correct
26 Correct 21 ms 2648 KB Output is correct
27 Correct 21 ms 2648 KB Output is correct
28 Correct 21 ms 2648 KB Output is correct
29 Correct 21 ms 2648 KB Output is correct
30 Correct 27 ms 2648 KB Output is correct
31 Correct 0 ms 2388 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 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 7 ms 2392 KB Output is correct
17 Correct 7 ms 2392 KB Output is correct
18 Correct 7 ms 2392 KB Output is correct
19 Correct 9 ms 2560 KB Output is correct
20 Partially correct 4 ms 2392 KB Partially correct
21 Correct 29 ms 2848 KB Output is correct
22 Correct 36 ms 2864 KB Output is correct
23 Correct 32 ms 2840 KB Output is correct
24 Correct 33 ms 2696 KB Output is correct
25 Correct 34 ms 2840 KB Output is correct
26 Correct 39 ms 2648 KB Output is correct
27 Correct 35 ms 2648 KB Output is correct
28 Correct 30 ms 2840 KB Output is correct
29 Correct 35 ms 2984 KB Output is correct
30 Partially correct 22 ms 2704 KB Partially correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct