oj.uz

답안 #145172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145172 2019-08-19T04:49:48 Z MathStudent2002 Gap (APIO16_gap) C++14
100 / 100
 117 ms 7804 KB 
//wait darn

#include<bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include "gap.h"

using namespace std;

typedef long long ll;

/*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;

long long findGap(int, int);

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;
}

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);
}

*/

long long findGap(int T, int N)
{
    set<ll> s;
	if(T == 1) {
        ll lo = 0, hi = 1000000000000000000;
        ll fi, se;
        for(int i = 0; 2*i < N; i++) {
            MinMax(lo,hi,&fi,&se);
            s.insert(fi);
            s.insert(se);
            lo = fi+1;
            hi = se-1;
        }
	}
	else {
        ll lo = 0, hi = 1000000000000000000;
        ll fi, se;
        ll first, last;
        MinMax(lo,hi,&first,&last);
        ll d = (last-first)/(N-1) + 1;
        for(ll i = 0; i < N-1; i++) {
            MinMax(first+i*d, first+(i+1)*d-1, &fi, &se);
            if(fi != -1) {s.insert(fi); s.insert(se);}
        }
	}


    ll ans = 0;

    set<ll>::iterator it2 = s.begin();
    it2++;
    for(set<ll>::iterator it = s.begin(); it2 != s.end();) {
        ans = max(ans, (*it2)-(*it));
        it++;
        it2++;
    }
    return ans;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 22 ms 2160 KB Output is correct
17 Correct 21 ms 2168 KB Output is correct
18 Correct 21 ms 2168 KB Output is correct
19 Correct 21 ms 2168 KB Output is correct
20 Correct 18 ms 1912 KB Output is correct
21 Correct 87 ms 7804 KB Output is correct
22 Correct 87 ms 7620 KB Output is correct
23 Correct 87 ms 7672 KB Output is correct
24 Correct 86 ms 7672 KB Output is correct
25 Correct 78 ms 7032 KB Output is correct
26 Correct 87 ms 7672 KB Output is correct
27 Correct 94 ms 7672 KB Output is correct
28 Correct 89 ms 7732 KB Output is correct
29 Correct 86 ms 7676 KB Output is correct
30 Correct 72 ms 6516 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 25 ms 2040 KB Output is correct
17 Correct 25 ms 2040 KB Output is correct
18 Correct 25 ms 2008 KB Output is correct
19 Correct 25 ms 2040 KB Output is correct
20 Correct 10 ms 760 KB Output is correct
21 Correct 103 ms 7164 KB Output is correct
22 Correct 103 ms 7160 KB Output is correct
23 Correct 103 ms 7184 KB Output is correct
24 Correct 108 ms 7256 KB Output is correct
25 Correct 111 ms 7032 KB Output is correct
26 Correct 117 ms 7160 KB Output is correct
27 Correct 103 ms 7160 KB Output is correct
28 Correct 105 ms 7092 KB Output is correct
29 Correct 105 ms 7160 KB Output is correct
30 Correct 42 ms 2724 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct