Submission #849471

#TimeUsernameProblemLanguageResultExecution timeMemory
849471TahirAliyevGap (APIO16_gap)C++17
30 / 100
29 ms3516 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; #define ll long long ll findGap(int T, int N) { if(T == 1){ ll a, b; MinMax(1, 1e18, &a, &b); if(N == 2){ return b - a; } ll ans = 1; ll _a, _b; int t = 2; while(t < N){ _a = a, _b = b; MinMax(a + 1, b - 1, &a, &b); ans = max(a - _a, ans); ans = max(_b - b, ans); t += 2; } if(N % 2 == 0){ ans = max(ans, b - a); } return ans; } else{ return 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...