답안 #74600 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
74600	2018-09-05T01:24:53 Z	tincamatei	Gap (APIO16_gap)	C++14	100 / 100	82 ms	2272 KB

#include <bits/stdc++.h>
//#define HOME
#ifndef HOME
	#include "gap.h"
#else
 
long long findGap(int, int);
 
namespace grader {
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;
}
 
void grader() {
	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, "Gap : %lld\n", findGap(subtask_num, N));
	fprintf(out, "Calls: %lld\n", call_count);
}
 
}
 
void MinMax(long long s, long long t, long long *mn, long long *mx) {
	grader::MinMax(s, t, mn, mx);
}
 
int main()
{
	grader::grader();
}
 
 
#endif
 
const int MAX_N = 100000;
const long long INF = 1000000000000000000LL;
 
long long v[MAX_N];
 
long long findGap(int T, int N) {
	int top = 0;
	long long mn, mx, mnAll;
	if(T == 1) {
		MinMax(0, INF, &mn, &mx);
		v[0] = mn;
		v[N - 1] = mx;
		for(int i = 1; i <= (N - 1) / 2; ++i) {
            MinMax(v[i - 1] + 1, v[N - i] - 1, &mn, &mx);
            v[i] = mn;
            v[N - i - 1] = mx;
        }
        top = N;
    } else {
	    MinMax(0, INF, &mn, &mx);
	    //printf("%lld %lld\n", mn, mx);
	    mnAll = mn;
        long long expect = (mx - mn) / (N - 1) + 1;
        for(int i = 0; i < N - 1; ++i) {
	        MinMax(mnAll + i * expect, mnAll + i * expect + expect - 1, &mn, &mx);
	        //printf("%lld %lld %lld %lld\n", mnAll + i * expect, mnAll + i * expect + expect - 1, mn, mx);
	        if(mn != -1)
	            v[top++] = mn;
	        if(mn != mx && mx != -1)
	            v[top++] = mx;
	    }
	}
	//for(int i = 0; i < top; ++i)
	//    printf("%lld ", v[i]);
	long long rez = 0LL;
	for(int i = 0; i < top - 1; ++i)
	    rez = std::max(rez, v[i + 1] - v[i]);
	return rez;
}

Subtask #1
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	476 KB	Output is correct
3	Correct	2 ms	476 KB	Output is correct
4	Correct	2 ms	476 KB	Output is correct
5	Correct	2 ms	488 KB	Output is correct
6	Correct	2 ms	604 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	3 ms	604 KB	Output is correct
12	Correct	3 ms	604 KB	Output is correct
13	Correct	3 ms	608 KB	Output is correct
14	Correct	3 ms	700 KB	Output is correct
15	Correct	3 ms	700 KB	Output is correct
16	Correct	16 ms	916 KB	Output is correct
17	Correct	16 ms	916 KB	Output is correct
18	Correct	16 ms	1000 KB	Output is correct
19	Correct	15 ms	1108 KB	Output is correct
20	Correct	12 ms	1108 KB	Output is correct
21	Correct	56 ms	2136 KB	Output is correct
22	Correct	58 ms	2272 KB	Output is correct
23	Correct	63 ms	2272 KB	Output is correct
24	Correct	59 ms	2272 KB	Output is correct
25	Correct	51 ms	2272 KB	Output is correct
26	Correct	57 ms	2272 KB	Output is correct
27	Correct	59 ms	2272 KB	Output is correct
28	Correct	58 ms	2272 KB	Output is correct
29	Correct	81 ms	2272 KB	Output is correct
30	Correct	64 ms	2272 KB	Output is correct
31	Correct	3 ms	2272 KB	Output is correct
32	Correct	2 ms	2272 KB	Output is correct

Subtask #2
70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	2272 KB	Output is correct
2	Correct	2 ms	2272 KB	Output is correct
3	Correct	2 ms	2272 KB	Output is correct
4	Correct	2 ms	2272 KB	Output is correct
5	Correct	2 ms	2272 KB	Output is correct
6	Correct	2 ms	2272 KB	Output is correct
7	Correct	2 ms	2272 KB	Output is correct
8	Correct	2 ms	2272 KB	Output is correct
9	Correct	2 ms	2272 KB	Output is correct
10	Correct	2 ms	2272 KB	Output is correct
11	Correct	3 ms	2272 KB	Output is correct
12	Correct	3 ms	2272 KB	Output is correct
13	Correct	3 ms	2272 KB	Output is correct
14	Correct	3 ms	2272 KB	Output is correct
15	Correct	3 ms	2272 KB	Output is correct
16	Correct	20 ms	2272 KB	Output is correct
17	Correct	26 ms	2272 KB	Output is correct
18	Correct	24 ms	2272 KB	Output is correct
19	Correct	21 ms	2272 KB	Output is correct
20	Correct	10 ms	2272 KB	Output is correct
21	Correct	80 ms	2272 KB	Output is correct
22	Correct	82 ms	2272 KB	Output is correct
23	Correct	78 ms	2272 KB	Output is correct
24	Correct	78 ms	2272 KB	Output is correct
25	Correct	76 ms	2272 KB	Output is correct
26	Correct	77 ms	2272 KB	Output is correct
27	Correct	77 ms	2272 KB	Output is correct
28	Correct	78 ms	2272 KB	Output is correct
29	Correct	79 ms	2272 KB	Output is correct
30	Correct	63 ms	2272 KB	Output is correct
31	Correct	2 ms	2272 KB	Output is correct
32	Correct	2 ms	2272 KB	Output is correct

답안 #74600

Compilation message

Subtask #1 30.0 / 30.0

Subtask #2 70.0 / 70.0

Subtask #1
30.0 / 30.0

Subtask #2
70.0 / 70.0