Submission #710542

#	Time	Username	Problem	Language	Result	Execution time	Memory
710542		baojiaopisu	Gap (APIO16_gap)	C++14	Compilation error	0 ms	0 KiB

gap

#Include "gap.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

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

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

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

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

void MinMax(ll s, ll t, ll &mn, ll &mx) {
	cout << s << " " << t << endl;
	cin >> mn >> mx;
}

ll findGap(int n) {
	ll a, b;
	MinMax(0, INF, &a, &b);
	ll d = (b - a - 1) / (n - 1);
	ll c = (b - a - 1) % n;
	ll l = a + 1;
	ll ans = 0, last = a;
	for(int i = 1; i <= n; i++) {
		ll r = l + d + (i <= c) - 1;
		ll s, t;
		MinMax(l, r, &s, &t);
		if(s == -1) continue;
		maximize(ans, s - last);
		last = t;
		l = r + 1;
	}

	maximize(ans, b - last);
	return ans;
};

Compilation message (stderr)

gap.cpp:1:2: error: invalid preprocessing directive #Include; did you mean #include?
    1 | #Include "gap.h"
      |  ^~~~~~~
      |  include
gap.cpp: In function 'll findGap(int)':
gap.cpp:80:17: error: invalid conversion from 'll*' {aka 'long long int*'} to 'll' {aka 'long long int'} [-fpermissive]
   80 |  MinMax(0, INF, &a, &b);
      |                 ^~
      |                 |
      |                 ll* {aka long long int*}
gap.cpp:73:29: note:   initializing argument 3 of 'void MinMax(ll, ll, ll&, ll&)'
   73 | void MinMax(ll s, ll t, ll &mn, ll &mx) {
      |                         ~~~~^~
gap.cpp:80:17: error: cannot bind rvalue '(ll)(& a)' to 'll&' {aka 'long long int&'}
   80 |  MinMax(0, INF, &a, &b);
      |                 ^~
gap.cpp:88:16: error: invalid conversion from 'll*' {aka 'long long int*'} to 'll' {aka 'long long int'} [-fpermissive]
   88 |   MinMax(l, r, &s, &t);
      |                ^~
      |                |
      |                ll* {aka long long int*}
gap.cpp:73:29: note:   initializing argument 3 of 'void MinMax(ll, ll, ll&, ll&)'
   73 | void MinMax(ll s, ll t, ll &mn, ll &mx) {
      |                         ~~~~^~
gap.cpp:88:16: error: cannot bind rvalue '(ll)(& s)' to 'll&' {aka 'long long int&'}
   88 |   MinMax(l, r, &s, &t);
      |                ^~