답안 #105005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105005 2019-04-10T06:03:36 Z puyu_liao Gap (APIO16_gap) C++14
87.6397 / 100
84 ms 2744 KB
#include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define N 300006
 
//vector<int> vv;
//void MinMax(long long s, long long t, long long* mn, long long* mx){
//	cout << "ASKed " << s << ' ' << t << '\n';
//	auto imn = lower_bound(vv.begin(),vv.end(),s);
//	auto imx = upper_bound(vv.begin(),vv.end(),t);
//	if(imn == vv.end() || imx == vv.begin() || *imn > *--imx) {
//		cout << "return (-1,-1)" << '\n';
//		return *mn = *mx = -1ll, void();
//	}
//	*mn = *imn;
//	*mx = *imx;
//	cout << "return " << complex<int>(*mn,*mx) << '\n';
//}
 
#include "gap.h"
typedef long long ll;
 
ll findGap(int T,int n){
	if(T==1){
		vector<ll> v1,v2;
		ll ans = 0;
		ll s = 0, t = 1000000000000000000ll,mn,mx;
		for(int i=1,j=n;i<=j;i++,j--){
			MinMax(s,t,&mn,&mx);
			v1.push_back(mn);
			if(i != j) v2.push_back(mx);
			s = mn+1; t=mx-1;
		}
		reverse(v2.begin(),v2.end());
		for(ll i : v2) v1.push_back(i);
		for(int i=0;i<v1.size()-1;i++) ans = max(ans,v1[i+1]-v1[i]);
		return ans;
	}
	else{
		ll ans = 0;
		ll s = 0,t=1000000000000000000ll,mn,mx,gap,last;
		MinMax(s,t,&mn,&mx);
		s = mn + 1, t = mx - 1;
		if(n == 2) return mx - mn;
		gap = (mx-mn+1)/(n);
		last = mn;
		while(s + gap <= t){
			MinMax(s,s + gap,&mn,&mx);
			if(mn != -1) ans = max(ans,mn - last),last = mx;
			s += gap;
		}
		MinMax(s,t,&mn,&mx);
		if(mn != -1) ans = max(ans,mn - last),last = mx;
		ans = max(ans,t+1 - last);
		return ans;
	}
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:37:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<v1.size()-1;i++) ans = max(ans,v1[i+1]-v1[i]);
               ~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 356 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 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 3 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 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 19 ms 1068 KB Output is correct
17 Correct 16 ms 1024 KB Output is correct
18 Correct 16 ms 1068 KB Output is correct
19 Correct 15 ms 1068 KB Output is correct
20 Correct 15 ms 1024 KB Output is correct
21 Correct 51 ms 2724 KB Output is correct
22 Correct 51 ms 2716 KB Output is correct
23 Correct 54 ms 2716 KB Output is correct
24 Correct 53 ms 2716 KB Output is correct
25 Correct 44 ms 2720 KB Output is correct
26 Correct 51 ms 2720 KB Output is correct
27 Correct 50 ms 2716 KB Output is correct
28 Correct 49 ms 2744 KB Output is correct
29 Correct 52 ms 2720 KB Output is correct
30 Correct 41 ms 2712 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 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 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 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 4 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 19 ms 512 KB Output is correct
17 Correct 18 ms 512 KB Output is correct
18 Correct 18 ms 512 KB Output is correct
19 Correct 19 ms 512 KB Output is correct
20 Partially correct 10 ms 384 KB Partially correct
21 Correct 82 ms 1272 KB Output is correct
22 Correct 76 ms 1152 KB Output is correct
23 Correct 68 ms 1152 KB Output is correct
24 Correct 66 ms 1152 KB Output is correct
25 Correct 67 ms 1244 KB Output is correct
26 Correct 75 ms 1220 KB Output is correct
27 Correct 84 ms 1176 KB Output is correct
28 Correct 80 ms 1200 KB Output is correct
29 Correct 84 ms 1272 KB Output is correct
30 Partially correct 40 ms 1144 KB Partially correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct