제출 #102806

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102806		CorneliuVadimTudor	Gap (APIO16_gap)	C++14	0 / 100	126 ms	2464 KiB

gap

#include <bits/stdc++.h>

#include "gap.h"

std::vector <long long> V;
long long findGap(int T, int N){
    long long A, B;
    MinMax(0, 1000000000000000000LL, &A, &B);

    long long Dmax = B - A;
    long long dist = ceil(1.0 * Dmax / (N - 1)) + 1;
    long long st;

    long long maxx = 0, prev = 1000000000000000000LL;
    for(st = A; st + dist <= B; st += dist){
        long long a, b;
        MinMax(st, st + dist - 1, &a, &b);
        V.push_back(a);
        if(b != a) V.push_back(b);

        if(a - prev > maxx) maxx = a - prev;
        if(b - a > maxx) maxx = b - a;
        prev = b;
    }
    if(V.size() && V.back() != -1 && B - V.back() > maxx){
        long long a, b;
        MinMax(st, B, &a, &b);
        V.push_back(a);
        if(b != a) V.push_back(b);
    }

    for(int i = 0; i + 1 < V.size(); i++)
        if(V[i] != -1 && V[i + 1] - V[i] > maxx) maxx = V[i + 1] - V[i];
    return maxx;
};

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

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

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:32:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i + 1 < V.size(); i++)
                    ~~~~~~^~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70