oj.uz

Submission #46741

# Submission time Handle Problem Language Result Execution time Memory
46741 2018-04-22T16:20:33 Z qoo2p5 Rope (JOI17_rope) C++14
80 / 100
 2500 ms 76844 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define mp make_pair
#define pb push_back

bool mini(auto &x, const auto &y) {
    if (y < x) {
        x = y;
        return 1;
    }
    return 0;
}

bool maxi(auto &x, const auto &y) {
    if (y > x) {
        x = y;
        return 1;
    }
    return 0;
}

void run();

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    run();
    return 0;
}

const int N = 1 << 20;

int n, m;
int a[N];
int tree[2 * N + 239];
int cnt_full[N + 239];
vector<int> match[N + 239];

void clr() {
    memset(tree, 0, sizeof tree);
    memset(cnt_full, 0, sizeof cnt_full);
    rep(i, 0, m) {
        match[i].clear();
    }
}

void add(int i, int tl, int tr, int ind, int val) {
    if (tl == tr - 1) {
        tree[i] += val;
        return;
    }
    int tm = (tl + tr) / 2;
    if (ind < tm) add(2 * i + 1, tl, tm, ind, val);
    else add(2 * i + 2, tm, tr, ind, val);
    tree[i] = max(tree[2 * i + 1], tree[2 * i + 2]);
}

void add(int ind, int val) {
    add(0, 0, N, ind, val);
}

int get(int i, int tl, int tr, int l, int r) {
    if (tl >= r || tr <= l) {
        return -INF;
    }
    if (l <= tl && tr <= r) {
        return tree[i];
    }
    int tm = (tl + tr) / 2;
    return max(get(2 * i + 1, tl, tm, l, r), get(2 * i + 2, tm, tr, l, r));
}

int get(int l, int r) {
    return get(0, 0, N, l, r + 1);
}

int ans[N];

void run() {
    cin >> n >> m;
    if (m == 1) {
        cout << "0\n";
        return;
    }
    rep(i, 0, n) {
        cin >> a[i];
        a[i]--;
    }
    rep(i, 0, m) {
        ans[i] = INF;
    }
    
    int qq = 0;
    
    rep(odd_l, 0, 2) {
        rep(odd_r, 0, 2) {
            if ((odd_l + odd_r) % 2 != n % 2) {
                continue;
            }
            
            clr();
            qq++;
            
            for (int i = odd_l; i < n - odd_r; i += 2) {
                if (a[i] != a[i + 1]) {
                    match[a[i]].pb(a[i + 1]);
                    match[a[i + 1]].pb(a[i]);
                } else {
                    cnt_full[a[i]]++;
                }
            }
            
            rep(i, 0, m) {
                tree[N - 1 + i] = sz(match[i]) + 2 * cnt_full[i] + (odd_l && a[0] == i) + (odd_r && a[n - 1] == i);
            }
            
            per(i, N - 2, 0) {
                tree[i] = max(tree[2 * i + 1], tree[2 * i + 2]);
            }
            
            rep(i, 0, m) {
                int bonus = (odd_l && a[0] == i) + (odd_r && a[n - 1] == i);
                int we = bonus + cnt_full[i] * 2;
                int simple = 0;
                for (int j : match[i]) {
                    add(j, -1);
                    we++;
                    simple++;
                }
                
                int other = max(get(0, i - 1), get(i + 1, m - 1));
                assert(other >= 0);
                
                if (other == 0) {
                    if (simple > 0) {
                        we--;
                        other++;
                    } else if (bonus > 0) {
                        we--;
                        other++;
                    } else {
                        //~ assert(false);
                    }
                }
                
                mini(ans[i], n - (we + other));
                
                for (int j : match[i]) {
                    add(j, 1);
                }
            }
        }
    }
    
    assert(qq <= 2);
    
    rep(i, 0, m) {
        cout << ans[i] << "\n";
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 37240 KB Output is correct
2 Correct 34 ms 37348 KB Output is correct
3 Correct 36 ms 37632 KB Output is correct
4 Correct 34 ms 37632 KB Output is correct
5 Correct 34 ms 37632 KB Output is correct
6 Correct 36 ms 37632 KB Output is correct
7 Correct 36 ms 37632 KB Output is correct
8 Correct 36 ms 37632 KB Output is correct
9 Correct 37 ms 37632 KB Output is correct
10 Correct 35 ms 37632 KB Output is correct
11 Correct 45 ms 37632 KB Output is correct
12 Correct 35 ms 37632 KB Output is correct
13 Correct 34 ms 37632 KB Output is correct
14 Correct 45 ms 37632 KB Output is correct
15 Correct 35 ms 37632 KB Output is correct
16 Correct 38 ms 37632 KB Output is correct
17 Correct 39 ms 37632 KB Output is correct
18 Correct 36 ms 37632 KB Output is correct
19 Correct 37 ms 37632 KB Output is correct
20 Correct 39 ms 37632 KB Output is correct
21 Correct 36 ms 37632 KB Output is correct
22 Correct 27 ms 37632 KB Output is correct
23 Correct 38 ms 37632 KB Output is correct
24 Correct 37 ms 37632 KB Output is correct
25 Correct 37 ms 37632 KB Output is correct
26 Correct 23 ms 37632 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 37240 KB Output is correct
2 Correct 34 ms 37348 KB Output is correct
3 Correct 36 ms 37632 KB Output is correct
4 Correct 34 ms 37632 KB Output is correct
5 Correct 34 ms 37632 KB Output is correct
6 Correct 36 ms 37632 KB Output is correct
7 Correct 36 ms 37632 KB Output is correct
8 Correct 36 ms 37632 KB Output is correct
9 Correct 37 ms 37632 KB Output is correct
10 Correct 35 ms 37632 KB Output is correct
11 Correct 45 ms 37632 KB Output is correct
12 Correct 35 ms 37632 KB Output is correct
13 Correct 34 ms 37632 KB Output is correct
14 Correct 45 ms 37632 KB Output is correct
15 Correct 35 ms 37632 KB Output is correct
16 Correct 38 ms 37632 KB Output is correct
17 Correct 39 ms 37632 KB Output is correct
18 Correct 36 ms 37632 KB Output is correct
19 Correct 37 ms 37632 KB Output is correct
20 Correct 39 ms 37632 KB Output is correct
21 Correct 36 ms 37632 KB Output is correct
22 Correct 27 ms 37632 KB Output is correct
23 Correct 38 ms 37632 KB Output is correct
24 Correct 37 ms 37632 KB Output is correct
25 Correct 37 ms 37632 KB Output is correct
26 Correct 23 ms 37632 KB Output is correct
27 Correct 97 ms 38528 KB Output is correct
28 Correct 85 ms 38528 KB Output is correct
29 Correct 106 ms 38528 KB Output is correct
30 Correct 95 ms 38528 KB Output is correct
31 Correct 127 ms 38528 KB Output is correct
32 Correct 87 ms 38528 KB Output is correct
33 Correct 94 ms 38528 KB Output is correct
34 Correct 103 ms 38528 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 37240 KB Output is correct
2 Correct 34 ms 37348 KB Output is correct
3 Correct 36 ms 37632 KB Output is correct
4 Correct 34 ms 37632 KB Output is correct
5 Correct 34 ms 37632 KB Output is correct
6 Correct 36 ms 37632 KB Output is correct
7 Correct 36 ms 37632 KB Output is correct
8 Correct 36 ms 37632 KB Output is correct
9 Correct 37 ms 37632 KB Output is correct
10 Correct 35 ms 37632 KB Output is correct
11 Correct 45 ms 37632 KB Output is correct
12 Correct 35 ms 37632 KB Output is correct
13 Correct 34 ms 37632 KB Output is correct
14 Correct 45 ms 37632 KB Output is correct
15 Correct 35 ms 37632 KB Output is correct
16 Correct 38 ms 37632 KB Output is correct
17 Correct 39 ms 37632 KB Output is correct
18 Correct 36 ms 37632 KB Output is correct
19 Correct 37 ms 37632 KB Output is correct
20 Correct 39 ms 37632 KB Output is correct
21 Correct 36 ms 37632 KB Output is correct
22 Correct 27 ms 37632 KB Output is correct
23 Correct 38 ms 37632 KB Output is correct
24 Correct 37 ms 37632 KB Output is correct
25 Correct 37 ms 37632 KB Output is correct
26 Correct 23 ms 37632 KB Output is correct
27 Correct 97 ms 38528 KB Output is correct
28 Correct 85 ms 38528 KB Output is correct
29 Correct 106 ms 38528 KB Output is correct
30 Correct 95 ms 38528 KB Output is correct
31 Correct 127 ms 38528 KB Output is correct
32 Correct 87 ms 38528 KB Output is correct
33 Correct 94 ms 38528 KB Output is correct
34 Correct 103 ms 38528 KB Output is correct
35 Correct 145 ms 38540 KB Output is correct
36 Correct 113 ms 38540 KB Output is correct
37 Correct 142 ms 38540 KB Output is correct
38 Correct 118 ms 38540 KB Output is correct
39 Correct 117 ms 38652 KB Output is correct
40 Correct 107 ms 38656 KB Output is correct
41 Correct 106 ms 38656 KB Output is correct
42 Correct 108 ms 38656 KB Output is correct
43 Correct 113 ms 38664 KB Output is correct
44 Correct 107 ms 38664 KB Output is correct
45 Correct 111 ms 38664 KB Output is correct
46 Correct 104 ms 38664 KB Output is correct
47 Correct 105 ms 38664 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 37240 KB Output is correct
2 Correct 34 ms 37348 KB Output is correct
3 Correct 36 ms 37632 KB Output is correct
4 Correct 34 ms 37632 KB Output is correct
5 Correct 34 ms 37632 KB Output is correct
6 Correct 36 ms 37632 KB Output is correct
7 Correct 36 ms 37632 KB Output is correct
8 Correct 36 ms 37632 KB Output is correct
9 Correct 37 ms 37632 KB Output is correct
10 Correct 35 ms 37632 KB Output is correct
11 Correct 45 ms 37632 KB Output is correct
12 Correct 35 ms 37632 KB Output is correct
13 Correct 34 ms 37632 KB Output is correct
14 Correct 45 ms 37632 KB Output is correct
15 Correct 35 ms 37632 KB Output is correct
16 Correct 38 ms 37632 KB Output is correct
17 Correct 39 ms 37632 KB Output is correct
18 Correct 36 ms 37632 KB Output is correct
19 Correct 37 ms 37632 KB Output is correct
20 Correct 39 ms 37632 KB Output is correct
21 Correct 36 ms 37632 KB Output is correct
22 Correct 27 ms 37632 KB Output is correct
23 Correct 38 ms 37632 KB Output is correct
24 Correct 37 ms 37632 KB Output is correct
25 Correct 37 ms 37632 KB Output is correct
26 Correct 23 ms 37632 KB Output is correct
27 Correct 97 ms 38528 KB Output is correct
28 Correct 85 ms 38528 KB Output is correct
29 Correct 106 ms 38528 KB Output is correct
30 Correct 95 ms 38528 KB Output is correct
31 Correct 127 ms 38528 KB Output is correct
32 Correct 87 ms 38528 KB Output is correct
33 Correct 94 ms 38528 KB Output is correct
34 Correct 103 ms 38528 KB Output is correct
35 Correct 145 ms 38540 KB Output is correct
36 Correct 113 ms 38540 KB Output is correct
37 Correct 142 ms 38540 KB Output is correct
38 Correct 118 ms 38540 KB Output is correct
39 Correct 117 ms 38652 KB Output is correct
40 Correct 107 ms 38656 KB Output is correct
41 Correct 106 ms 38656 KB Output is correct
42 Correct 108 ms 38656 KB Output is correct
43 Correct 113 ms 38664 KB Output is correct
44 Correct 107 ms 38664 KB Output is correct
45 Correct 111 ms 38664 KB Output is correct
46 Correct 104 ms 38664 KB Output is correct
47 Correct 105 ms 38664 KB Output is correct
48 Correct 871 ms 48120 KB Output is correct
49 Correct 851 ms 48124 KB Output is correct
50 Correct 855 ms 48152 KB Output is correct
51 Correct 869 ms 48152 KB Output is correct
52 Correct 795 ms 48152 KB Output is correct
53 Correct 810 ms 48152 KB Output is correct
54 Correct 799 ms 48152 KB Output is correct
55 Correct 792 ms 48152 KB Output is correct
56 Correct 821 ms 48152 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 37240 KB Output is correct
2 Correct 34 ms 37348 KB Output is correct
3 Correct 36 ms 37632 KB Output is correct
4 Correct 34 ms 37632 KB Output is correct
5 Correct 34 ms 37632 KB Output is correct
6 Correct 36 ms 37632 KB Output is correct
7 Correct 36 ms 37632 KB Output is correct
8 Correct 36 ms 37632 KB Output is correct
9 Correct 37 ms 37632 KB Output is correct
10 Correct 35 ms 37632 KB Output is correct
11 Correct 45 ms 37632 KB Output is correct
12 Correct 35 ms 37632 KB Output is correct
13 Correct 34 ms 37632 KB Output is correct
14 Correct 45 ms 37632 KB Output is correct
15 Correct 35 ms 37632 KB Output is correct
16 Correct 38 ms 37632 KB Output is correct
17 Correct 39 ms 37632 KB Output is correct
18 Correct 36 ms 37632 KB Output is correct
19 Correct 37 ms 37632 KB Output is correct
20 Correct 39 ms 37632 KB Output is correct
21 Correct 36 ms 37632 KB Output is correct
22 Correct 27 ms 37632 KB Output is correct
23 Correct 38 ms 37632 KB Output is correct
24 Correct 37 ms 37632 KB Output is correct
25 Correct 37 ms 37632 KB Output is correct
26 Correct 23 ms 37632 KB Output is correct
27 Correct 97 ms 38528 KB Output is correct
28 Correct 85 ms 38528 KB Output is correct
29 Correct 106 ms 38528 KB Output is correct
30 Correct 95 ms 38528 KB Output is correct
31 Correct 127 ms 38528 KB Output is correct
32 Correct 87 ms 38528 KB Output is correct
33 Correct 94 ms 38528 KB Output is correct
34 Correct 103 ms 38528 KB Output is correct
35 Correct 145 ms 38540 KB Output is correct
36 Correct 113 ms 38540 KB Output is correct
37 Correct 142 ms 38540 KB Output is correct
38 Correct 118 ms 38540 KB Output is correct
39 Correct 117 ms 38652 KB Output is correct
40 Correct 107 ms 38656 KB Output is correct
41 Correct 106 ms 38656 KB Output is correct
42 Correct 108 ms 38656 KB Output is correct
43 Correct 113 ms 38664 KB Output is correct
44 Correct 107 ms 38664 KB Output is correct
45 Correct 111 ms 38664 KB Output is correct
46 Correct 104 ms 38664 KB Output is correct
47 Correct 105 ms 38664 KB Output is correct
48 Correct 871 ms 48120 KB Output is correct
49 Correct 851 ms 48124 KB Output is correct
50 Correct 855 ms 48152 KB Output is correct
51 Correct 869 ms 48152 KB Output is correct
52 Correct 795 ms 48152 KB Output is correct
53 Correct 810 ms 48152 KB Output is correct
54 Correct 799 ms 48152 KB Output is correct
55 Correct 792 ms 48152 KB Output is correct
56 Correct 821 ms 48152 KB Output is correct
57 Execution timed out 2562 ms 76844 KB Time limit exceeded
58 Halted 0 ms 0 KB -