Submission #106017

# Submission time Handle Problem Language Result Execution time Memory
106017 2019-04-16T08:07:53 Z yamamayumi9489 Gap (APIO16_gap) C++14
0 / 100
57 ms 2008 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=1000000000000000000;
	for(int i=0; i<(N+1)/2; i++)
		MinMax(l, r, &A[i], &A[N-1-i]);

	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 2 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 3 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 1 ms 384 KB Output isn't correct
7 Incorrect 3 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 4 ms 384 KB Output isn't correct
12 Incorrect 2 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 3 ms 384 KB Output isn't correct
16 Incorrect 11 ms 696 KB Output isn't correct
17 Incorrect 10 ms 768 KB Output isn't correct
18 Incorrect 10 ms 768 KB Output isn't correct
19 Incorrect 13 ms 768 KB Output isn't correct
20 Incorrect 8 ms 768 KB Output isn't correct
21 Incorrect 49 ms 2008 KB Output isn't correct
22 Incorrect 53 ms 1912 KB Output isn't correct
23 Incorrect 57 ms 1912 KB Output isn't correct
24 Incorrect 38 ms 1912 KB Output isn't correct
25 Incorrect 34 ms 1912 KB Output isn't correct
26 Incorrect 45 ms 1972 KB Output isn't correct
27 Incorrect 43 ms 1912 KB Output isn't correct
28 Incorrect 37 ms 1912 KB Output isn't correct
29 Incorrect 42 ms 1912 KB Output isn't correct
30 Incorrect 27 ms 1912 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
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 2 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 3 ms 384 KB Output isn't correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 3 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 2 ms 384 KB Output isn't correct
13 Incorrect 2 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 10 ms 512 KB Output isn't correct
17 Incorrect 10 ms 512 KB Output isn't correct
18 Incorrect 9 ms 512 KB Output isn't correct
19 Incorrect 9 ms 512 KB Output isn't correct
20 Incorrect 6 ms 512 KB Output isn't correct
21 Incorrect 28 ms 1144 KB Output isn't correct
22 Incorrect 41 ms 1144 KB Output isn't correct
23 Incorrect 26 ms 1116 KB Output isn't correct
24 Incorrect 29 ms 1152 KB Output isn't correct
25 Incorrect 22 ms 1152 KB Output isn't correct
26 Incorrect 31 ms 1144 KB Output isn't correct
27 Incorrect 27 ms 1124 KB Output isn't correct
28 Incorrect 25 ms 1144 KB Output isn't correct
29 Incorrect 30 ms 1144 KB Output isn't correct
30 Incorrect 17 ms 1152 KB Output isn't correct
31 Incorrect 3 ms 384 KB Output isn't correct
32 Incorrect 2 ms 384 KB Output isn't correct