Submission #1076443

#TimeUsernameProblemLanguageResultExecution timeMemory
1076443s0urceGap (APIO16_gap)C++17
0 / 100
30 ms2696 KiB
#include "gap.h"
#include <iostream>
#include <vector>
using namespace std;

long long findGap(int T, int N) {
    vector<long long> a = {};
    vector<long long> a_sec = {};
    long long l = 0;
    long long r = 1e18;
    while (l < r) {
        // cout << l << " " << r << endl;
        long long mn, mx;
        MinMax(l, r, &mn, &mx);
        if (mn == -1) break;
        a.push_back(mn);
        if (mn != mx) a_sec.push_back(mx);
        l = mn + 1;
        r = mx - 1;
    }
    for (int i = a_sec.size() - 1; i >= 0; i --) {
        a.push_back(a_sec[i]);
    }
    // for (auto aa: a) {
    //     cout << aa << " ";
    // }
    // cout << endl;
    long long res = -1;
    for (int i = 0; i < N - 1; i ++) {
        res = max(res, a[i + 1] - a[i]);
    }
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...