Submission #1155426

#TimeUsernameProblemLanguageResultExecution timeMemory
1155426SangGap (APIO16_gap)C++20
0 / 100
44 ms1172 KiB
#ifndef _Pbrngw_ #include "gap.h" #endif // _Pbrngw_ #include<bits/stdc++.h> using namespace std; #define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++) #define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--) #define fi first #define se second #define pb push_back #define ALL(a) (a).begin(), (a).end() #define task "kbsiudthw" typedef vector<int> vi; typedef pair<int, int> ii; typedef pair<int, ii> pii; const int N = 1e5 + 5; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 2277; long long findGap(int T, int N) { long long A, B, C1, C2; MinMax(0, 1e18, &A, &B); long long block = (B - A + 1)/N; long long last = A, ans = 0; for (long long i = A; i <= B; i += max(ans, block)){ long long x, y; MinMax(i, min(B, i + max(ans, block) - 1), &x, &y); if (x == -1) continue; ans = max(ans, x - last); last = y; } return ans; } #ifdef _Pbrngw_ signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } return 0; } #endif // _Pbrngw_
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...