Submission #104976

# Submission time Handle Problem Language Result Execution time Memory
104976 2019-04-10T03:36:00 Z puyu_liao Gap (APIO16_gap) C++14
30 / 100
61 ms 2844 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> v;
//void MinMax(long long s, long long t, long long* mn, long long* mx){
//	cout << "ASKed " << s << ' ' << t << '\n';
//	auto imn = lower_bound(v.begin(),v.end(),s);
//	auto imx = upper_bound(v.begin(),v.end(),t);
//	if(imn == v.end() || imx == v.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 = 0,mn,mx,last; 
		MinMax(s,t,&mn,&mx);
		last = mn; s = t = mn+1;
		for(int i=1;i<n;i++){
			MinMax(s,t,&mn,&mx);
			ans = max(ans,mn-last);
			last = mn;
			s = t = mn+1;	
		}
		return ans;
	}
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:36: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]);
               ~^~~~~~~~~~~~
# 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 3 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 3 ms 384 KB Output is correct
12 Correct 0 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 15 ms 1068 KB Output is correct
17 Correct 16 ms 1144 KB Output is correct
18 Correct 15 ms 1016 KB Output is correct
19 Correct 17 ms 1024 KB Output is correct
20 Correct 11 ms 1024 KB Output is correct
21 Correct 55 ms 2736 KB Output is correct
22 Correct 49 ms 2716 KB Output is correct
23 Correct 48 ms 2716 KB Output is correct
24 Correct 54 ms 2628 KB Output is correct
25 Correct 43 ms 2716 KB Output is correct
26 Correct 54 ms 2716 KB Output is correct
27 Correct 54 ms 2720 KB Output is correct
28 Correct 61 ms 2660 KB Output is correct
29 Correct 52 ms 2844 KB Output is correct
30 Correct 42 ms 2724 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Incorrect 3 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 3 ms 384 KB Output isn't correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Incorrect 2 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 3 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 2 ms 384 KB Output isn't correct
14 Incorrect 4 ms 384 KB Output isn't correct
15 Incorrect 4 ms 384 KB Output isn't correct
16 Incorrect 13 ms 640 KB Output isn't correct
17 Incorrect 12 ms 512 KB Output isn't correct
18 Incorrect 13 ms 512 KB Output isn't correct
19 Incorrect 12 ms 512 KB Output isn't correct
20 Incorrect 10 ms 512 KB Output isn't correct
21 Incorrect 42 ms 1048 KB Output isn't correct
22 Incorrect 51 ms 1152 KB Output isn't correct
23 Incorrect 49 ms 1144 KB Output isn't correct
24 Incorrect 40 ms 1152 KB Output isn't correct
25 Incorrect 39 ms 1152 KB Output isn't correct
26 Incorrect 51 ms 1272 KB Output isn't correct
27 Incorrect 46 ms 1316 KB Output isn't correct
28 Incorrect 57 ms 1144 KB Output isn't correct
29 Incorrect 47 ms 1144 KB Output isn't correct
30 Incorrect 33 ms 1152 KB Output isn't correct
31 Incorrect 3 ms 384 KB Output isn't correct
32 Incorrect 3 ms 460 KB Output isn't correct