Submission #209575

# Submission time Handle Problem Language Result Execution time Memory
209575 2020-03-14T17:22:40 Z Lawliet Gap (APIO16_gap) C++14
30 / 100
77 ms 1912 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

const int MAXN = 100010;

lli v[MAXN];

long long findGap(int T, int N)
{
	lli L = 0LL;
	lli R = 1000000000000000000LL;

	for(int i = 1 ; i <= N - i + 1 ; i++)
	{
		lli aux1, aux2;
		lli *mx = &aux1; 
		lli *mn = &aux2;

		MinMax( L , R , mn , mx );

		v[i] = aux2;
		v[N - i + 1] = aux1;

		L = aux2 + 1;
		R = aux1 - 1;
	}

	lli ans = 0;

	for(int i = 1 ; i < N ; i++)
		ans = max( ans , v[i + 1] - v[i] );

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 5 ms 248 KB Output is correct
15 Correct 5 ms 248 KB Output is correct
16 Correct 16 ms 764 KB Output is correct
17 Correct 19 ms 760 KB Output is correct
18 Correct 17 ms 632 KB Output is correct
19 Correct 16 ms 632 KB Output is correct
20 Correct 13 ms 760 KB Output is correct
21 Correct 54 ms 1912 KB Output is correct
22 Correct 62 ms 1912 KB Output is correct
23 Correct 54 ms 1812 KB Output is correct
24 Correct 54 ms 1784 KB Output is correct
25 Correct 47 ms 1784 KB Output is correct
26 Correct 54 ms 1884 KB Output is correct
27 Correct 56 ms 1912 KB Output is correct
28 Correct 55 ms 1840 KB Output is correct
29 Correct 54 ms 1784 KB Output is correct
30 Correct 44 ms 1904 KB Output is correct
31 Correct 5 ms 248 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Partially correct 5 ms 380 KB Partially correct
3 Partially correct 5 ms 248 KB Partially correct
4 Partially correct 4 ms 248 KB Partially correct
5 Partially correct 4 ms 248 KB Partially correct
6 Partially correct 5 ms 376 KB Partially correct
7 Partially correct 5 ms 248 KB Partially correct
8 Partially correct 5 ms 376 KB Partially correct
9 Partially correct 5 ms 376 KB Partially correct
10 Partially correct 5 ms 376 KB Partially correct
11 Partially correct 5 ms 248 KB Partially correct
12 Partially correct 5 ms 248 KB Partially correct
13 Partially correct 5 ms 248 KB Partially correct
14 Partially correct 5 ms 248 KB Partially correct
15 Partially correct 6 ms 248 KB Partially correct
16 Partially correct 18 ms 632 KB Partially correct
17 Partially correct 17 ms 696 KB Partially correct
18 Partially correct 19 ms 760 KB Partially correct
19 Partially correct 17 ms 632 KB Partially correct
20 Partially correct 14 ms 760 KB Partially correct
21 Incorrect 55 ms 1784 KB Expected int32, but "2500100000" found
22 Incorrect 54 ms 1912 KB Expected int32, but "2500100000" found
23 Incorrect 55 ms 1892 KB Expected int32, but "2500100000" found
24 Incorrect 62 ms 1784 KB Expected int32, but "2500100000" found
25 Incorrect 47 ms 1784 KB Expected int32, but "2500100000" found
26 Incorrect 56 ms 1784 KB Expected int32, but "2500100000" found
27 Incorrect 56 ms 1912 KB Expected int32, but "2500100000" found
28 Incorrect 77 ms 1880 KB Expected int32, but "2500100000" found
29 Incorrect 62 ms 1816 KB Expected int32, but "2500100000" found
30 Incorrect 41 ms 1784 KB Expected int32, but "2500100000" found
31 Partially correct 5 ms 248 KB Partially correct
32 Partially correct 5 ms 248 KB Partially correct