Submission #51000

# Submission time Handle Problem Language Result Execution time Memory
51000 2018-06-15T14:21:11 Z Abelyan Gap (APIO16_gap) C++17
30 / 100
86 ms 2264 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MX=(ll)1000000000000000000;
const int MAXN=100006;
ll a[MAXN];

long long findGap(int T, int n)
{
	ll mx,mn;
	MinMax(0,MX,&mn,&mx);
	int j=n-1;
	int i=0;
	while (mn!=-1){
		a[i]=mn;
		a[j]=mx;
		//cout<<i<<" "<<" "<<j<<endl;
		//cout<<mn<< " "<<mx<<endl;
		i++;
		j--;
		if (i>j || mn+1>mx-1) break;
		MinMax(mn+1,mx-1,&mn,&mx);
		if (mn==mx && mn!=-1){
			a[i]=mn;
			break;
		}

	}
	ll maxim=0;
	for (int i=0;i<n-1;i++){
		//cout<<a[i]<<endl;
		maxim=max(maxim,a[i+1]-a[i]);
	}
	return maxim;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 472 KB Output is correct
7 Correct 2 ms 472 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 3 ms 576 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 4 ms 648 KB Output is correct
12 Correct 3 ms 740 KB Output is correct
13 Correct 3 ms 740 KB Output is correct
14 Correct 4 ms 740 KB Output is correct
15 Correct 3 ms 740 KB Output is correct
16 Correct 16 ms 1004 KB Output is correct
17 Correct 15 ms 1004 KB Output is correct
18 Correct 15 ms 1004 KB Output is correct
19 Correct 15 ms 1004 KB Output is correct
20 Correct 12 ms 1004 KB Output is correct
21 Correct 58 ms 2188 KB Output is correct
22 Correct 56 ms 2188 KB Output is correct
23 Correct 57 ms 2188 KB Output is correct
24 Correct 86 ms 2188 KB Output is correct
25 Correct 53 ms 2188 KB Output is correct
26 Correct 59 ms 2188 KB Output is correct
27 Correct 61 ms 2188 KB Output is correct
28 Correct 56 ms 2188 KB Output is correct
29 Correct 82 ms 2188 KB Output is correct
30 Correct 44 ms 2188 KB Output is correct
31 Correct 2 ms 2188 KB Output is correct
32 Correct 2 ms 2188 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2188 KB Output is correct
2 Partially correct 3 ms 2188 KB Partially correct
3 Partially correct 3 ms 2188 KB Partially correct
4 Partially correct 2 ms 2188 KB Partially correct
5 Partially correct 2 ms 2188 KB Partially correct
6 Partially correct 2 ms 2188 KB Partially correct
7 Partially correct 2 ms 2188 KB Partially correct
8 Partially correct 2 ms 2188 KB Partially correct
9 Partially correct 3 ms 2188 KB Partially correct
10 Partially correct 2 ms 2188 KB Partially correct
11 Partially correct 3 ms 2188 KB Partially correct
12 Partially correct 3 ms 2188 KB Partially correct
13 Partially correct 3 ms 2188 KB Partially correct
14 Partially correct 3 ms 2188 KB Partially correct
15 Partially correct 3 ms 2188 KB Partially correct
16 Partially correct 15 ms 2188 KB Partially correct
17 Partially correct 16 ms 2188 KB Partially correct
18 Partially correct 15 ms 2188 KB Partially correct
19 Partially correct 16 ms 2188 KB Partially correct
20 Partially correct 12 ms 2188 KB Partially correct
21 Incorrect 66 ms 2188 KB Expected int32, but "2500100000" found
22 Incorrect 60 ms 2188 KB Expected int32, but "2500100000" found
23 Incorrect 58 ms 2188 KB Expected int32, but "2500100000" found
24 Incorrect 61 ms 2188 KB Expected int32, but "2500100000" found
25 Incorrect 49 ms 2188 KB Expected int32, but "2500100000" found
26 Incorrect 62 ms 2264 KB Expected int32, but "2500100000" found
27 Incorrect 61 ms 2264 KB Expected int32, but "2500100000" found
28 Incorrect 65 ms 2264 KB Expected int32, but "2500100000" found
29 Incorrect 57 ms 2264 KB Expected int32, but "2500100000" found
30 Incorrect 42 ms 2264 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 2264 KB Partially correct
32 Partially correct 2 ms 2264 KB Partially correct