Submission #778922

#TimeUsernameProblemLanguageResultExecution timeMemory
778922horiiseunGap (APIO16_gap)C++17
100 / 100
47 ms1856 KiB
#include <iostream> #include <vector> #include <tuple> #include <queue> #include <stack> #include <deque> #include <set> #include <map> #include <cmath> #include <random> #include <string> #include <bitset> #include <cassert> #include <climits> #include <algorithm> #include <unordered_set> #include <unordered_map> #include "gap.h" using namespace std; #define ll long long #define f first #define s second void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << '\'' << x << '\''; } void __print(const char *x) { cerr << '\"' << x << '\"'; } void __print(const string &x) { cerr << '\"' << x << '\"'; } void __print(bool x) { cerr << (x ? "true" : "false"); } template<typename A> void __print(const A &x); template<typename A, typename B> void __print(const pair<A, B> &p); template<typename... A> void __print(const tuple<A...> &t); template<typename T> void __print(stack<T> s); template<typename T> void __print(queue<T> q); template<typename T, typename... U> void __print(priority_queue<T, U...> q); template<typename A> void __print(const A &x) { bool first = true; cerr << '{'; for (const auto &i : x) { cerr << (first ? "" : ","), __print(i); first = false; } cerr << '}'; } template<typename A, typename B> void __print(const pair<A, B> &p) { cerr << '('; __print(p.f); cerr << ','; __print(p.s); cerr << ')'; } template<typename... A> void __print(const tuple<A...> &t) { bool first = true; cerr << '('; apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t); cerr << ')'; } template<typename T> void __print(stack<T> s) { vector<T> debugVector; while (!s.empty()) { T t = s.top(); debugVector.push_back(t); s.pop(); } reverse(debugVector.begin(), debugVector.end()); __print(debugVector); } template<typename T> void __print(queue<T> q) { vector<T> debugVector; while (!q.empty()) { T t = q.front(); debugVector.push_back(t); q.pop(); } __print(debugVector); } template<typename T, typename... U> void __print(priority_queue<T, U...> q) { vector<T> debugVector; while (!q.empty()) { T t = q.top(); debugVector.push_back(t); q.pop(); } __print(debugVector); } void _print() { cerr << "]\n"; } template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) { __print(H); if (sizeof...(T)) cerr << ", "; _print(T...); } #ifdef DEBUG #define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__) #else #define D(...) #endif #define ll long long ll findGap(int T, int N) { ll mn, mx, sm = 1, lg = 1e18, ans = 0; if (T == 1) { vector<ll> v(N, 0); for (int i = 0; i < (N + 1) / 2; i++) { MinMax(sm, lg, &mn, &mx); v[i] = mn; v[N - i - 1] = mx; sm = mn + 1; lg = mx - 1; } for (int i = 1; i < N; i++) { ans = max(ans, v[i] - v[i - 1]); } return ans; } MinMax(sm, lg, &mn, &mx); ll gap = (mx - mn) / (N - 1) + 1, tmn, tmx, lst = mn; for (sm = mn + 1, lg = sm + gap; sm < mx; sm += gap, lg += gap) { if (sm >= mx) break; lg = min(lg, mx); MinMax(sm, lg - 1, &tmn, &tmx); if (!(tmn == -1 && tmx == -1)) { ans = max(ans, tmn - lst); lst = tmx; } } ans = max(ans, mx - lst); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...