Submission #109320

#TimeUsernameProblemLanguageResultExecution timeMemory
109320b2563125Gap (APIO16_gap)C++14
0 / 100
71 ms1400 KiB
#include<iostream> #include<algorithm> #include<vector> #include "gap.h" using namespace std; #define vel vector<long long> #define rep(i,n) for(long long i=0;i<n;i++) int pr = 1000000007; int ref(int &a) { a = a % pr; a += pr; a = a % pr; return a; } long long findGap(int t, int n) { long long N = n; long long a1; long long an; long long INF = pr - 7; INF *= INF; MinMax(0, max(INF,INF-INF), &a1, &an); long long X = an - a1 + 1; long long now_min = a1; long long ans = 0; rep(i, n) { long long mn, mx; MinMax(a1 + (X*i) / N, max(a1 + (X*(i + 1)) / N, a1 + (X*i) / N), &mn, &mx); if (mn != -1) { ans = max(mn - now_min, ans); now_min = mx; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...