Submission #740419

#	Time	Username	Problem	Language	Result	Execution time	Memory
740419		GrindMachine	Gap (APIO16_gap)	C++17	30 / 100	37 ms	1880 KiB

gap

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "gap.h"

ll findGap(int t, int n)
{
    ll mn = 0, mx = 1e18;
    vector<ll> a(n);

    rep(i, ceil2(n, 2)) {
        ll mn2, mx2;
        MinMax(mn, mx, &mn2, &mx2);

        a[i] = mn2;
        a[n - i - 1] = mx2;

        mn = mn2 + 1;
        mx = mx2 - 1;
    }

    ll res = 0;
    rep(i, n - 1) amax(res, a[i + 1] - a[i]);

    return res;
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70