제출 #556446

#제출 시각아이디문제언어결과실행 시간메모리
556446SavicSGap (APIO16_gap)C++17
57.64 / 100
67 ms3260 KiB
#include "gap.h" #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <bits/stdc++.h> using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef long double ldb; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<ldb,ldb> pdd; #define ff(i,a,b) for(int i = a; i <= b; i++) #define fb(i,b,a) for(int i = b; i >= a; i--) #define trav(a,x) for (auto& a : x) #define sz(a) (int)(a).size() #define fi first #define se second #define pb push_back #define lb lower_bound #define ub upper_bound #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // os.order_of_key(k) the number of elements in the os less than k // *os.find_by_order(k) print the k-th smallest number in os(0-based) const int mod = 1000000007; const ll inf = 1e18; const int mxN = 200005; int N; ll findGap(int T, int _N){ N = _N; ll P = 0, Z = 0; MinMax(0, inf, &P, &Z); if(N == 2){ return Z - P; } ll D = (Z - P - 1) / (N - 1); vector<pll> vec; vec.pb({P, P}); for(ll X = P + 1; X < Z; X += D){ ll L = X; ll R = min(Z - 1, X + D); ll S = 0, Q = 0; MinMax(L, R, &S, &Q); if(S != -1 && Q != -1)vec.pb({S, Q}); } vec.pb({Z, Z}); ll mx = 0; ff(i,0,sz(vec) - 1){ if(i > 0)mx = max(mx, vec[i].fi - vec[i - 1].se); mx = max(mx, vec[i].fi - vec[i].se); } return mx; } // int main() { // cin.tie(0)->sync_with_stdio(0); // cin >> N; // ff(i,1,N)cin >> A[i]; // cout << findGap(1, N) << '\n'; // return 0; // } /* 4 2 3 6 8 // probati bojenje sahovski */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...