oj.uz

Submission #102137

# Submission time Handle Problem Language Result Execution time Memory
102137 2019-03-22T18:18:37 Z Benq Rope (JOI17_rope) C++14
100 / 100
 2199 ms 89940 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 = 1<<20;
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;

template<class T, int SZ> struct Seg {
    T seg[2*SZ], MN = 0;
    
    Seg() {
        memset(seg,0,sizeof seg);
    }
    
    T comb(T a, T b) { return max(a,b); } // easily change this to min or max
    
    void upd(int p, T value) {  // set value at position p
        for (seg[p += SZ] += value; p > 1; p >>= 1)
            seg[p>>1] = comb(seg[(p|1)^1],seg[p|1]); // non-commutative operations
    }
    
    void build() {
        F0Rd(i,SZ) seg[i] = comb(seg[2*i],seg[2*i+1]);
    }
    
    T query(int l, int r) {  // sum on interval [l, r]
        T res1 = MN, res2 = MN; r++;
        for (l += SZ, r += SZ; l < r; l >>= 1, r >>= 1) {
            if (l&1) res1 = comb(res1,seg[l++]);
            if (r&1) res2 = comb(seg[--r],res2);
        }
        return comb(res1,res2);
    }
};

Seg<int,MX> S;
int N,M,ans[MX],co[MX];
vi v;
vi bad[MX];

void solve0() {
    FOR(i,1,M+1) bad[i].clear();
    for (int i = 0; i+1 < N; i += 2) if (v[i] != v[i+1]) {
        bad[v[i]].pb(v[i+1]);
        bad[v[i+1]].pb(v[i]);
    }
    FOR(i,1,M+1) {
        S.upd(i,-co[i]);
        trav(t,bad[i]) S.upd(t,-1);
        ckmax(ans[i],co[i]+S.seg[1]);
        trav(t,bad[i]) S.upd(t,1);
        S.upd(i,co[i]);
    }
    // ps(ans[3]);
}

void solve1() {
    FOR(i,1,M+1) bad[i].clear();
    for (int i = 1; i+1 < N; i += 2) if (v[i] != v[i+1]) {
        bad[v[i]].pb(v[i+1]);
        bad[v[i+1]].pb(v[i]);
    }
    FOR(i,1,M+1) {
        S.upd(i,-co[i]);
        trav(t,bad[i]) S.upd(t,-1);
        ckmax(ans[i],co[i]+S.seg[1]);
        trav(t,bad[i]) S.upd(t,1);
        S.upd(i,co[i]);
    }
    // ps(ans[3]);
}

int main() {
    setIO(); re(N,M); v.resz(N); re(v);
    trav(i,v) {
        S.upd(i,1);
        co[i] ++;
    }
    solve0(); solve1();
    FOR(i,1,M+1) cout << N-ans[i] << "\n";
}

/* 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

rope.cpp: In function 'void io::setIn(std::__cxx11::string)':
rope.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); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
rope.cpp: In function 'void io::setOut(std::__cxx11::string)':
rope.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
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 33272 KB Output is correct
2 Correct 34 ms 33272 KB Output is correct
3 Correct 38 ms 33144 KB Output is correct
4 Correct 35 ms 33276 KB Output is correct
5 Correct 39 ms 33144 KB Output is correct
6 Correct 41 ms 33152 KB Output is correct
7 Correct 35 ms 33144 KB Output is correct
8 Correct 40 ms 33264 KB Output is correct
9 Correct 33 ms 33144 KB Output is correct
10 Correct 40 ms 33144 KB Output is correct
11 Correct 37 ms 33224 KB Output is correct
12 Correct 33 ms 33152 KB Output is correct
13 Correct 40 ms 33144 KB Output is correct
14 Correct 34 ms 33144 KB Output is correct
15 Correct 37 ms 33144 KB Output is correct
16 Correct 35 ms 33144 KB Output is correct
17 Correct 33 ms 33144 KB Output is correct
18 Correct 34 ms 33152 KB Output is correct
19 Correct 62 ms 33144 KB Output is correct
20 Correct 37 ms 33116 KB Output is correct
21 Correct 35 ms 33144 KB Output is correct
22 Correct 36 ms 33216 KB Output is correct
23 Correct 37 ms 33144 KB Output is correct
24 Correct 32 ms 33116 KB Output is correct
25 Correct 44 ms 33144 KB Output is correct
26 Correct 32 ms 33144 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 33272 KB Output is correct
2 Correct 34 ms 33272 KB Output is correct
3 Correct 38 ms 33144 KB Output is correct
4 Correct 35 ms 33276 KB Output is correct
5 Correct 39 ms 33144 KB Output is correct
6 Correct 41 ms 33152 KB Output is correct
7 Correct 35 ms 33144 KB Output is correct
8 Correct 40 ms 33264 KB Output is correct
9 Correct 33 ms 33144 KB Output is correct
10 Correct 40 ms 33144 KB Output is correct
11 Correct 37 ms 33224 KB Output is correct
12 Correct 33 ms 33152 KB Output is correct
13 Correct 40 ms 33144 KB Output is correct
14 Correct 34 ms 33144 KB Output is correct
15 Correct 37 ms 33144 KB Output is correct
16 Correct 35 ms 33144 KB Output is correct
17 Correct 33 ms 33144 KB Output is correct
18 Correct 34 ms 33152 KB Output is correct
19 Correct 62 ms 33144 KB Output is correct
20 Correct 37 ms 33116 KB Output is correct
21 Correct 35 ms 33144 KB Output is correct
22 Correct 36 ms 33216 KB Output is correct
23 Correct 37 ms 33144 KB Output is correct
24 Correct 32 ms 33116 KB Output is correct
25 Correct 44 ms 33144 KB Output is correct
26 Correct 32 ms 33144 KB Output is correct
27 Correct 76 ms 34396 KB Output is correct
28 Correct 65 ms 34296 KB Output is correct
29 Correct 80 ms 34416 KB Output is correct
30 Correct 71 ms 34296 KB Output is correct
31 Correct 94 ms 34472 KB Output is correct
32 Correct 69 ms 34296 KB Output is correct
33 Correct 81 ms 34328 KB Output is correct
34 Correct 74 ms 34168 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 33272 KB Output is correct
2 Correct 34 ms 33272 KB Output is correct
3 Correct 38 ms 33144 KB Output is correct
4 Correct 35 ms 33276 KB Output is correct
5 Correct 39 ms 33144 KB Output is correct
6 Correct 41 ms 33152 KB Output is correct
7 Correct 35 ms 33144 KB Output is correct
8 Correct 40 ms 33264 KB Output is correct
9 Correct 33 ms 33144 KB Output is correct
10 Correct 40 ms 33144 KB Output is correct
11 Correct 37 ms 33224 KB Output is correct
12 Correct 33 ms 33152 KB Output is correct
13 Correct 40 ms 33144 KB Output is correct
14 Correct 34 ms 33144 KB Output is correct
15 Correct 37 ms 33144 KB Output is correct
16 Correct 35 ms 33144 KB Output is correct
17 Correct 33 ms 33144 KB Output is correct
18 Correct 34 ms 33152 KB Output is correct
19 Correct 62 ms 33144 KB Output is correct
20 Correct 37 ms 33116 KB Output is correct
21 Correct 35 ms 33144 KB Output is correct
22 Correct 36 ms 33216 KB Output is correct
23 Correct 37 ms 33144 KB Output is correct
24 Correct 32 ms 33116 KB Output is correct
25 Correct 44 ms 33144 KB Output is correct
26 Correct 32 ms 33144 KB Output is correct
27 Correct 76 ms 34396 KB Output is correct
28 Correct 65 ms 34296 KB Output is correct
29 Correct 80 ms 34416 KB Output is correct
30 Correct 71 ms 34296 KB Output is correct
31 Correct 94 ms 34472 KB Output is correct
32 Correct 69 ms 34296 KB Output is correct
33 Correct 81 ms 34328 KB Output is correct
34 Correct 74 ms 34168 KB Output is correct
35 Correct 68 ms 34588 KB Output is correct
36 Correct 84 ms 34552 KB Output is correct
37 Correct 72 ms 34560 KB Output is correct
38 Correct 68 ms 34468 KB Output is correct
39 Correct 80 ms 34680 KB Output is correct
40 Correct 68 ms 34680 KB Output is correct
41 Correct 87 ms 34552 KB Output is correct
42 Correct 71 ms 34552 KB Output is correct
43 Correct 77 ms 34756 KB Output is correct
44 Correct 72 ms 34680 KB Output is correct
45 Correct 77 ms 34680 KB Output is correct
46 Correct 96 ms 34556 KB Output is correct
47 Correct 75 ms 34652 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 33272 KB Output is correct
2 Correct 34 ms 33272 KB Output is correct
3 Correct 38 ms 33144 KB Output is correct
4 Correct 35 ms 33276 KB Output is correct
5 Correct 39 ms 33144 KB Output is correct
6 Correct 41 ms 33152 KB Output is correct
7 Correct 35 ms 33144 KB Output is correct
8 Correct 40 ms 33264 KB Output is correct
9 Correct 33 ms 33144 KB Output is correct
10 Correct 40 ms 33144 KB Output is correct
11 Correct 37 ms 33224 KB Output is correct
12 Correct 33 ms 33152 KB Output is correct
13 Correct 40 ms 33144 KB Output is correct
14 Correct 34 ms 33144 KB Output is correct
15 Correct 37 ms 33144 KB Output is correct
16 Correct 35 ms 33144 KB Output is correct
17 Correct 33 ms 33144 KB Output is correct
18 Correct 34 ms 33152 KB Output is correct
19 Correct 62 ms 33144 KB Output is correct
20 Correct 37 ms 33116 KB Output is correct
21 Correct 35 ms 33144 KB Output is correct
22 Correct 36 ms 33216 KB Output is correct
23 Correct 37 ms 33144 KB Output is correct
24 Correct 32 ms 33116 KB Output is correct
25 Correct 44 ms 33144 KB Output is correct
26 Correct 32 ms 33144 KB Output is correct
27 Correct 76 ms 34396 KB Output is correct
28 Correct 65 ms 34296 KB Output is correct
29 Correct 80 ms 34416 KB Output is correct
30 Correct 71 ms 34296 KB Output is correct
31 Correct 94 ms 34472 KB Output is correct
32 Correct 69 ms 34296 KB Output is correct
33 Correct 81 ms 34328 KB Output is correct
34 Correct 74 ms 34168 KB Output is correct
35 Correct 68 ms 34588 KB Output is correct
36 Correct 84 ms 34552 KB Output is correct
37 Correct 72 ms 34560 KB Output is correct
38 Correct 68 ms 34468 KB Output is correct
39 Correct 80 ms 34680 KB Output is correct
40 Correct 68 ms 34680 KB Output is correct
41 Correct 87 ms 34552 KB Output is correct
42 Correct 71 ms 34552 KB Output is correct
43 Correct 77 ms 34756 KB Output is correct
44 Correct 72 ms 34680 KB Output is correct
45 Correct 77 ms 34680 KB Output is correct
46 Correct 96 ms 34556 KB Output is correct
47 Correct 75 ms 34652 KB Output is correct
48 Correct 486 ms 48368 KB Output is correct
49 Correct 452 ms 48344 KB Output is correct
50 Correct 448 ms 48376 KB Output is correct
51 Correct 399 ms 47992 KB Output is correct
52 Correct 405 ms 46552 KB Output is correct
53 Correct 416 ms 47644 KB Output is correct
54 Correct 434 ms 46560 KB Output is correct
55 Correct 424 ms 46328 KB Output is correct
56 Correct 472 ms 46328 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 33272 KB Output is correct
2 Correct 34 ms 33272 KB Output is correct
3 Correct 38 ms 33144 KB Output is correct
4 Correct 35 ms 33276 KB Output is correct
5 Correct 39 ms 33144 KB Output is correct
6 Correct 41 ms 33152 KB Output is correct
7 Correct 35 ms 33144 KB Output is correct
8 Correct 40 ms 33264 KB Output is correct
9 Correct 33 ms 33144 KB Output is correct
10 Correct 40 ms 33144 KB Output is correct
11 Correct 37 ms 33224 KB Output is correct
12 Correct 33 ms 33152 KB Output is correct
13 Correct 40 ms 33144 KB Output is correct
14 Correct 34 ms 33144 KB Output is correct
15 Correct 37 ms 33144 KB Output is correct
16 Correct 35 ms 33144 KB Output is correct
17 Correct 33 ms 33144 KB Output is correct
18 Correct 34 ms 33152 KB Output is correct
19 Correct 62 ms 33144 KB Output is correct
20 Correct 37 ms 33116 KB Output is correct
21 Correct 35 ms 33144 KB Output is correct
22 Correct 36 ms 33216 KB Output is correct
23 Correct 37 ms 33144 KB Output is correct
24 Correct 32 ms 33116 KB Output is correct
25 Correct 44 ms 33144 KB Output is correct
26 Correct 32 ms 33144 KB Output is correct
27 Correct 76 ms 34396 KB Output is correct
28 Correct 65 ms 34296 KB Output is correct
29 Correct 80 ms 34416 KB Output is correct
30 Correct 71 ms 34296 KB Output is correct
31 Correct 94 ms 34472 KB Output is correct
32 Correct 69 ms 34296 KB Output is correct
33 Correct 81 ms 34328 KB Output is correct
34 Correct 74 ms 34168 KB Output is correct
35 Correct 68 ms 34588 KB Output is correct
36 Correct 84 ms 34552 KB Output is correct
37 Correct 72 ms 34560 KB Output is correct
38 Correct 68 ms 34468 KB Output is correct
39 Correct 80 ms 34680 KB Output is correct
40 Correct 68 ms 34680 KB Output is correct
41 Correct 87 ms 34552 KB Output is correct
42 Correct 71 ms 34552 KB Output is correct
43 Correct 77 ms 34756 KB Output is correct
44 Correct 72 ms 34680 KB Output is correct
45 Correct 77 ms 34680 KB Output is correct
46 Correct 96 ms 34556 KB Output is correct
47 Correct 75 ms 34652 KB Output is correct
48 Correct 486 ms 48368 KB Output is correct
49 Correct 452 ms 48344 KB Output is correct
50 Correct 448 ms 48376 KB Output is correct
51 Correct 399 ms 47992 KB Output is correct
52 Correct 405 ms 46552 KB Output is correct
53 Correct 416 ms 47644 KB Output is correct
54 Correct 434 ms 46560 KB Output is correct
55 Correct 424 ms 46328 KB Output is correct
56 Correct 472 ms 46328 KB Output is correct
57 Correct 2199 ms 89940 KB Output is correct
58 Correct 1857 ms 71548 KB Output is correct
59 Correct 1822 ms 71404 KB Output is correct
60 Correct 2054 ms 76144 KB Output is correct
61 Correct 1980 ms 76060 KB Output is correct
62 Correct 866 ms 60552 KB Output is correct
63 Correct 1172 ms 65764 KB Output is correct
64 Correct 1038 ms 62500 KB Output is correct
65 Correct 603 ms 54324 KB Output is correct