oj.uz

Submission #307012

# Submission time Handle Problem Language Result Execution time Memory
307012 2020-09-26T18:37:03 Z MarcoMeijer Gap (APIO16_gap) C++14
100 / 100
 87 ms 2432 KB 
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//   begin program   //
//===================//
 
const int MX = 1e5+2;

ll findGap(int T, int N) {
    vll a;
    ll lb=0, ub=1e18;
    if(T == 1 || N <= 6) {
        while(1) {
            ll mn, mx;
            MinMax(lb,ub,&mn,&mx);
            if(mn == -1) break;
            a.pb(mn);
            if(mx != mn) a.pb(mx);
            lb = mn+1, ub=mx-1;
            if(ub < lb) break;
            if(a.size() == N) break;
        }
        sort(all(a));
        ll ans = 0;
        RE(i,N-1) ans = max(ans, a[i+1]-a[i]);
        return ans;
    } else {
        MinMax(0,1e18,&lb,&ub);
        if(N == 2) return ub-lb;

        ll stepSize = (ub-lb-2)/(N-2);

        a.pb(lb); a.pb(ub);
        for(ll x=lb+1; x<ub; x+=stepSize+1) {
            ll mn, mx;
            MinMax(x,x+stepSize,&mn,&mx);
            if(mn == -1) continue;
            a.pb(mn);
            if(mn != mx) a.pb(mx);
        }

        sort(all(a));
        ll ans = 0;
        RE(i,a.size()-1) ans = max(ans, a[i+1]-a[i]);
        return ans;
    }
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:65:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |             if(a.size() == N) break;
      |                ~~~~~~~~~^~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 14 ms 896 KB Output is correct
17 Correct 17 ms 896 KB Output is correct
18 Correct 14 ms 896 KB Output is correct
19 Correct 14 ms 896 KB Output is correct
20 Correct 10 ms 896 KB Output is correct
21 Correct 64 ms 2288 KB Output is correct
22 Correct 56 ms 2288 KB Output is correct
23 Correct 60 ms 2356 KB Output is correct
24 Correct 55 ms 2288 KB Output is correct
25 Correct 55 ms 2292 KB Output is correct
26 Correct 60 ms 2288 KB Output is correct
27 Correct 58 ms 2288 KB Output is correct
28 Correct 57 ms 2288 KB Output is correct
29 Correct 58 ms 2288 KB Output is correct
30 Correct 46 ms 2288 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 19 ms 896 KB Output is correct
17 Correct 20 ms 896 KB Output is correct
18 Correct 21 ms 896 KB Output is correct
19 Correct 17 ms 896 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 73 ms 2288 KB Output is correct
22 Correct 72 ms 2360 KB Output is correct
23 Correct 71 ms 2432 KB Output is correct
24 Correct 74 ms 2224 KB Output is correct
25 Correct 66 ms 2288 KB Output is correct
26 Correct 76 ms 2236 KB Output is correct
27 Correct 69 ms 2288 KB Output is correct
28 Correct 87 ms 2316 KB Output is correct
29 Correct 72 ms 2248 KB Output is correct
30 Correct 35 ms 1528 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct