Submission #106647

# Submission time Handle Problem Language Result Execution time Memory
106647 2019-04-19T11:00:44 Z username Gap (APIO16_gap) C++14
70 / 100
80 ms 1272 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){
		return 0; //
		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;
		REP(i,0,n-1){
			MinMax(lb,lb+d-1,&mn,&mx);
			if(mn>=0){
				MAX(res,mn-last);
				last=mx;
			}
			lb+=d;
		}
		MAX(res,MX-last);
	}
	return res;
}
# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 384 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Incorrect 3 ms 384 KB Output isn't correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Incorrect 3 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 Incorrect 3 ms 384 KB Output isn't correct
13 Incorrect 6 ms 384 KB Output isn't correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Incorrect 9 ms 512 KB Output isn't correct
17 Incorrect 9 ms 512 KB Output isn't correct
18 Incorrect 9 ms 512 KB Output isn't correct
19 Incorrect 8 ms 512 KB Output isn't correct
20 Incorrect 6 ms 512 KB Output isn't correct
21 Incorrect 36 ms 1144 KB Output isn't correct
22 Incorrect 25 ms 1148 KB Output isn't correct
23 Incorrect 30 ms 1144 KB Output isn't correct
24 Incorrect 27 ms 1144 KB Output isn't correct
25 Incorrect 22 ms 1152 KB Output isn't correct
26 Incorrect 27 ms 1132 KB Output isn't correct
27 Incorrect 32 ms 1152 KB Output isn't correct
28 Incorrect 29 ms 1144 KB Output isn't correct
29 Incorrect 29 ms 1144 KB Output isn't correct
30 Incorrect 14 ms 1152 KB Output isn't correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 2 ms 384 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 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 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 23 ms 512 KB Output is correct
17 Correct 21 ms 512 KB Output is correct
18 Correct 19 ms 512 KB Output is correct
19 Correct 18 ms 512 KB Output is correct
20 Correct 14 ms 512 KB Output is correct
21 Correct 72 ms 1152 KB Output is correct
22 Correct 80 ms 1144 KB Output is correct
23 Correct 64 ms 1116 KB Output is correct
24 Correct 76 ms 1040 KB Output is correct
25 Correct 61 ms 1152 KB Output is correct
26 Correct 70 ms 1272 KB Output is correct
27 Correct 73 ms 1144 KB Output is correct
28 Correct 74 ms 1200 KB Output is correct
29 Correct 64 ms 1144 KB Output is correct
30 Correct 41 ms 1164 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct