Submission #40677

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
40677	2018-02-06T18:37:07 Z	Hassoony	Gap (APIO16_gap)	C++14	Compilation error	0 ms	0 KB

gap

#include <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
#include "gap.h"

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;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=1e5+9;

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

vector<ll>v;
ll findGap(int T, int N){
    ll l=0,r=1e18;
    MinMax(l,r,&l,&r);
    v.push_back(l);
    v.push_back(r);
    l++;r--;
    while(1){
        if(l!=-1&&l<=r){
            MinMax(l,r,&l,&r);
            if(l==-1)break;
            v.push_back(l);
            v.push_back(r);
            l++;r--;
        }
        else break;
    }
    sort(v.begin(),v.end());
    ll ans=0;
    for(int i=0;i<N-1;i++){
        ans=max(ans,v[i+1]-v[i]);
    }
    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);
}

Compilation message

/tmp/ccV8obSR.o: In function `MinMax(long long, long long, long long*, long long*)':
grader.cpp:(.text+0x0): multiple definition of `MinMax(long long, long long, long long*, long long*)'
/tmp/cc5IvFAc.o:gap.cpp:(.text+0x0): first defined here
/tmp/ccV8obSR.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cc5IvFAc.o:gap.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status