Submission #343503

#	Time	Username	Problem	Language	Result	Execution time	Memory
343503		beksultan04	Gap (APIO16_gap)	C++14	30 / 100	48 ms	2044 KiB

gap

#include "gap.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%d %lld",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define umax(a,b) a = max(a,b);
#define umin(a,b) a = min(a,b);
#define endi puts("");
#define eps 1e-12
const int n = 1e6+12,INF=1e9+7;
ll q[n];

long long findGap(int T, int N)
{
    ll l = 1,r = 1e18,ql=1,qr=N;
    while (qr-ql>=0){
        ll mn,mx;
        MinMax(l,r,&mn,&mx);
        q[ql] = mn;
        q[qr] = mx;
        l = mn+1;
        r = mx-1;
        ql++;
        qr--;
    }
    ll mx = 0;
    for (int i=1;i<=N;++i){
        umax(mx,q[i+1]-q[i]);
    }
	return mx;
}

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