Submission #105750

# Submission time Handle Problem Language Result Execution time Memory
105750 2019-04-14T09:33:50 Z Pro_ktmr Gap (APIO16_gap) C++14
30 / 100
213 ms 9492 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 = 1000000000000000000LL / (5*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);

			LL mid = (tmp1+tmp2) / 2;
			kukan.push(MP(tmp1+1, mid));
			kukan.push(MP(mid+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:61:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1; i<v.size(); i++){
                ~^~~~~~~~~
gap.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 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 3 ms 384 KB Output is correct
9 Correct 24 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 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 17 ms 896 KB Output is correct
17 Correct 15 ms 896 KB Output is correct
18 Correct 15 ms 1024 KB Output is correct
19 Correct 14 ms 896 KB Output is correct
20 Correct 12 ms 1024 KB Output is correct
21 Correct 61 ms 2252 KB Output is correct
22 Correct 58 ms 2288 KB Output is correct
23 Correct 59 ms 2292 KB Output is correct
24 Correct 55 ms 2288 KB Output is correct
25 Correct 55 ms 2288 KB Output is correct
26 Correct 65 ms 2288 KB Output is correct
27 Correct 63 ms 2288 KB Output is correct
28 Correct 58 ms 2312 KB Output is correct
29 Correct 56 ms 2292 KB Output is correct
30 Correct 43 ms 2288 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 256 KB Partially correct
2 Partially correct 2 ms 384 KB Partially correct
3 Partially correct 2 ms 384 KB Partially correct
4 Partially correct 2 ms 384 KB Partially correct
5 Partially correct 2 ms 384 KB Partially correct
6 Partially correct 2 ms 384 KB Partially correct
7 Partially correct 2 ms 384 KB Partially correct
8 Partially correct 3 ms 384 KB Partially correct
9 Partially correct 3 ms 384 KB Partially correct
10 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
11 Partially correct 4 ms 512 KB Partially correct
12 Partially correct 6 ms 512 KB Partially correct
13 Partially correct 4 ms 512 KB Partially correct
14 Partially correct 4 ms 640 KB Partially correct
15 Partially correct 4 ms 512 KB Partially correct
16 Partially correct 44 ms 2560 KB Partially correct
17 Partially correct 53 ms 2560 KB Partially correct
18 Partially correct 45 ms 2560 KB Partially correct
19 Partially correct 52 ms 2680 KB Partially correct
20 Runtime error 31 ms 2688 KB Execution failed because the return code was nonzero
21 Partially correct 193 ms 9492 KB Partially correct
22 Partially correct 169 ms 9352 KB Partially correct
23 Partially correct 195 ms 9484 KB Partially correct
24 Partially correct 190 ms 9352 KB Partially correct
25 Partially correct 179 ms 9388 KB Partially correct
26 Partially correct 182 ms 9480 KB Partially correct
27 Partially correct 213 ms 9352 KB Partially correct
28 Partially correct 172 ms 9388 KB Partially correct
29 Partially correct 172 ms 9376 KB Partially correct
30 Runtime error 162 ms 9352 KB Execution failed because the return code was nonzero
31 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
32 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero