Submission #950129

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
950129	2024-03-20T05:39:16 Z	quanlt206	Gap (APIO16_gap)	C++17	Compilation error	0 ms	0 KB

gap

//#include "gap.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 1e5 + 7;

ll a[N], b[N];
int n;
int cntQuery = 0;

ll sub1(int n) {
    int l = 1, r = n;
    ll s = 0, t = 1e18;
    while (l <= r) {
        ll* mn = new ll();
        ll* mx = new ll();
        MinMax(s, t, mn, mx);
        a[l] = *mn;
        a[r] = *mx;
        l++;
        r--;
        s = *mn + 1;
        t = *mx - 1;
    }
    ll res = 0;
    REP(i, 1, n) maximize(res, a[i + 1] - a[i]);
    return res;
}

ll findGap(int T, int n) {
//    if (T == 1 || n <= 7) return sub1(n);
    a[0] = -1;
    ll res = 0;
    int i = 1;
    ll* mn = new ll();
    ll* mx = new ll();
    MinMax(0, 1e18, mn, mx);
    ll Max = *mx, Min = *mn;
    res = (Max - Min) / (n - 1);
    if (1LL * res * (n - 1) < Max - Min) res++;
    vector<pll> A;
    for (ll i = Min; i <= Max; i+=res) {
        ll* mn = new ll();
        ll* mx = new ll();
        MinMax(i, i + res - 1, mn, mx);
//        if (!A.empty() && *mn != -1) maximize(res, *mn - A.back().Y);
        if (*mn != -1) A.push_back({*mn, *mx});
    }
    REP(i, 1, (int)A.size()) maximize(res, A[i].X - A[i - 1].Y);
    return res;
}

Compilation message

gap.cpp: In function 'll sub1(int)':
gap.cpp:55:9: error: 'MinMax' was not declared in this scope
   55 |         MinMax(s, t, mn, mx);
      |         ^~~~~~
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:75:5: error: 'MinMax' was not declared in this scope
   75 |     MinMax(0, 1e18, mn, mx);
      |     ^~~~~~
gap.cpp:72:9: warning: unused variable 'i' [-Wunused-variable]
   72 |     int i = 1;
      |         ^