Submission #23575

# Submission time Handle Problem Language Result Execution time Memory
23575 2017-05-12T16:57:05 Z samir_droubi Gap (APIO16_gap) C++14
0 / 100
76 ms 5144 KB
#include <bits/stdc++.h>

#include "gap.h"
#define ll long long

using namespace std;
/*
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
	int lo = 1, hi = N, left = N+1, right = 0;
	my_assert(s <= t && mn != NULL && mx != NULL);
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] >= s) hi = mid - 1, left = mid;
		else lo = mid + 1;
	}
	lo = 1, hi = N;
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] <= t) lo = mid + 1, right = mid;
		else hi = mid - 1;
	}
	if (left > right) *mn = *mx = -1;
	else{
		*mn = A[left];
		*mx = A[right];
	}
	if (subtask_num == 1) call_count++;
	else if (subtask_num == 2) call_count += right-left+2;
}
*/
long long findGap(int T, int n)
{
	if(T==1)
	{
		ll l,r;
		ll mn,mx;
		ll ans=0;
		MinMax(0,1LL*(1e18),&l,&r);
		while(l<=r)
		{
			MinMax(l+1,r-1,&mn,&mx);
			if(mx==0)break;
			ans=max(ans,mn-l);
			ans=max(ans,r-mx);
			l=mn;
			r=mx;
		}
		return ans;
	}
	else
	{
		ll l,r;
		MinMax(0,1LL*(1e18),&l,&r);
		if(n==2)return r-l;
		++l;
		--r;
		ll d=(r-l+1)/(n-1);
		ll ans=0;
		ll last=l;
		ll mn,mx;
		for(ll i=l;i<=r;i+=d)
		{	
			MinMax(i,min(i+d-1,r),&mn,&mx);
			if(mn==-1)continue;
			ans=max(ans,mn-last);
			last=mx;
		}
		ans=max(ans,r-last);
		return ans;
	}
}
/*
int main()
{
	FILE *in = stdin, *out = stdout;
	my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
	my_assert(1 <= subtask_num && subtask_num <= 2);
	my_assert(2 <= N && N <= 100000);
	for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
	for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
	fprintf(out, "%lld\n", findGap(subtask_num, N));
	fprintf(out, "%lld\n", call_count);
}
*/
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
2 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
3 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
4 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
5 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
6 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
7 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
8 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
9 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
10 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
11 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
12 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
13 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
14 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
15 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
16 Incorrect 13 ms 5144 KB Unexpected end of file - int64 expected
17 Incorrect 16 ms 5144 KB Unexpected end of file - int64 expected
18 Incorrect 9 ms 5144 KB Unexpected end of file - int64 expected
19 Incorrect 13 ms 5144 KB Unexpected end of file - int64 expected
20 Incorrect 9 ms 5144 KB Unexpected end of file - int64 expected
21 Incorrect 56 ms 5144 KB Unexpected end of file - int64 expected
22 Incorrect 53 ms 5144 KB Unexpected end of file - int64 expected
23 Incorrect 59 ms 5144 KB Unexpected end of file - int64 expected
24 Incorrect 56 ms 5144 KB Unexpected end of file - int64 expected
25 Incorrect 49 ms 5144 KB Unexpected end of file - int64 expected
26 Incorrect 63 ms 5144 KB Unexpected end of file - int64 expected
27 Incorrect 53 ms 5144 KB Unexpected end of file - int64 expected
28 Incorrect 53 ms 5144 KB Unexpected end of file - int64 expected
29 Incorrect 56 ms 5144 KB Unexpected end of file - int64 expected
30 Incorrect 33 ms 5144 KB Unexpected end of file - int64 expected
31 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
32 Incorrect 0 ms 5144 KB Unexpected end of file - int64 expected
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 0 ms 5144 KB Output is correct
3 Correct 0 ms 5144 KB Output is correct
4 Correct 0 ms 5144 KB Output is correct
5 Correct 0 ms 5144 KB Output is correct
6 Correct 0 ms 5144 KB Output is correct
7 Correct 0 ms 5144 KB Output is correct
8 Correct 0 ms 5144 KB Output is correct
9 Correct 0 ms 5144 KB Output is correct
10 Correct 0 ms 5144 KB Output is correct
11 Correct 0 ms 5144 KB Output is correct
12 Correct 0 ms 5144 KB Output is correct
13 Correct 0 ms 5144 KB Output is correct
14 Correct 0 ms 5144 KB Output is correct
15 Correct 0 ms 5144 KB Output is correct
16 Correct 19 ms 5144 KB Output is correct
17 Correct 16 ms 5144 KB Output is correct
18 Correct 19 ms 5144 KB Output is correct
19 Correct 23 ms 5144 KB Output is correct
20 Partially correct 6 ms 5144 KB Partially correct
21 Correct 76 ms 5144 KB Output is correct
22 Correct 69 ms 5144 KB Output is correct
23 Correct 69 ms 5144 KB Output is correct
24 Correct 69 ms 5144 KB Output is correct
25 Correct 73 ms 5144 KB Output is correct
26 Correct 69 ms 5144 KB Output is correct
27 Correct 69 ms 5144 KB Output is correct
28 Correct 69 ms 5144 KB Output is correct
29 Correct 76 ms 5144 KB Output is correct
30 Partially correct 43 ms 5144 KB Partially correct
31 Incorrect 0 ms 5144 KB Output isn't correct
32 Incorrect 0 ms 5144 KB Output isn't correct