Submission #1185061

#TimeUsernameProblemLanguageResultExecution timeMemory
1185061swishy123Gap (APIO16_gap)C++20
70 / 100
46 ms3260 KiB
#include <iostream> #include <algorithm> #include <vector> #include <random> #include <chrono> #include <set> #include <map> #include <stack> #include <functional> #include <iomanip> #include <queue> #include <cassert> #include <complex> #include <cstring> #include <memory> #include <bitset> #include <sstream> #include <cmath> #include <numeric> #include <numbers> #include <fstream> #include "gap.h" using namespace std; #ifndef template #ifndef define #define ll long long #define ld long double #define pl pair<ll, ll> #define pi pair<int, int> #define nl cout << '\n'; #define x first #define y second #define cbit(x) __builtin_popcountll(x) #define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) #define siz(x) (int)x.size() #endif #ifndef print void print(size_t x) {cout << x << ' ';} void print(int x) {cout << x << ' ';} void print(long long x) {cout << x << ' ';} void print(float x) {cout << x << ' ';} void print(long double x) {cout << x << ' ';} void print(char x) {cout << x << ' ';} void print(const char* x) {cout << x << ' ';} void print(bool x) {cout << x << ' ';} void print(string &x) {cout << x << ' ';} template<typename T, typename V> void print(pair<T, V> &p) {print(p.x); print(p.y);} template<typename T> void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);} template<typename T> void print(vector<vector<T>> v) { for (int i = 0; i < v.size(); i++){ for (int j = 0; j < v[i].size(); j++) print(v[i][j]); nl; } } template <typename T, typename... V> void print(T t, V&&... v) {print(t); print(v...);} #endif #ifndef read void read(int &x) {cin >> x;} void read(long long &x) {cin >> x;} void read(unsigned &x) {cin >> x;} void read(unsigned long long &x) {cin >> x;} void read(float &x) {cin >> x;} void read(long double &x) {cin >> x;} void read(char &x) {cin >> x;} void read(string &x) {cin >> x;} void read(bool &x) {cin >> x;} template<typename T> void read(vector<T> &v) { for (int i = 0; i < v.size(); i++) read(v[i]); } template <typename T, typename... V> void read(T &t, V&... v) {read(t); read(v...);} #endif mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template<class T> bool maxi(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template<class T> bool mini(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template<class... Args> auto vec(size_t n, Args&&... args) { if constexpr(sizeof...(args) == 1) return vector(n, args...); else return vector(n, vec(args...)); } #endif using namespace std; const ll inf = 1e18; const ll def = 1e5+1; const ll mod = 1e9; long long findGap(int T, int N){ ll l, r; MinMax(1, 1e18, &l, &r); ll gap = (r - l + 1) / (ll)(N - 1); if (((r - l + 1) % (ll)(N - 1)) != 0) gap++; vector<ll> x = {l, r}; ll crr = l; for (int i = 0; i < N - 1; i++){ MinMax(crr, crr + gap - 1, &l, &r); if (l != -1){ x.push_back(l); x.push_back(r); } crr += gap; } sort(x.begin(), x.end()); ll res = 0; for (int i = 1; i < x.size(); i++) maxi(res, x[i] - x[i - 1]); return res; } /* */ // void solve(){ // int r, l, b; // read(r, l, b); // int x[r]; // for (int i = 0; i < r; i++) // read(x[i]); // print(besthub(r, l, x, b)); // } // /* // 1 2 3 4 // 2 3 4 1 // */ // int32_t main(){ // ios_base::sync_with_stdio(0); // cin.tie(0); cout.tie(0); // // if (ifstream("input.txt").good()){ // // freopen("input.txt", "r", stdin); // // freopen("output.txt", "w", stdout); // // } // int t; // t = 1; // while (t--){ // solve(); // nl; // } // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...