제출 #32333

#제출 시각아이디문제언어결과실행 시간메모리
32333WhipppedCreamGap (APIO16_gap)C++14
0 / 100
66 ms5140 KiB
#include <bits/stdc++.h> #ifdef atom #include "grader.cpp" #else #include "gap.h" #endif using namespace std; typedef long long ll; typedef pair<int, int> ii; #define X first #define Y second #define vi vector<int> #define vvi vector< vi > #define vii vector< ii > #define mp make_pair #define pb push_back long long findGap(int T, int n) { ll left, right; MinMax(0, 1e18, &left, &right); ll best = 0; if(T == 1) { ll lmin = left, lmax = right; for(int i = 0; i< n; i+= 2) { ll mmin, mmax; MinMax(lmin+1, lmax-1, &mmin, &mmax); if(mmin == -1) break; best = max(best, lmax-mmax); best = max(best, mmin-lmin); lmin = mmin; lmax = mmax; if(lmax == lmin) break; } best = max(best, lmax-lmin); } return best; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...