Submission #112668

#TimeUsernameProblemLanguageResultExecution timeMemory
112668dolphingarlicGap (APIO16_gap)C++14
0 / 100
2096 ms4208 KiB
#include <bits/stdc++.h>
#include "gap.h"
#define MAXN 1000000000000000000
using namespace std;
typedef long long ll;

ll findGap(int T, int N) {
    if (T == 1) {
        ll l = 1, r = MAXN;
        ll mn, mx;
        vector<ll> v;
        while (l <= r) {
            MinMax(l, r, &mn, &mx);
            if (mn != -1) {
                v.push_back(mn);
                v.push_back(mx);
            }
            l = mn + 1, r = mx - 1;
        }
        sort(v.begin(), v.end());
        ll ans = 0;
        for (int i = 0; i < v.size() - 1; i++) ans = max(ans, v[i + 1] - v[i]);
        return ans;
    } else {
        ll mn, mx;
        MinMax(1, MAXN, &mn, &mx);
        ll step = ceil((mx - mn) / (double)(N - 1));
        ll ans = step, x, y, l = mn;
        for (int i = mn; i + step <= mx; i += step + 1) {
            MinMax(i, i + step, &x, &y);
            if (x != -1) {
                ans = max(ans, x - l);
                l = y;
            }
        }
        ans = max(ans, mx - l);
        return ans;
    }
}

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:22:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size() - 1; i++) ans = max(ans, v[i + 1] - v[i]);
                         ~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...