oj.uz

Submission #102407

# Submission time Handle Problem Language Result Execution time Memory
102407 2019-03-24T17:32:22 Z Benq Cake 3 (JOI19_cake3) C++14
100 / 100
 2224 ms 19388 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;


int N,M, cl, cr = -1;
vl key;
vpi v;
ll ans = -INF;

pl operator+(const pl& l, const pl& r) {
    return {l.f+r.f,l.s+r.s};
}

template<int SZ> struct Seg {
    pl sum[2*SZ];
    void upd(int pos, int val, int ind = 1, int L = 0, int R = SZ-1) {
        if (L == R) {
            sum[ind] = sum[ind]+mp(val*key[pos],val);
            return;
        }
        int M = (L+R)/2;
        if (pos <= M) upd(pos,val,2*ind,L,M);
        else upd(pos,val,2*ind+1,M+1,R);
        sum[ind] = sum[2*ind]+sum[2*ind+1];
    }
    pl query(int des, int ind = 1, int L = 0, int R = SZ-1) { // get M best 
        if (sum[ind].s <= des) return sum[ind];
        if (L == R) {
            auto a = sum[ind];
            a.f /= a.s; a.s = des; a.f *= a.s;
            return a;
        }
        int M = (L+R)/2;
        auto a = query(des,2*ind+1,M+1,R);
        des -= a.s;
        if (des > 0) {
            a = a+query(des,2*ind,L,M);
        }
        return a;
    }
};

Seg<1<<18> S;

ll calc(int l, int r) {
    while (cl > l) S.upd(v[--cl].s,1);
    while (cr < r) S.upd(v[++cr].s,1);
    while (cl < l) S.upd(v[cl++].s,-1);
    while (cr > r) S.upd(v[cr--].s,-1);
    ll ret = -2*(v[r].f-v[l].f);
    ret += S.query(M).f;
    return ret;
}

void divi(int lo, int hi, int L, int R) {
    if (lo > hi) return;
    int mid = (lo+hi)/2;
    pl bes = {-INF,-INF};
    FOR(i,max(mid+M-1,L),R+1) ckmax(bes,{calc(mid,i),i});
    /*if (bes.f == -INF) {
        ps("WHAT",bes,lo,hi,M,L,R);
        exit(0);
    }*/
    ckmax(ans,bes.f);
    divi(lo,mid-1,L,bes.s);
    divi(mid+1,hi,bes.s,R);
}

int main() {
    setIO(); re(N,M); v.resz(N); 
    
    re(v);
    // F0R(i,N) v[i].f = rand() % MOD, v[i].s = rand() % MOD;
    F0R(i,N) swap(v[i].f,v[i].s);
    map<int,int> m; trav(t,v) m[t.s] = 0;
    int co = 0; 
    trav(t,m) {
        t.s = co++;
        key.pb(t.f);
    }
    trav(t,v) t.s = m[t.s];
    sort(all(v));
    divi(0,N-M,0,N-1);
    ps(ans);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

cake3.cpp: In function 'void io::setIn(std::__cxx11::string)':
cake3.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
cake3.cpp: In function 'void io::setOut(std::__cxx11::string)':
cake3.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 10 ms 644 KB Output is correct
39 Correct 8 ms 640 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 8 ms 640 KB Output is correct
42 Correct 6 ms 640 KB Output is correct
43 Correct 5 ms 640 KB Output is correct
44 Correct 10 ms 652 KB Output is correct
45 Correct 9 ms 640 KB Output is correct
46 Correct 10 ms 640 KB Output is correct
47 Correct 10 ms 640 KB Output is correct
48 Correct 10 ms 636 KB Output is correct
49 Correct 10 ms 640 KB Output is correct
50 Correct 9 ms 640 KB Output is correct
51 Correct 7 ms 640 KB Output is correct
52 Correct 7 ms 640 KB Output is correct
53 Correct 7 ms 640 KB Output is correct
54 Correct 6 ms 640 KB Output is correct
55 Correct 6 ms 612 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 7 ms 640 KB Output is correct
58 Correct 7 ms 640 KB Output is correct
59 Correct 8 ms 384 KB Output is correct
60 Correct 8 ms 384 KB Output is correct
61 Correct 7 ms 384 KB Output is correct
62 Correct 6 ms 384 KB Output is correct
63 Correct 6 ms 384 KB Output is correct
64 Correct 9 ms 384 KB Output is correct
65 Correct 9 ms 640 KB Output is correct
66 Correct 7 ms 640 KB Output is correct
67 Correct 8 ms 640 KB Output is correct
68 Correct 8 ms 640 KB Output is correct
69 Correct 8 ms 640 KB Output is correct
70 Correct 7 ms 636 KB Output is correct
71 Correct 6 ms 384 KB Output is correct
72 Correct 5 ms 384 KB Output is correct
73 Correct 8 ms 612 KB Output is correct
74 Correct 3 ms 640 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 10 ms 644 KB Output is correct
39 Correct 8 ms 640 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 8 ms 640 KB Output is correct
42 Correct 6 ms 640 KB Output is correct
43 Correct 5 ms 640 KB Output is correct
44 Correct 10 ms 652 KB Output is correct
45 Correct 9 ms 640 KB Output is correct
46 Correct 10 ms 640 KB Output is correct
47 Correct 10 ms 640 KB Output is correct
48 Correct 10 ms 636 KB Output is correct
49 Correct 10 ms 640 KB Output is correct
50 Correct 9 ms 640 KB Output is correct
51 Correct 7 ms 640 KB Output is correct
52 Correct 7 ms 640 KB Output is correct
53 Correct 7 ms 640 KB Output is correct
54 Correct 6 ms 640 KB Output is correct
55 Correct 6 ms 612 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 7 ms 640 KB Output is correct
58 Correct 7 ms 640 KB Output is correct
59 Correct 8 ms 384 KB Output is correct
60 Correct 8 ms 384 KB Output is correct
61 Correct 7 ms 384 KB Output is correct
62 Correct 6 ms 384 KB Output is correct
63 Correct 6 ms 384 KB Output is correct
64 Correct 9 ms 384 KB Output is correct
65 Correct 9 ms 640 KB Output is correct
66 Correct 7 ms 640 KB Output is correct
67 Correct 8 ms 640 KB Output is correct
68 Correct 8 ms 640 KB Output is correct
69 Correct 8 ms 640 KB Output is correct
70 Correct 7 ms 636 KB Output is correct
71 Correct 6 ms 384 KB Output is correct
72 Correct 5 ms 384 KB Output is correct
73 Correct 8 ms 612 KB Output is correct
74 Correct 3 ms 640 KB Output is correct
75 Correct 1997 ms 17976 KB Output is correct
76 Correct 2224 ms 17544 KB Output is correct
77 Correct 1878 ms 18128 KB Output is correct
78 Correct 1904 ms 18392 KB Output is correct
79 Correct 441 ms 18440 KB Output is correct
80 Correct 501 ms 17872 KB Output is correct
81 Correct 1054 ms 4448 KB Output is correct
82 Correct 1453 ms 5968 KB Output is correct
83 Correct 1480 ms 4760 KB Output is correct
84 Correct 1690 ms 5076 KB Output is correct
85 Correct 1221 ms 4512 KB Output is correct
86 Correct 672 ms 3664 KB Output is correct
87 Correct 744 ms 3780 KB Output is correct
88 Correct 1063 ms 4340 KB Output is correct
89 Correct 1045 ms 4008 KB Output is correct
90 Correct 720 ms 3632 KB Output is correct
91 Correct 403 ms 3348 KB Output is correct
92 Correct 457 ms 3332 KB Output is correct
93 Correct 512 ms 3440 KB Output is correct
94 Correct 392 ms 3244 KB Output is correct
95 Correct 624 ms 3580 KB Output is correct
96 Correct 791 ms 1792 KB Output is correct
97 Correct 893 ms 1920 KB Output is correct
98 Correct 846 ms 1920 KB Output is correct
99 Correct 748 ms 1920 KB Output is correct
100 Correct 583 ms 1792 KB Output is correct
101 Correct 619 ms 1904 KB Output is correct
102 Correct 824 ms 2148 KB Output is correct
103 Correct 828 ms 2168 KB Output is correct
104 Correct 912 ms 2400 KB Output is correct
105 Correct 664 ms 2140 KB Output is correct
106 Correct 786 ms 2168 KB Output is correct
107 Correct 587 ms 2040 KB Output is correct
108 Correct 1627 ms 18368 KB Output is correct
109 Correct 1384 ms 19308 KB Output is correct
110 Correct 525 ms 1884 KB Output is correct
111 Correct 695 ms 1920 KB Output is correct
112 Correct 990 ms 17664 KB Output is correct
113 Correct 475 ms 19388 KB Output is correct