Submission #105754

# Submission time Handle Problem Language Result Execution time Memory
105754 2019-04-14T09:40:59 Z Pro_ktmr Gap (APIO16_gap) C++14
47.4187 / 100
131 ms 4040 KB
#include"bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define PB push_back
#define MP make_pair
#define MOD 1000000007

#include"gap.h"

//MinMax(LL s, LL t, LL& mn, LL& mx)
//aiのうちs以上の最小の数がmnに、aiのうちt以下の最大値がmxに格納される

//aiの差分のうち最大のものを返す
LL findGap(int T, int N){
	if(T == 1){
		LL m = 0LL;
		LL M = 1000000000000000000LL;
		vector<LL> v;
		for(int i=0; i<(N+1)/2; i++){
			LL tmp1, tmp2;
			MinMax(m, M, &tmp1, &tmp2);
			v.PB(tmp1);
			v.PB(tmp2);
			m = tmp1+1;
			M = tmp2-1;
		}
		sort(v.begin(), v.end());

		LL ans = 0;
		for(int i=1; i<v.size(); i++){
			ans = max(ans, v[i] - v[i-1]);
		}
		return ans;
	}
	if(T == 2){

		LL B = 1000000000000000001LL / N;
		queue<pair<LL, LL>> kukan;
		for(LL i=0; i<=1000000000000000000LL; i+=B){
			kukan.push(MP(i,i+B-1));
		}
		vector<LL> v;
		while(kukan.size() > 0){
			LL m = kukan.front().first;
			LL M = kukan.front().second;
			kukan.pop();
			LL tmp1, tmp2;
			MinMax(m, M, &tmp1, &tmp2);
			if(tmp1 == -1) continue;
			v.PB(tmp1);
			if(tmp1 == tmp2) continue;
			v.PB(tmp2);

			B = (tmp2 - tmp1) / 2 + 1;
			for(LL i=tmp1+1; i<=tmp2-1; i+=B){
				kukan.push(MP(i, min(i+B-1,tmp2-1)));
			}
		}
		sort(v.begin(), v.end());
		LL ans = 0;
		for(int i=1; i<v.size(); i++){
			ans = max(ans, v[i] - v[i-1]);
		}
		return ans;
	}
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1; i<v.size(); i++){
                ~^~~~~~~~~
gap.cpp:62:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1; i<v.size(); i++){
                ~^~~~~~~~~
gap.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 3 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 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 4 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 4 ms 384 KB Output is correct
16 Correct 22 ms 896 KB Output is correct
17 Correct 19 ms 896 KB Output is correct
18 Correct 15 ms 1024 KB Output is correct
19 Correct 20 ms 1024 KB Output is correct
20 Correct 13 ms 1024 KB Output is correct
21 Correct 54 ms 2304 KB Output is correct
22 Correct 55 ms 2292 KB Output is correct
23 Correct 61 ms 2416 KB Output is correct
24 Correct 58 ms 2288 KB Output is correct
25 Correct 49 ms 2288 KB Output is correct
26 Correct 65 ms 2288 KB Output is correct
27 Correct 76 ms 2288 KB Output is correct
28 Correct 80 ms 2288 KB Output is correct
29 Correct 59 ms 2288 KB Output is correct
30 Correct 46 ms 2288 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is 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 3 ms 384 KB Output is correct
5 Partially correct 3 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 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Partially correct 2 ms 384 KB Partially correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Partially correct 3 ms 384 KB Partially correct
16 Correct 32 ms 1408 KB Output is correct
17 Correct 25 ms 1408 KB Output is correct
18 Correct 27 ms 1408 KB Output is correct
19 Correct 29 ms 1272 KB Output is correct
20 Partially correct 24 ms 1056 KB Partially correct
21 Correct 108 ms 3888 KB Output is correct
22 Correct 131 ms 3960 KB Output is correct
23 Correct 103 ms 3960 KB Output is correct
24 Correct 104 ms 4040 KB Output is correct
25 Partially correct 87 ms 3240 KB Partially correct
26 Correct 104 ms 3984 KB Output is correct
27 Correct 104 ms 3920 KB Output is correct
28 Correct 96 ms 4040 KB Output is correct
29 Correct 110 ms 4040 KB Output is correct
30 Partially correct 75 ms 3244 KB Partially correct
31 Partially correct 2 ms 384 KB Partially correct
32 Partially correct 2 ms 380 KB Partially correct