Submission #23402

# Submission time Handle Problem Language Result Execution time Memory
23402 2017-05-08T18:12:54 Z rubabredwan Gap (APIO16_gap) C++14
70 / 100
89 ms 9900 KB
/* Bismillahir Rahmanir Rahim */

#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

const long long M = 1e18;

long long mdiff = 0;

void solve(long long st, long long en, long long n){
    long long mn, mx;
    MinMax(st, en, &mn, &mx);
    long long rng = 1LL + (mx - mn) / (n - 1LL);
    long long lst = mn;
	for(long long i=mn+1;i<mx;i+=rng){
		long long A, B;
		MinMax(i, min(i + rng - 1LL, mx), &A, &B);
		if(A == -1) continue;
		if(lst != -1) mdiff = max(mdiff, A - lst);
		lst = B;
	}
	if(lst != -1) mdiff = max(mdiff, mx - lst);
}


long long findGap(int T, int N){
	if(T == 1){
		long long st = 0, en = M;
		set<long long>S;
		while(st < en){
			long long A, B;
			MinMax(st, en, &A, &B);
			if(A == -1) break;
			S.insert(A);
			S.insert(B);
			st = A + 1LL;
			en = B - 1LL;
		}
		long long lst = -1;
		for(auto u : S){
			if(lst != -1) mdiff = max(mdiff, u - lst);
			lst = u;
		}
	}
	else solve(0, M, N);
	return mdiff;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5148 KB Output isn't correct
2 Correct 0 ms 5148 KB Output is correct
3 Correct 0 ms 5148 KB Output is correct
4 Correct 0 ms 5148 KB Output is correct
5 Correct 0 ms 5148 KB Output is correct
6 Incorrect 0 ms 5148 KB Output isn't correct
7 Incorrect 0 ms 5148 KB Output isn't correct
8 Incorrect 0 ms 5148 KB Output isn't correct
9 Incorrect 0 ms 5148 KB Output isn't correct
10 Correct 0 ms 5148 KB Output is correct
11 Incorrect 0 ms 5280 KB Output isn't correct
12 Incorrect 0 ms 5280 KB Output isn't correct
13 Incorrect 0 ms 5280 KB Output isn't correct
14 Incorrect 0 ms 5280 KB Output isn't correct
15 Incorrect 0 ms 5280 KB Output isn't correct
16 Incorrect 19 ms 6336 KB Output isn't correct
17 Incorrect 19 ms 6336 KB Output isn't correct
18 Incorrect 19 ms 6336 KB Output isn't correct
19 Incorrect 19 ms 6336 KB Output isn't correct
20 Correct 13 ms 6336 KB Output is correct
21 Incorrect 76 ms 9900 KB Output isn't correct
22 Incorrect 73 ms 9900 KB Output isn't correct
23 Incorrect 79 ms 9900 KB Output isn't correct
24 Incorrect 76 ms 9900 KB Output isn't correct
25 Incorrect 69 ms 9900 KB Output isn't correct
26 Incorrect 89 ms 9900 KB Output isn't correct
27 Incorrect 89 ms 9900 KB Output isn't correct
28 Incorrect 59 ms 9900 KB Output isn't correct
29 Incorrect 83 ms 9900 KB Output isn't correct
30 Correct 73 ms 9900 KB Output is correct
31 Correct 0 ms 5148 KB Output is correct
32 Correct 0 ms 5148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5148 KB Output is correct
2 Correct 0 ms 5148 KB Output is correct
3 Correct 0 ms 5148 KB Output is correct
4 Correct 0 ms 5148 KB Output is correct
5 Correct 0 ms 5148 KB Output is correct
6 Correct 0 ms 5148 KB Output is correct
7 Correct 0 ms 5148 KB Output is correct
8 Correct 0 ms 5148 KB Output is correct
9 Correct 0 ms 5148 KB Output is correct
10 Correct 0 ms 5148 KB Output is correct
11 Correct 0 ms 5148 KB Output is correct
12 Correct 0 ms 5148 KB Output is correct
13 Correct 0 ms 5148 KB Output is correct
14 Correct 0 ms 5148 KB Output is correct
15 Correct 0 ms 5148 KB Output is correct
16 Correct 16 ms 5148 KB Output is correct
17 Correct 16 ms 5148 KB Output is correct
18 Correct 13 ms 5148 KB Output is correct
19 Correct 13 ms 5148 KB Output is correct
20 Correct 6 ms 5148 KB Output is correct
21 Correct 66 ms 5148 KB Output is correct
22 Correct 69 ms 5148 KB Output is correct
23 Correct 69 ms 5148 KB Output is correct
24 Correct 69 ms 5148 KB Output is correct
25 Correct 66 ms 5148 KB Output is correct
26 Correct 73 ms 5148 KB Output is correct
27 Correct 69 ms 5148 KB Output is correct
28 Correct 69 ms 5148 KB Output is correct
29 Correct 69 ms 5148 KB Output is correct
30 Correct 36 ms 5148 KB Output is correct
31 Correct 0 ms 5148 KB Output is correct
32 Correct 0 ms 5148 KB Output is correct