Submission #106025

# Submission time Handle Problem Language Result Execution time Memory
106025 2019-04-16T08:16:29 Z yamamayumi9489 Gap (APIO16_gap) C++14
30 / 100
65 ms 2040 KB
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<functional>

using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999
#define INTBIG 1111111111
#define MOD 1000000007
#define PI pair<int,int>
#define VI vector<int>
#define VVI vector<vector<int>>

#include"gap.h"
//MinMax(int,int,int&,int&)

long long findGap(int T, int N){
	if(T==1){
		LL A[100002];
		LL l=0, r=1000000000000000000LL;
		for(int i=0; i<(N+1)/2; i++){
			MinMax(l, r, &A[i], &A[N-1-i]);
			l = A[i]+1; r = A[N-1-i]-1;
		}

		LL ans = 0;
		for(int i=0; i<N-1; i++)
			ans = max(ans, A[i+1] - A[i]);
		return ans;
	}
	else return 0;
}
# 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 356 KB Output is correct
9 Correct 2 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 512 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 14 ms 768 KB Output is correct
17 Correct 15 ms 768 KB Output is correct
18 Correct 19 ms 760 KB Output is correct
19 Correct 19 ms 768 KB Output is correct
20 Correct 11 ms 768 KB Output is correct
21 Correct 65 ms 1916 KB Output is correct
22 Correct 59 ms 1836 KB Output is correct
23 Correct 47 ms 1912 KB Output is correct
24 Correct 51 ms 2040 KB Output is correct
25 Correct 56 ms 1912 KB Output is correct
26 Correct 45 ms 1912 KB Output is correct
27 Correct 49 ms 1916 KB Output is correct
28 Correct 55 ms 1912 KB Output is correct
29 Correct 50 ms 1852 KB Output is correct
30 Correct 37 ms 1912 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 Incorrect 3 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 2 ms 384 KB Output isn't correct
10 Incorrect 3 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 2 ms 384 KB Output isn't correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Incorrect 9 ms 640 KB Output isn't correct
17 Incorrect 8 ms 512 KB Output isn't correct
18 Incorrect 8 ms 512 KB Output isn't correct
19 Incorrect 8 ms 640 KB Output isn't correct
20 Incorrect 4 ms 512 KB Output isn't correct
21 Incorrect 25 ms 1144 KB Output isn't correct
22 Incorrect 25 ms 1152 KB Output isn't correct
23 Incorrect 25 ms 1144 KB Output isn't correct
24 Incorrect 33 ms 1144 KB Output isn't correct
25 Incorrect 20 ms 1152 KB Output isn't correct
26 Incorrect 28 ms 1144 KB Output isn't correct
27 Incorrect 30 ms 1144 KB Output isn't correct
28 Incorrect 46 ms 1144 KB Output isn't correct
29 Incorrect 32 ms 1144 KB Output isn't correct
30 Incorrect 14 ms 1152 KB Output isn't correct
31 Incorrect 2 ms 256 KB Output isn't correct
32 Incorrect 2 ms 384 KB Output isn't correct