Submission #929407

#	Time	Username	Problem	Language	Result	Execution time	Memory
929407		Foolestboy	Boat (APIO16_boat)	C++14	Compilation error	0 ms	0 KiB

boat

#ifndef GNORT
#include "gap.h"
#endif // GNORT
#include <bits/stdc++.h>

#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back
#define all(x)    x.begin(), x.end()
#define rall(x)   x.rbegin(), x.rend()
#define sz(s)     (int)s.size()
#define prev      __prev
#define next      __next
#define left      __left
#define right     __right

#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class BUI, class TRONG>
    bool minimize(BUI &x, const TRONG y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class BUI, class TRONG>
    bool maximize(BUI &x, const TRONG y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/
/* Template is copied by Trong */

                           /** Losing in Provincial Contests **/
                                    /** TRYING HARDER**/
                                   /**      ORZ     **/

/* -----------------[ MAIN CODE GOES HERE ]----------------- */

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e5 + 10;

#ifdef GNORT

struct Jury{
    int n, type;
    ll a[N];

    Jury() : n(0) {}

    void init(){
        cin >> type >> n;
        for(int i = 1; i <= n; i++) cin >> a[i];
    }

    void MinMax(ll s, ll t, ll *mn, ll *mx){
        *mn = *mx = -1;
        for(int i = 1; i <= n; i++){
            if(a[i] >= s){
                *mn = a[i];
                break;
            }
        }
        for(int i = n; i >= 1; i--){
            if(a[i] <= t){
                *mx = a[i];
                break;
            }
        }
    }

    void check(ll ans){
        ll res(0);
        for(int i = 1; i < n; i++) maximize(res, a[i + 1] - a[i]);
        if(ans == res) cout << "DUNG" << '\n';
        else{
            cout << "Jury: " << res << '\n';
            cout << "Part: " << ans << '\n';
        }
    }

} jury;

void MinMax(ll s, ll t, ll *mn, ll *mx){
    jury.MinMax(s, t, mn, mx);
}

void check(ll ans){
    jury.check(ans);
}

#endif // GNORT

ll a[N];

ll findGap1(int n){
    MinMax(0, (ll)1e18, &a[1], &a[n]);
    for(int i = 2; i <= n - i + 1; i++){
        MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
    }
    ll ans = 0;
    for(int i = 1; i < n; i++) maximize(ans, a[i + 1] - a[i]);
    check(ans);
    return ans;
}

ll findGap2(int n){
    return 0;
}

ll findGap(int type, int n){
    return type == 1 ? findGap1(n) : findGap2(n);
}
/*
1 4
2 3 6 8
*/

#ifdef GNORT

void solve(){
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;

    while( tt-- ){

        jury.init();
        findGap(jury.type, jury.n);

    }

    return 0;
}

#endif

Compilation message (stderr)

boat.cpp:2:10: fatal error: gap.h: No such file or directory
    2 | #include "gap.h"
      |          ^~~~~~~
compilation terminated.