답안 #106633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106633 2019-04-19T10:34:17 Z username Gap (APIO16_gap) C++14
78.541 / 100
78 ms 2464 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);
//		MinMax(0,1e18,&mn,&mx); // check addition
		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;
		}
	}
	return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 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 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 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 14 ms 896 KB Output is correct
17 Correct 15 ms 896 KB Output is correct
18 Correct 14 ms 896 KB Output is correct
19 Correct 15 ms 896 KB Output is correct
20 Correct 14 ms 896 KB Output is correct
21 Correct 54 ms 2288 KB Output is correct
22 Correct 56 ms 2288 KB Output is correct
23 Correct 52 ms 2260 KB Output is correct
24 Correct 59 ms 2288 KB Output is correct
25 Correct 53 ms 2288 KB Output is correct
26 Correct 54 ms 2288 KB Output is correct
27 Correct 57 ms 2416 KB Output is correct
28 Correct 52 ms 2288 KB Output is correct
29 Correct 54 ms 2464 KB Output is correct
30 Correct 43 ms 2288 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 256 KB Partially correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Partially correct 0 ms 384 KB Partially correct
6 Correct 2 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 2 ms 384 KB Output is correct
10 Correct 2 ms 356 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 Partially correct 3 ms 384 KB Partially correct
16 Correct 17 ms 588 KB Output is correct
17 Correct 23 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 Partially correct 11 ms 512 KB Partially correct
21 Correct 67 ms 1144 KB Output is correct
22 Correct 68 ms 1144 KB Output is correct
23 Correct 73 ms 1144 KB Output is correct
24 Correct 71 ms 1264 KB Output is correct
25 Partially correct 78 ms 1152 KB Partially correct
26 Correct 74 ms 1144 KB Output is correct
27 Correct 66 ms 1144 KB Output is correct
28 Correct 74 ms 1116 KB Output is correct
29 Correct 72 ms 1152 KB Output is correct
30 Partially correct 31 ms 1196 KB Partially correct
31 Partially correct 2 ms 384 KB Partially correct
32 Partially correct 2 ms 384 KB Partially correct