Submission #42631

# Submission time Handle Problem Language Result Execution time Memory
42631 2018-03-01T14:58:52 Z MatheusLealV Gap (APIO16_gap) C++14
34.8323 / 100
1888 ms 2884 KB
#include <bits/stdc++.h>
#include "gap.h"
#define N 100005
#define inf 1000000000000000000LL
using namespace std;
typedef long long ll;
 
ll n, v[N], ans[N];
 
vector<ll> val;
 
void solve(ll ini, ll fim)
{
	if(ini == fim)
	{
		val.push_back(ini);
 
		return;
	}
 
	ll mid = (ini + fim)/2;
 
	ll a, b;
 
	MinMax(mid + 1, fim, &a, &b);
 
	//cout<<mid + 1<<" "<<fim<<" "<<a<<" "<<b<<"\n";
 
	if(a != -1 && b != -1) solve(mid + 1, fim);
 
	MinMax(ini, mid, &a, &b);
 
	//cout<<ini<<" "<<mid<<" "<<a<<" "<<b<<"\n";
 
	if(a != -1 && b != -1) solve(ini, mid);
}
 
ll findGap(int T, int N_)
{
	ll best = 0;
 
	if(T == 1)
	{
		n = N_;
 
		ll esq = 0, dir = inf;
 
		for(int i = 1, st = 1, en = n; i <= (n + 1)/2; i++, st ++, en --)
		{
			ll a, b;
 
			MinMax(esq, dir, &a, &b);
 
			esq = a + 1, dir = b - 1;
 
			if(a != -1 && b != -1) ans[st] = a, ans[en] = b;
		}
 
		for(int i = 2; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);
 
		return best;
	}
 
	else
	{
		solve(0, inf);
 
		sort(val.begin(), val.end());
 
		for(int i = 1; i < val.size(); i++) best = max(best, val[i] - val[i - 1]);
 
		return best;
	}
 
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < val.size(); i++) best = max(best, val[i] - val[i - 1]);
                    ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 440 KB Output is correct
7 Correct 2 ms 540 KB Output is correct
8 Correct 1 ms 540 KB Output is correct
9 Correct 1 ms 540 KB Output is correct
10 Correct 1 ms 540 KB Output is correct
11 Correct 2 ms 540 KB Output is correct
12 Correct 2 ms 548 KB Output is correct
13 Correct 2 ms 552 KB Output is correct
14 Correct 2 ms 552 KB Output is correct
15 Correct 2 ms 552 KB Output is correct
16 Correct 14 ms 988 KB Output is correct
17 Correct 14 ms 992 KB Output is correct
18 Correct 14 ms 992 KB Output is correct
19 Correct 14 ms 992 KB Output is correct
20 Correct 16 ms 1008 KB Output is correct
21 Correct 55 ms 2284 KB Output is correct
22 Correct 52 ms 2284 KB Output is correct
23 Correct 52 ms 2284 KB Output is correct
24 Correct 53 ms 2284 KB Output is correct
25 Correct 44 ms 2284 KB Output is correct
26 Correct 71 ms 2284 KB Output is correct
27 Correct 52 ms 2284 KB Output is correct
28 Correct 52 ms 2284 KB Output is correct
29 Correct 53 ms 2284 KB Output is correct
30 Correct 38 ms 2284 KB Output is correct
31 Correct 1 ms 2284 KB Output is correct
32 Correct 1 ms 2284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 2284 KB Partially correct
2 Partially correct 1 ms 2284 KB Partially correct
3 Partially correct 1 ms 2284 KB Partially correct
4 Partially correct 2 ms 2284 KB Partially correct
5 Partially correct 1 ms 2284 KB Partially correct
6 Partially correct 2 ms 2284 KB Partially correct
7 Partially correct 3 ms 2284 KB Partially correct
8 Partially correct 2 ms 2284 KB Partially correct
9 Partially correct 2 ms 2284 KB Partially correct
10 Partially correct 1 ms 2284 KB Partially correct
11 Partially correct 23 ms 2284 KB Partially correct
12 Partially correct 25 ms 2284 KB Partially correct
13 Partially correct 21 ms 2284 KB Partially correct
14 Partially correct 25 ms 2284 KB Partially correct
15 Partially correct 11 ms 2284 KB Partially correct
16 Partially correct 407 ms 2284 KB Partially correct
17 Partially correct 412 ms 2284 KB Partially correct
18 Partially correct 407 ms 2284 KB Partially correct
19 Partially correct 430 ms 2284 KB Partially correct
20 Partially correct 26 ms 2284 KB Partially correct
21 Partially correct 1800 ms 2820 KB Partially correct
22 Partially correct 1888 ms 2820 KB Partially correct
23 Partially correct 1776 ms 2820 KB Partially correct
24 Partially correct 1875 ms 2820 KB Partially correct
25 Partially correct 951 ms 2820 KB Partially correct
26 Partially correct 1811 ms 2884 KB Partially correct
27 Partially correct 1827 ms 2884 KB Partially correct
28 Partially correct 1772 ms 2884 KB Partially correct
29 Partially correct 1802 ms 2884 KB Partially correct
30 Partially correct 124 ms 2884 KB Partially correct
31 Partially correct 2 ms 2884 KB Partially correct
32 Partially correct 2 ms 2884 KB Partially correct