Submission #963648

#	Time	Username	Problem	Language	Result	Execution time	Memory
963648		Acanikolic	Gap (APIO16_gap)	C++14	0 / 100	37 ms	4008 KiB

gap

#include <bits/stdc++.h>

#include "gap.h"

#define F first

#define S second

using namespace std;

const int N = 2e5 + 10;

const long long inf = 1e18;

/*long long a[N];
int n;

void MinMax(long long s,long long t,long long &mn,long long &mx) {
    for(int i = 1; i <= n; i++) {
        if(a[i] >= s) {
            mn = a[i];
            break;
        }
    }
    for(int i = 1; i <= n; i++) {
        if(a[i] <= t) mx = a[i];
    }
}
*/
long long findGap(int t,int n) {
    long long L,R,s = -1,tt = inf + 1;
    long long res = inf;
    vector<long long>vec;
    for(int i = 1; i <= (n + 1) / 2; i++) {
        MinMax(s + 1,tt - 1,&L,&R);
        s = L;
        tt = R; 
        if(L != -1) vec.push_back(L);
        if(R != -1 && L != R) vec.push_back(R);
    }
    sort(vec.begin(),vec.end());
    for(int i = 1; i < (int)vec.size(); i++) res = min(res,vec[i] - vec[i - 1]);
    return res;
}

/*signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    cout << findGap(1,n);
    return 0;
}*/

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