Submission #95608

#TimeUsernameProblemLanguageResultExecution timeMemory
95608shenxyGap (APIO16_gap)C++11
0 / 100
91 ms1176 KiB
#include "gap.h"
#include <algorithm>
using namespace std;
long long findGap(int T, int N){
    long long int m, n;
    MinMax(1, 1000000000000000000LL, &m, &n);
    long long int ans = 0;
    long long int a, b;
    while (m + 1 <= n - 1) {
        a = m, b = n;
        MinMax(a + 1, b - 1, &m, &n);
        if (m == -1 || n == -1) {
            ans = max(ans, b - a);
            break;
        }
        ans = max(ans, max(m - a, b - n));
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...