Submission #656711

#	Time	Username	Problem	Language	Result	Execution time	Memory
656711		Ronin13	Gap (APIO16_gap)	C++14	0 / 100	67 ms	2636 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;



long long findGap(int T, int N){

    ll n = N;
    if(T == 1){
        ll l = 0, r = 1e18;
        ll mn, mx;
        vector <ll> a, b;
        while(l < r){
            MinMax(l, r, &mn, &mx);
            if(mn == -1 || mx == -1) break;
            a.pb(mn);
            b.pb(mx);
            l = mn + 1;
            r = mx - 1;
        }

        reverse(b.begin(), b.end());
        for(ll to : b) a.pb(to);
        ll ans = 0;
        for(int i = 1; i < a.size(); i++) ans = max(ans, a[i] - a[i - 1]);
        return ans;
    }
    ll l, r;
    l = 0, r = 1e18;
    vector <ll> vec;
    ll mn, mx;
    MinMax(l, r, &mn, &mx);
    vec.pb(mn);
    ll v = mn;
    ll d = mx - mn;
    d /= (n - 1);
    l = mn;
    for(int i = 1; i <= n; i++){
        ll L = l + d;
        MinMax(l + 1, l + d + 1, &mn, &mx);
        l = max(L, mx + 1);
        if(mn != -1) vec.pb(mn);
        if(mn != mx)
        if(mx != -1) vec.pb(mx);
    }
    for(ll to : vec) cout << to << ' ';
    ll ans = 0;
    for(int i = 1; i < vec.size(); i++) ans = max(ans, vec[i] - vec[i - 1]);
    return ans;
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:34:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(int i = 1; i < a.size(); i++) ans = max(ans, a[i] - a[i - 1]);
      |                        ~~^~~~~~~~~~
gap.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i = 1; i < vec.size(); i++) ans = max(ans, vec[i] - vec[i - 1]);
      |                    ~~^~~~~~~~~~~~
gap.cpp:43:8: warning: unused variable 'v' [-Wunused-variable]
   43 |     ll v = mn;
      |        ^

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