oj.uz

답안 #23581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23581 2017-05-12T17:11:43 Z samir_droubi Gap (APIO16_gap) C++14
30 / 100
 83 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);
			if(n==2)return r-l;
			while(l+1<r-1&&n>2)
			{
				MinMax(l+1,r-1,&mn,&mx);
				if(mx==-1)break;
				ans=max(ans,mn-l);
				ans=max(ans,r-mx);
				l=mn;
				r=mx;
				n-=2;
			}
			return ans;
		}
		else
		{
			ll l,r;
			MinMax(0,1LL*(1e18),&l,&r);
			if(n==2)return r-l;
			++l;
			--r;
			ll d=(r-l)/(n-1);
			ll ans=d;
			ll last=l;
			ll mn,mx;
			for(ll i=l;i+d-1<=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
30.0 / 30.0

# 결과 실행 시간 메모리 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 6 ms 5144 KB Output is correct
17 Correct 16 ms 5144 KB Output is correct
18 Correct 16 ms 5144 KB Output is correct
19 Correct 16 ms 5144 KB Output is correct
20 Correct 13 ms 5144 KB Output is correct
21 Correct 59 ms 5144 KB Output is correct
22 Correct 53 ms 5144 KB Output is correct
23 Correct 56 ms 5144 KB Output is correct
24 Correct 46 ms 5144 KB Output is correct
25 Correct 49 ms 5144 KB Output is correct
26 Correct 69 ms 5144 KB Output is correct
27 Correct 63 ms 5144 KB Output is correct
28 Correct 49 ms 5144 KB Output is correct
29 Correct 56 ms 5144 KB Output is correct
30 Correct 36 ms 5144 KB Output is correct
31 Correct 0 ms 5144 KB Output is correct
32 Correct 0 ms 5144 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 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 19 ms 5144 KB Output is correct
20 Partially correct 6 ms 5144 KB Partially correct
21 Correct 73 ms 5144 KB Output is correct
22 Correct 73 ms 5144 KB Output is correct
23 Correct 69 ms 5144 KB Output is correct
24 Correct 79 ms 5144 KB Output is correct
25 Correct 69 ms 5144 KB Output is correct
26 Correct 76 ms 5144 KB Output is correct
27 Correct 66 ms 5144 KB Output is correct
28 Correct 83 ms 5144 KB Output is correct
29 Correct 83 ms 5144 KB Output is correct
30 Partially correct 56 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