Submission #106631

# Submission time Handle Problem Language Result Execution time Memory
106631 2019-04-19T10:29:58 Z username Gap (APIO16_gap) C++14
100 / 100
89 ms 2312 KB
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
#define VIS(it,con) for(auto it=con.begin();it!=con.end();++it)
#define MIN(x,y) (x=min(x,(y)))
#define MAX(x,y) (x=max(x,(y)))
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define MST(a,v) memset(a,(v),sizeof a)
#define pb push_back

typedef long long ll;
ll findGap(int t,int n){
	ll mn,mx,res=0;
	if(t==1){
		vector<ll>num;
		ll lb=0,rb=1e18;
		REP(i,0,(n+1)/2){
			MinMax(lb,rb,&mn,&mx);
			num.pb(mn);
			if(n%2==0||i+1<(n+1)/2)num.pb(mx);
			lb=mn+1,rb=mx-1;
		}
		sort(ALL(num));
		REP(i,1,n)MAX(res,num[i]-num[i-1]);
	}else{
		MinMax(0,1e18,&mn,&mx);
		ll d=res=(mx-mn+n-2)/(n-1);
		ll MX=mx,lb=mn,last=mn;
		while(1){
			if(lb>MX)break;
			MinMax(lb,lb+d,&mn,&mx);
			if(mn>=0){
				MAX(res,mn-last);
				last=mx;
			}
			lb+=d+1;
		}
	}
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 304 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 21 ms 896 KB Output is correct
17 Correct 15 ms 896 KB Output is correct
18 Correct 16 ms 1152 KB Output is correct
19 Correct 20 ms 1024 KB Output is correct
20 Correct 12 ms 1024 KB Output is correct
21 Correct 58 ms 2288 KB Output is correct
22 Correct 78 ms 2288 KB Output is correct
23 Correct 60 ms 2288 KB Output is correct
24 Correct 63 ms 2288 KB Output is correct
25 Correct 48 ms 2288 KB Output is correct
26 Correct 62 ms 2288 KB Output is correct
27 Correct 70 ms 2284 KB Output is correct
28 Correct 54 ms 2292 KB Output is correct
29 Correct 55 ms 2312 KB Output is correct
30 Correct 42 ms 2288 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 22 ms 512 KB Output is correct
17 Correct 23 ms 512 KB Output is correct
18 Correct 18 ms 540 KB Output is correct
19 Correct 17 ms 512 KB Output is correct
20 Correct 10 ms 512 KB Output is correct
21 Correct 71 ms 1144 KB Output is correct
22 Correct 73 ms 1144 KB Output is correct
23 Correct 89 ms 1196 KB Output is correct
24 Correct 63 ms 1152 KB Output is correct
25 Correct 59 ms 1152 KB Output is correct
26 Correct 81 ms 1200 KB Output is correct
27 Correct 66 ms 1144 KB Output is correct
28 Correct 68 ms 1152 KB Output is correct
29 Correct 68 ms 1248 KB Output is correct
30 Correct 44 ms 1152 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct