Submission #105749

# Submission time Handle Problem Language Result Execution time Memory
105749 2019-04-14T09:32:45 Z Pro_ktmr Gap (APIO16_gap) C++14
30 / 100
124 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 = 1000000000000000000LL / 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 3 ms 256 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 256 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 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 2 ms 384 KB Output is correct
16 Correct 15 ms 896 KB Output is correct
17 Correct 14 ms 896 KB Output is correct
18 Correct 14 ms 896 KB Output is correct
19 Correct 14 ms 896 KB Output is correct
20 Correct 12 ms 896 KB Output is correct
21 Correct 57 ms 2348 KB Output is correct
22 Correct 57 ms 2260 KB Output is correct
23 Correct 50 ms 2288 KB Output is correct
24 Correct 51 ms 2416 KB Output is correct
25 Correct 46 ms 2288 KB Output is correct
26 Correct 55 ms 2288 KB Output is correct
27 Correct 56 ms 2220 KB Output is correct
28 Correct 53 ms 2288 KB Output is correct
29 Correct 57 ms 2288 KB Output is correct
30 Correct 51 ms 2288 KB Output is correct
31 Correct 2 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 2 ms 384 KB Output is correct
5 Partially correct 2 ms 256 KB Partially correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 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 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
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 5 ms 384 KB Output is correct
15 Partially correct 3 ms 384 KB Partially correct
16 Correct 27 ms 1408 KB Output is correct
17 Correct 26 ms 1408 KB Output is correct
18 Correct 27 ms 1408 KB Output is correct
19 Correct 24 ms 1408 KB Output is correct
20 Runtime error 12 ms 1024 KB Execution failed because the return code was nonzero
21 Correct 94 ms 3960 KB Output is correct
22 Correct 96 ms 3960 KB Output is correct
23 Correct 124 ms 3960 KB Output is correct
24 Correct 98 ms 4040 KB Output is correct
25 Partially correct 98 ms 3212 KB Partially correct
26 Correct 94 ms 4040 KB Output is correct
27 Correct 94 ms 3960 KB Output is correct
28 Correct 92 ms 4040 KB Output is correct
29 Correct 104 ms 4040 KB Output is correct
30 Runtime error 51 ms 2688 KB Execution failed because the return code was nonzero
31 Runtime error 3 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