Submission #40861

# Submission time Handle Problem Language Result Execution time Memory
40861 2018-02-09T14:45:12 Z IvanC Gap (APIO16_gap) C++14
13.7993 / 100
90 ms 1532 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
ll NN,TT,maior;
ii binary_search(ll ini,ll fim){
	if(ini == fim) return ii(ini,ini);
	ll copia1 = ini,copia2 = fim;
	MinMax(ini,fim,&copia1,&copia2);
	ini = copia1;
	fim = copia2;
	if(fim - ini <= maior) return ii(ini,fim);
	ll meio = ini + (fim - ini)/2;
	ii novo1 = binary_search(ini,meio);
	ii novo2 = binary_search(meio+1,fim);
	if(novo1.second != novo2.first) maior = max(maior, novo2.first - novo1.second);
	return ii(ini,fim);
}
ll findGap(int T,int N){
	TT = T;
	NN = N;
	ll ini = 0,fim = (ll)1e18;
	binary_search(ini,fim);
	return maior;
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Incorrect 2 ms 352 KB Output isn't correct
3 Incorrect 2 ms 424 KB Output isn't correct
4 Incorrect 2 ms 444 KB Output isn't correct
5 Incorrect 2 ms 500 KB Output isn't correct
6 Incorrect 2 ms 612 KB Output isn't correct
7 Incorrect 2 ms 612 KB Output isn't correct
8 Incorrect 2 ms 612 KB Output isn't correct
9 Incorrect 2 ms 612 KB Output isn't correct
10 Incorrect 2 ms 612 KB Output isn't correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 3 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Incorrect 3 ms 620 KB Output isn't correct
16 Correct 13 ms 744 KB Output is correct
17 Correct 18 ms 764 KB Output is correct
18 Correct 13 ms 764 KB Output is correct
19 Correct 14 ms 764 KB Output is correct
20 Incorrect 12 ms 764 KB Output isn't correct
21 Correct 47 ms 1404 KB Output is correct
22 Correct 45 ms 1404 KB Output is correct
23 Correct 46 ms 1404 KB Output is correct
24 Correct 48 ms 1404 KB Output is correct
25 Incorrect 90 ms 1404 KB Output isn't correct
26 Correct 48 ms 1404 KB Output is correct
27 Correct 48 ms 1404 KB Output is correct
28 Correct 49 ms 1404 KB Output is correct
29 Correct 46 ms 1404 KB Output is correct
30 Incorrect 42 ms 1508 KB Output isn't correct
31 Incorrect 1 ms 1508 KB Output isn't correct
32 Correct 2 ms 1508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 1508 KB Partially correct
2 Partially correct 2 ms 1508 KB Partially correct
3 Partially correct 1 ms 1508 KB Partially correct
4 Partially correct 1 ms 1508 KB Partially correct
5 Partially correct 1 ms 1508 KB Partially correct
6 Partially correct 2 ms 1508 KB Partially correct
7 Partially correct 1 ms 1508 KB Partially correct
8 Partially correct 2 ms 1508 KB Partially correct
9 Partially correct 1 ms 1508 KB Partially correct
10 Partially correct 1 ms 1508 KB Partially correct
11 Partially correct 3 ms 1508 KB Partially correct
12 Partially correct 2 ms 1508 KB Partially correct
13 Partially correct 2 ms 1508 KB Partially correct
14 Partially correct 2 ms 1508 KB Partially correct
15 Partially correct 2 ms 1508 KB Partially correct
16 Partially correct 19 ms 1508 KB Partially correct
17 Partially correct 14 ms 1508 KB Partially correct
18 Partially correct 15 ms 1508 KB Partially correct
19 Partially correct 20 ms 1508 KB Partially correct
20 Partially correct 13 ms 1508 KB Partially correct
21 Partially correct 46 ms 1508 KB Partially correct
22 Partially correct 43 ms 1508 KB Partially correct
23 Partially correct 45 ms 1508 KB Partially correct
24 Partially correct 43 ms 1508 KB Partially correct
25 Partially correct 90 ms 1532 KB Partially correct
26 Partially correct 47 ms 1532 KB Partially correct
27 Partially correct 57 ms 1532 KB Partially correct
28 Partially correct 46 ms 1532 KB Partially correct
29 Partially correct 43 ms 1532 KB Partially correct
30 Partially correct 42 ms 1532 KB Partially correct
31 Partially correct 1 ms 1532 KB Partially correct
32 Partially correct 2 ms 1532 KB Partially correct