Submission #50999

# Submission time Handle Problem Language Result Execution time Memory
50999 2018-06-15T14:16:25 Z Abelyan Gap (APIO16_gap) C++17
0 / 100
71 ms 2408 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 (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 Incorrect 3 ms 376 KB Output isn't correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Incorrect 2 ms 724 KB Output isn't correct
7 Incorrect 3 ms 724 KB Output isn't correct
8 Incorrect 3 ms 724 KB Output isn't correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 Correct 3 ms 724 KB Output is correct
11 Incorrect 4 ms 724 KB Output isn't correct
12 Incorrect 3 ms 724 KB Output isn't correct
13 Incorrect 3 ms 724 KB Output isn't correct
14 Incorrect 3 ms 724 KB Output isn't correct
15 Incorrect 3 ms 724 KB Output isn't correct
16 Incorrect 23 ms 1088 KB Output isn't correct
17 Incorrect 14 ms 1088 KB Output isn't correct
18 Incorrect 15 ms 1088 KB Output isn't correct
19 Incorrect 15 ms 1088 KB Output isn't correct
20 Correct 11 ms 1088 KB Output is correct
21 Incorrect 60 ms 2148 KB Output isn't correct
22 Incorrect 58 ms 2148 KB Output isn't correct
23 Incorrect 57 ms 2148 KB Output isn't correct
24 Incorrect 71 ms 2156 KB Output isn't correct
25 Incorrect 46 ms 2200 KB Output isn't correct
26 Incorrect 53 ms 2200 KB Output isn't correct
27 Incorrect 54 ms 2200 KB Output isn't correct
28 Incorrect 55 ms 2200 KB Output isn't correct
29 Incorrect 55 ms 2200 KB Output isn't correct
30 Correct 46 ms 2200 KB Output is correct
31 Correct 2 ms 2200 KB Output is correct
32 Correct 2 ms 2200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2200 KB Output is correct
2 Partially correct 2 ms 2200 KB Partially correct
3 Partially correct 2 ms 2200 KB Partially correct
4 Partially correct 2 ms 2200 KB Partially correct
5 Partially correct 2 ms 2200 KB Partially correct
6 Partially correct 2 ms 2200 KB Partially correct
7 Partially correct 2 ms 2200 KB Partially correct
8 Partially correct 2 ms 2200 KB Partially correct
9 Partially correct 2 ms 2200 KB Partially correct
10 Partially correct 2 ms 2200 KB Partially correct
11 Partially correct 3 ms 2200 KB Partially correct
12 Partially correct 4 ms 2200 KB Partially correct
13 Partially correct 3 ms 2200 KB Partially correct
14 Partially correct 2 ms 2200 KB Partially correct
15 Partially correct 3 ms 2200 KB Partially correct
16 Partially correct 15 ms 2200 KB Partially correct
17 Partially correct 19 ms 2200 KB Partially correct
18 Partially correct 18 ms 2200 KB Partially correct
19 Partially correct 16 ms 2200 KB Partially correct
20 Partially correct 12 ms 2200 KB Partially correct
21 Incorrect 60 ms 2408 KB Expected int32, but "2500100001" found
22 Incorrect 60 ms 2408 KB Expected int32, but "2500100001" found
23 Incorrect 54 ms 2408 KB Expected int32, but "2500100001" found
24 Incorrect 56 ms 2408 KB Expected int32, but "2500100001" found
25 Incorrect 49 ms 2408 KB Expected int32, but "2500100001" found
26 Incorrect 63 ms 2408 KB Expected int32, but "2500100001" found
27 Incorrect 53 ms 2408 KB Expected int32, but "2500100001" found
28 Incorrect 55 ms 2408 KB Expected int32, but "2500100001" found
29 Incorrect 55 ms 2408 KB Expected int32, but "2500100001" found
30 Incorrect 40 ms 2408 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 2408 KB Partially correct
32 Partially correct 2 ms 2408 KB Partially correct