답안 #23570 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23570	2017-05-12T16:40:35 Z	samir_droubi	Gap (APIO16_gap)	C++14	0 / 100	2000 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)
{
	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=d;
	ll last=l;
	ll mn,mx;
	for(int 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);
}
*/

Subtask #1
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5144 KB	Output is correct
2	Execution timed out	2000 ms	5144 KB	Execution timed out
3	Execution timed out	2000 ms	5144 KB	Execution timed out
4	Execution timed out	2000 ms	5144 KB	Execution timed out
5	Incorrect	0 ms	5144 KB	Output isn't correct
6	Execution timed out	2000 ms	5144 KB	Execution timed out
7	Execution timed out	2000 ms	5144 KB	Execution timed out
8	Execution timed out	2000 ms	5144 KB	Execution timed out
9	Execution timed out	2000 ms	5144 KB	Execution timed out
10	Incorrect	0 ms	5144 KB	Output isn't correct
11	Execution timed out	2000 ms	5144 KB	Execution timed out
12	Execution timed out	2000 ms	5144 KB	Execution timed out
13	Execution timed out	2000 ms	5144 KB	Execution timed out
14	Execution timed out	2000 ms	5144 KB	Execution timed out
15	Execution timed out	2000 ms	5144 KB	Execution timed out
16	Execution timed out	2000 ms	5144 KB	Execution timed out
17	Execution timed out	2000 ms	5144 KB	Execution timed out
18	Execution timed out	2000 ms	5144 KB	Execution timed out
19	Execution timed out	2000 ms	5144 KB	Execution timed out
20	Incorrect	6 ms	5144 KB	Output isn't correct
21	Execution timed out	2000 ms	5144 KB	Execution timed out
22	Execution timed out	2000 ms	5144 KB	Execution timed out
23	Execution timed out	2000 ms	5144 KB	Execution timed out
24	Execution timed out	2000 ms	5144 KB	Execution timed out
25	Execution timed out	2000 ms	5144 KB	Execution timed out
26	Execution timed out	2000 ms	5144 KB	Execution timed out
27	Execution timed out	2000 ms	5144 KB	Execution timed out
28	Execution timed out	2000 ms	5144 KB	Execution timed out
29	Execution timed out	2000 ms	5144 KB	Execution timed out
30	Incorrect	43 ms	5144 KB	Output isn't correct
31	Execution timed out	2000 ms	5144 KB	Execution timed out
32	Execution timed out	2000 ms	5144 KB	Execution timed out

Subtask #2
0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5144 KB	Output is correct
2	Execution timed out	2000 ms	5144 KB	Execution timed out
3	Execution timed out	2000 ms	5144 KB	Execution timed out
4	Execution timed out	2000 ms	5144 KB	Execution timed out
5	Correct	0 ms	5144 KB	Output is correct
6	Execution timed out	2000 ms	5144 KB	Execution timed out
7	Execution timed out	2000 ms	5144 KB	Execution timed out
8	Execution timed out	2000 ms	5144 KB	Execution timed out
9	Execution timed out	2000 ms	5144 KB	Execution timed out
10	Correct	0 ms	5144 KB	Output is correct
11	Execution timed out	2000 ms	5144 KB	Execution timed out
12	Execution timed out	2000 ms	5144 KB	Execution timed out
13	Execution timed out	2000 ms	5144 KB	Execution timed out
14	Execution timed out	2000 ms	5144 KB	Execution timed out
15	Execution timed out	2000 ms	5144 KB	Execution timed out
16	Execution timed out	2000 ms	5144 KB	Execution timed out
17	Execution timed out	2000 ms	5144 KB	Execution timed out
18	Execution timed out	2000 ms	5144 KB	Execution timed out
19	Execution timed out	2000 ms	5144 KB	Execution timed out
20	Partially correct	9 ms	5144 KB	Partially correct
21	Execution timed out	2000 ms	5144 KB	Execution timed out
22	Execution timed out	2000 ms	5144 KB	Execution timed out
23	Execution timed out	2000 ms	5144 KB	Execution timed out
24	Execution timed out	2000 ms	5144 KB	Execution timed out
25	Execution timed out	2000 ms	5144 KB	Execution timed out
26	Execution timed out	2000 ms	5144 KB	Execution timed out
27	Execution timed out	2000 ms	5144 KB	Execution timed out
28	Execution timed out	2000 ms	5144 KB	Execution timed out
29	Execution timed out	2000 ms	5144 KB	Execution timed out
30	Partially correct	39 ms	5144 KB	Partially correct
31	Execution timed out	2000 ms	5144 KB	Execution timed out
32	Execution timed out	2000 ms	5144 KB	Execution timed out

답안 #23570

Compilation message

Subtask #1 0 / 30.0

Subtask #2 0 / 70.0

Subtask #1
0 / 30.0

Subtask #2
0 / 70.0