oj.uz

Submission #129882

# Submission time Handle Problem Language Result Execution time Memory
129882 2019-07-13T12:45:16 Z nikolapesic2802 Gap (APIO16_gap) C++14
100 / 100
 79 ms 3644 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

void MinMax(ll s,ll t,ll *mn,ll *mx);

ll findGap(int t,int n)
{
    if(t==1)
    {
        vector<ll> q;
        ll l=0,r=1e18;
        ll a,b;
        for(int i=0;i<(n+1)/2;i++)
        {
            MinMax(l,r,&a,&b);
            q.pb(a);
            q.pb(b);
            l=a+1;
            r=b-1;
        }
        sort(all(q));
        ll sol=0;
        for(int i=0;i<(int)q.size()-1;i++)
            sol=max(sol,q[i+1]-q[i]);
        return sol;
    }
    else
    {
        ll l,r;
        MinMax(0,(ll)1e18,&l,&r); ///n+1
        ll deo=(r-l+1-n)/(n-1);
        if((r-l+1-n)%(n-1))
            deo++;
        vector<ll> arr={l,r};
        l++;
        r--;
        for(int i=0;i<n-1;i++)
        {
            ll le=l+(deo+1)*i,ri=min(r,l+(deo+1)*(i+1)-1);
            if(le>ri)
                continue;
            ll a,b;
            MinMax(le,ri,&a,&b);
            if(a!=-1)
                arr.pb(a);
            if(a!=-1)
                arr.pb(b);
        }
        sort(all(arr));
        ll sol=0;
        for(int i=0;i<(int)arr.size()-1;i++)
            sol=max(sol,arr[i+1]-arr[i]);
        return sol;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 18 ms 888 KB Output is correct
17 Correct 17 ms 888 KB Output is correct
18 Correct 17 ms 888 KB Output is correct
19 Correct 16 ms 888 KB Output is correct
20 Correct 14 ms 992 KB Output is correct
21 Correct 61 ms 2412 KB Output is correct
22 Correct 60 ms 2288 KB Output is correct
23 Correct 60 ms 2288 KB Output is correct
24 Correct 61 ms 2288 KB Output is correct
25 Correct 52 ms 2320 KB Output is correct
26 Correct 62 ms 2288 KB Output is correct
27 Correct 61 ms 2316 KB Output is correct
28 Correct 62 ms 2292 KB Output is correct
29 Correct 60 ms 2256 KB Output is correct
30 Correct 46 ms 2288 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 20 ms 888 KB Output is correct
17 Correct 21 ms 1016 KB Output is correct
18 Correct 22 ms 1016 KB Output is correct
19 Correct 22 ms 1016 KB Output is correct
20 Correct 10 ms 504 KB Output is correct
21 Correct 79 ms 2252 KB Output is correct
22 Correct 78 ms 2268 KB Output is correct
23 Correct 79 ms 2256 KB Output is correct
24 Correct 78 ms 2288 KB Output is correct
25 Correct 75 ms 3644 KB Output is correct
26 Correct 79 ms 2308 KB Output is correct
27 Correct 78 ms 2288 KB Output is correct
28 Correct 79 ms 2288 KB Output is correct
29 Correct 79 ms 2208 KB Output is correct
30 Correct 41 ms 1528 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct