Submission #101636

# Submission time Handle Problem Language Result Execution time Memory
101636 2019-03-19T05:43:11 Z asifthegreat Gap (APIO16_gap) C++14
30 / 100
75 ms 4152 KB
#include <bits/stdc++.h>
#include "gap.h"
#define int long long
#define all(a) a.begin(),a.end() 

using namespace std;

vector<int>v;

long long findGap(int32_t T,int32_t n)
{
	v.clear();
	if(T == 1){
		int s = 0,t = 1000000000000000001,mn,mx,sz = 0;
		while(1){
			if(sz >= n)break;
			MinMax(s,t,&mn,&mx);
			v.push_back(mn);
			if(mn != mx){v.push_back(mx);sz++;}
			s = mn+1;
			t = mx-1;
			sz++;
		}
		sort(all(v));
		int ans = -1;
		for(int i = 1; i < n;i++){
			ans = max(ans,v[i]-v[i-1]);
		}
		return ans;
	}
	else return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 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 3 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 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 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 3 ms 384 KB Output is correct
16 Correct 16 ms 1408 KB Output is correct
17 Correct 16 ms 1408 KB Output is correct
18 Correct 15 ms 1408 KB Output is correct
19 Correct 17 ms 1408 KB Output is correct
20 Correct 12 ms 1152 KB Output is correct
21 Correct 58 ms 4152 KB Output is correct
22 Correct 74 ms 4084 KB Output is correct
23 Correct 65 ms 4080 KB Output is correct
24 Correct 66 ms 4080 KB Output is correct
25 Correct 53 ms 3440 KB Output is correct
26 Correct 68 ms 4080 KB Output is correct
27 Correct 66 ms 4028 KB Output is correct
28 Correct 75 ms 4080 KB Output is correct
29 Correct 60 ms 4092 KB Output is correct
30 Correct 49 ms 2928 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 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 2 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 2 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 3 ms 384 KB Output isn't correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 Incorrect 8 ms 1024 KB Output isn't correct
17 Incorrect 9 ms 1024 KB Output isn't correct
18 Incorrect 9 ms 1024 KB Output isn't correct
19 Incorrect 8 ms 1024 KB Output isn't correct
20 Incorrect 9 ms 640 KB Output isn't correct
21 Incorrect 37 ms 2936 KB Output isn't correct
22 Incorrect 31 ms 2936 KB Output isn't correct
23 Incorrect 36 ms 2936 KB Output isn't correct
24 Incorrect 33 ms 2944 KB Output isn't correct
25 Incorrect 23 ms 2304 KB Output isn't correct
26 Incorrect 31 ms 3064 KB Output isn't correct
27 Incorrect 27 ms 2932 KB Output isn't correct
28 Incorrect 30 ms 2944 KB Output isn't correct
29 Incorrect 34 ms 2936 KB Output isn't correct
30 Incorrect 20 ms 1920 KB Output isn't correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 2 ms 384 KB Output isn't correct