Submission #107414

# Submission time Handle Problem Language Result Execution time Memory
107414 2019-04-24T07:01:15 Z yamamayumi9489 Gap (APIO16_gap) C++14
30 / 100
88 ms 3308 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 VL vector<LL>
#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 if (T == 2) {
		VL A; LL mn, mx;
		MinMax(0, 1000000000000000000LL, &mn, &mx);
		LL l = mn + 1;
		LL r = mn + ((mx - mn + 1) / N);
		r = min(r,mx-1);
		for (LL i = 0; i < N; i++) {
			LL a, b;
			MinMax(l, r, &a, &b);
			if (a != -1) {
				A.push_back(a);	A.push_back(b);
			}
			if(r == mx-1) break;
			l += ((mx - mn + 1) / N);
			r += ((mx - mn + 1) / N);
			r = min(r,mx-1);
		}
		sort(A.begin(), A.end());
		LL ans = 0;
		for (int i = 2; i < (int)A.size(); i += 2)
			ans = max(ans, A[i] - A[i - 1]);
		return ans;
	}
	else return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 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 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 15 ms 768 KB Output is correct
17 Correct 14 ms 768 KB Output is correct
18 Correct 15 ms 768 KB Output is correct
19 Correct 10 ms 732 KB Output is correct
20 Correct 10 ms 768 KB Output is correct
21 Correct 49 ms 1860 KB Output is correct
22 Correct 47 ms 1916 KB Output is correct
23 Correct 51 ms 1912 KB Output is correct
24 Correct 52 ms 1912 KB Output is correct
25 Correct 62 ms 1912 KB Output is correct
26 Correct 55 ms 1912 KB Output is correct
27 Correct 56 ms 1972 KB Output is correct
28 Correct 54 ms 2040 KB Output is correct
29 Correct 54 ms 1912 KB Output is correct
30 Correct 36 ms 1912 KB Output is correct
31 Correct 3 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 384 KB Output isn't correct
2 Correct 3 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 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 21 ms 1024 KB Output is correct
17 Correct 18 ms 1024 KB Output is correct
18 Correct 20 ms 1024 KB Output is correct
19 Correct 19 ms 896 KB Output is correct
20 Incorrect 9 ms 640 KB Output isn't correct
21 Correct 72 ms 2380 KB Output is correct
22 Correct 70 ms 2288 KB Output is correct
23 Correct 70 ms 2356 KB Output is correct
24 Correct 88 ms 2288 KB Output is correct
25 Correct 72 ms 3308 KB Output is correct
26 Correct 72 ms 2288 KB Output is correct
27 Correct 87 ms 2288 KB Output is correct
28 Correct 76 ms 2288 KB Output is correct
29 Correct 80 ms 2292 KB Output is correct
30 Incorrect 47 ms 1308 KB Output isn't correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 3 ms 384 KB Output isn't correct