Submission #1050456

#	Time	Username	Problem	Language	Result	Execution time	Memory
1050456		MrAndria	Gap (APIO16_gap)	C++14	0 / 100	38 ms	2684 KiB

gap

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

#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;
using namespace std;
#define ff first;
#define ss second
#define pb push_back
//#define int long long
long long a[200005],tl,tr,l,r,mx;





// 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 sub,int n){
    long long l,r,last,mi,mx,sum,last1,k;
    MinMax(1,1e18,&l,&r);
    k=sum=(r-l+n-2)/(n-1);
    last=l;
    for(long long i=l;i+k<=r;i+=k){
        last1=i;
        MinMax(i,i+k,&mi,&mx);
        if(mi!=-1 and mx!=-1){
            sum=max(sum,mx-last);
            last=mx;
        }
        i++;
    }
    MinMax(last1,r,&mi,&mx);
    if(mi!=-1 and mx!=-1){
        sum=max(sum,mi-last);
    }
    return sum;
}
// int main()
// {
//     cin>>N;
// 	for (int i=1;i<=N;i++) cin>>A[i];
// 	printf("%lld\n", findGap(subtask_num, N));
// 	printf("%lld\n", call_count);
// }

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:60:11: warning: 'last1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   60 |     MinMax(last1,r,&mi,&mx);
      |     ~~~~~~^~~~~~~~~~~~~~~~~

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