oj.uz

Submission #758189

# Submission time Handle Problem Language Result Execution time Memory
758189 2023-06-14T08:52:49 Z PixelCat Rope (JOI17_rope) C++14
80 / 100
 2500 ms 192780 KB 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
#define INF (int)(1e18)
using namespace std;
using LL = long long;
using pii = pair<int, int>;

void chmin(int &x, int a) {
    x = min(x, a);
}
void chmax(int &x, int a) {
    x = max(x, a);
}

const int MAXN = 1000010;

int ans[MAXN];
int cnt1[MAXN];

struct Ayaya {
    int a[MAXN];
    multiset<int> st;
    void init(int n) {
        memset(a, 0, sizeof(a));
        st.clear();
        For(i, 1, n) st.insert(0);
    }
    void upd(int i, int x) {
        st.erase(st.find(a[i]));
        a[i] = x;
        st.insert(x);
    }
    void add(int i, int x) {
        upd(i, a[i] + x);
    }
    int min() {
        return *st.begin();
    }
}; // aya;

struct Ayaya2 {
    int a[MAXN];
    priority_queue<int, vector<int>, greater<int>> pq, gg;
    void init(int n) {
        memset(a, 0, sizeof(a));
        while(!pq.empty()) pq.pop();
        while(!gg.empty()) gg.pop();
        For(i, 1, n) pq.emplace(0);
    }
    void add(int i, int x) {
        gg.emplace(a[i]);
        a[i] += x;
        pq.emplace(a[i]);
    }
    int min() {
        while(sz(gg) && pq.top() == gg.top()) {
            pq.pop(); gg.pop();
        }
        return pq.top();
    }
} aya;

vector<int> vv[MAXN];
void solve(int n, int m, vector<pii> v2, vector<int> v1) {
    memset(cnt1, 0, sizeof(cnt1));
    For(i, 1, m) vv[i].clear();
    for(auto &i:v2) {
        cnt1[i.F]++;
        cnt1[i.S]++;
        vv[i.F].eb(i.S);
        vv[i.S].eb(i.F);
    }
    aya.init(m);
    For(c2, 1, m) aya.add(c2, n - cnt1[c2]);

    For(c1, 1, m) {
        int add = 0;
        for(auto &p:vv[c1]) aya.add(p, 1);
        for(auto &i:v1) {
            aya.add(i, -1);
            add -= (i == c1);
        }
        aya.add(c1, INF);
        chmin(ans[c1], aya.min() - cnt1[c1] + add);
        aya.add(c1, -INF);
        for(auto &i:v1) aya.add(i, 1);
        for(auto &p:vv[c1]) aya.add(p, -1);

        chmin(ans[c1], n - cnt1[c1] + add);
    }
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // =^-w-^=
    int n, m; cin >> n >> m;
    vector<int> a(n);
    for(auto &i:a) cin >> i;

    For(i, 1, m) {
        ans[i] = INF;
    }

    if(n % 2) {
        For(_, 0, 1) {
            vector<pii> v2;
            for(int i = 1; i < n; i += 2) {
                v2.eb(pii(a[i - 1], a[i]));
            }
            solve(n, m, v2, { a.back() });
            reverse(all(a));
        }
    } else {
        vector<pii> v2;
        for(int i = 1; i < n; i += 2) {
            v2.eb(pii(a[i - 1], a[i]));
        }
        solve(n, m, v2, {});

        v2.clear();
        for(int i = 2; i < n; i += 2) {
            v2.eb(pii(a[i - 1], a[i]));
        }
        solve(n, m, v2, { a.front(), a.back() });
    }

    For(i, 1, m) cout << ans[i] << "\n";
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39380 KB Output is correct
3 Correct 22 ms 39396 KB Output is correct
4 Correct 22 ms 39352 KB Output is correct
5 Correct 21 ms 39356 KB Output is correct
6 Correct 24 ms 39344 KB Output is correct
7 Correct 22 ms 39380 KB Output is correct
8 Correct 21 ms 39468 KB Output is correct
9 Correct 21 ms 39396 KB Output is correct
10 Correct 22 ms 39412 KB Output is correct
11 Correct 23 ms 39424 KB Output is correct
12 Correct 21 ms 39412 KB Output is correct
13 Correct 21 ms 39380 KB Output is correct
14 Correct 21 ms 39384 KB Output is correct
15 Correct 21 ms 39380 KB Output is correct
16 Correct 24 ms 39380 KB Output is correct
17 Correct 20 ms 39384 KB Output is correct
18 Correct 21 ms 39380 KB Output is correct
19 Correct 21 ms 39372 KB Output is correct
20 Correct 21 ms 39464 KB Output is correct
21 Correct 21 ms 39368 KB Output is correct
22 Correct 22 ms 39456 KB Output is correct
23 Correct 20 ms 39468 KB Output is correct
24 Correct 21 ms 39380 KB Output is correct
25 Correct 21 ms 39412 KB Output is correct
26 Correct 20 ms 39352 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39380 KB Output is correct
3 Correct 22 ms 39396 KB Output is correct
4 Correct 22 ms 39352 KB Output is correct
5 Correct 21 ms 39356 KB Output is correct
6 Correct 24 ms 39344 KB Output is correct
7 Correct 22 ms 39380 KB Output is correct
8 Correct 21 ms 39468 KB Output is correct
9 Correct 21 ms 39396 KB Output is correct
10 Correct 22 ms 39412 KB Output is correct
11 Correct 23 ms 39424 KB Output is correct
12 Correct 21 ms 39412 KB Output is correct
13 Correct 21 ms 39380 KB Output is correct
14 Correct 21 ms 39384 KB Output is correct
15 Correct 21 ms 39380 KB Output is correct
16 Correct 24 ms 39380 KB Output is correct
17 Correct 20 ms 39384 KB Output is correct
18 Correct 21 ms 39380 KB Output is correct
19 Correct 21 ms 39372 KB Output is correct
20 Correct 21 ms 39464 KB Output is correct
21 Correct 21 ms 39368 KB Output is correct
22 Correct 22 ms 39456 KB Output is correct
23 Correct 20 ms 39468 KB Output is correct
24 Correct 21 ms 39380 KB Output is correct
25 Correct 21 ms 39412 KB Output is correct
26 Correct 20 ms 39352 KB Output is correct
27 Correct 106 ms 44104 KB Output is correct
28 Correct 105 ms 44436 KB Output is correct
29 Correct 113 ms 44680 KB Output is correct
30 Correct 104 ms 44716 KB Output is correct
31 Correct 105 ms 44232 KB Output is correct
32 Correct 102 ms 44408 KB Output is correct
33 Correct 113 ms 44880 KB Output is correct
34 Correct 106 ms 44952 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39380 KB Output is correct
3 Correct 22 ms 39396 KB Output is correct
4 Correct 22 ms 39352 KB Output is correct
5 Correct 21 ms 39356 KB Output is correct
6 Correct 24 ms 39344 KB Output is correct
7 Correct 22 ms 39380 KB Output is correct
8 Correct 21 ms 39468 KB Output is correct
9 Correct 21 ms 39396 KB Output is correct
10 Correct 22 ms 39412 KB Output is correct
11 Correct 23 ms 39424 KB Output is correct
12 Correct 21 ms 39412 KB Output is correct
13 Correct 21 ms 39380 KB Output is correct
14 Correct 21 ms 39384 KB Output is correct
15 Correct 21 ms 39380 KB Output is correct
16 Correct 24 ms 39380 KB Output is correct
17 Correct 20 ms 39384 KB Output is correct
18 Correct 21 ms 39380 KB Output is correct
19 Correct 21 ms 39372 KB Output is correct
20 Correct 21 ms 39464 KB Output is correct
21 Correct 21 ms 39368 KB Output is correct
22 Correct 22 ms 39456 KB Output is correct
23 Correct 20 ms 39468 KB Output is correct
24 Correct 21 ms 39380 KB Output is correct
25 Correct 21 ms 39412 KB Output is correct
26 Correct 20 ms 39352 KB Output is correct
27 Correct 106 ms 44104 KB Output is correct
28 Correct 105 ms 44436 KB Output is correct
29 Correct 113 ms 44680 KB Output is correct
30 Correct 104 ms 44716 KB Output is correct
31 Correct 105 ms 44232 KB Output is correct
32 Correct 102 ms 44408 KB Output is correct
33 Correct 113 ms 44880 KB Output is correct
34 Correct 106 ms 44952 KB Output is correct
35 Correct 77 ms 46260 KB Output is correct
36 Correct 77 ms 46188 KB Output is correct
37 Correct 78 ms 46284 KB Output is correct
38 Correct 81 ms 46412 KB Output is correct
39 Correct 78 ms 46352 KB Output is correct
40 Correct 86 ms 45452 KB Output is correct
41 Correct 84 ms 45436 KB Output is correct
42 Correct 85 ms 44324 KB Output is correct
43 Correct 86 ms 44564 KB Output is correct
44 Correct 79 ms 46316 KB Output is correct
45 Correct 78 ms 46176 KB Output is correct
46 Correct 78 ms 45336 KB Output is correct
47 Correct 80 ms 45476 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39380 KB Output is correct
3 Correct 22 ms 39396 KB Output is correct
4 Correct 22 ms 39352 KB Output is correct
5 Correct 21 ms 39356 KB Output is correct
6 Correct 24 ms 39344 KB Output is correct
7 Correct 22 ms 39380 KB Output is correct
8 Correct 21 ms 39468 KB Output is correct
9 Correct 21 ms 39396 KB Output is correct
10 Correct 22 ms 39412 KB Output is correct
11 Correct 23 ms 39424 KB Output is correct
12 Correct 21 ms 39412 KB Output is correct
13 Correct 21 ms 39380 KB Output is correct
14 Correct 21 ms 39384 KB Output is correct
15 Correct 21 ms 39380 KB Output is correct
16 Correct 24 ms 39380 KB Output is correct
17 Correct 20 ms 39384 KB Output is correct
18 Correct 21 ms 39380 KB Output is correct
19 Correct 21 ms 39372 KB Output is correct
20 Correct 21 ms 39464 KB Output is correct
21 Correct 21 ms 39368 KB Output is correct
22 Correct 22 ms 39456 KB Output is correct
23 Correct 20 ms 39468 KB Output is correct
24 Correct 21 ms 39380 KB Output is correct
25 Correct 21 ms 39412 KB Output is correct
26 Correct 20 ms 39352 KB Output is correct
27 Correct 106 ms 44104 KB Output is correct
28 Correct 105 ms 44436 KB Output is correct
29 Correct 113 ms 44680 KB Output is correct
30 Correct 104 ms 44716 KB Output is correct
31 Correct 105 ms 44232 KB Output is correct
32 Correct 102 ms 44408 KB Output is correct
33 Correct 113 ms 44880 KB Output is correct
34 Correct 106 ms 44952 KB Output is correct
35 Correct 77 ms 46260 KB Output is correct
36 Correct 77 ms 46188 KB Output is correct
37 Correct 78 ms 46284 KB Output is correct
38 Correct 81 ms 46412 KB Output is correct
39 Correct 78 ms 46352 KB Output is correct
40 Correct 86 ms 45452 KB Output is correct
41 Correct 84 ms 45436 KB Output is correct
42 Correct 85 ms 44324 KB Output is correct
43 Correct 86 ms 44564 KB Output is correct
44 Correct 79 ms 46316 KB Output is correct
45 Correct 78 ms 46176 KB Output is correct
46 Correct 78 ms 45336 KB Output is correct
47 Correct 80 ms 45476 KB Output is correct
48 Correct 687 ms 107780 KB Output is correct
49 Correct 698 ms 107764 KB Output is correct
50 Correct 708 ms 108060 KB Output is correct
51 Correct 724 ms 121288 KB Output is correct
52 Correct 739 ms 118732 KB Output is correct
53 Correct 690 ms 93872 KB Output is correct
54 Correct 689 ms 82196 KB Output is correct
55 Correct 700 ms 81536 KB Output is correct
56 Correct 712 ms 76868 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39380 KB Output is correct
3 Correct 22 ms 39396 KB Output is correct
4 Correct 22 ms 39352 KB Output is correct
5 Correct 21 ms 39356 KB Output is correct
6 Correct 24 ms 39344 KB Output is correct
7 Correct 22 ms 39380 KB Output is correct
8 Correct 21 ms 39468 KB Output is correct
9 Correct 21 ms 39396 KB Output is correct
10 Correct 22 ms 39412 KB Output is correct
11 Correct 23 ms 39424 KB Output is correct
12 Correct 21 ms 39412 KB Output is correct
13 Correct 21 ms 39380 KB Output is correct
14 Correct 21 ms 39384 KB Output is correct
15 Correct 21 ms 39380 KB Output is correct
16 Correct 24 ms 39380 KB Output is correct
17 Correct 20 ms 39384 KB Output is correct
18 Correct 21 ms 39380 KB Output is correct
19 Correct 21 ms 39372 KB Output is correct
20 Correct 21 ms 39464 KB Output is correct
21 Correct 21 ms 39368 KB Output is correct
22 Correct 22 ms 39456 KB Output is correct
23 Correct 20 ms 39468 KB Output is correct
24 Correct 21 ms 39380 KB Output is correct
25 Correct 21 ms 39412 KB Output is correct
26 Correct 20 ms 39352 KB Output is correct
27 Correct 106 ms 44104 KB Output is correct
28 Correct 105 ms 44436 KB Output is correct
29 Correct 113 ms 44680 KB Output is correct
30 Correct 104 ms 44716 KB Output is correct
31 Correct 105 ms 44232 KB Output is correct
32 Correct 102 ms 44408 KB Output is correct
33 Correct 113 ms 44880 KB Output is correct
34 Correct 106 ms 44952 KB Output is correct
35 Correct 77 ms 46260 KB Output is correct
36 Correct 77 ms 46188 KB Output is correct
37 Correct 78 ms 46284 KB Output is correct
38 Correct 81 ms 46412 KB Output is correct
39 Correct 78 ms 46352 KB Output is correct
40 Correct 86 ms 45452 KB Output is correct
41 Correct 84 ms 45436 KB Output is correct
42 Correct 85 ms 44324 KB Output is correct
43 Correct 86 ms 44564 KB Output is correct
44 Correct 79 ms 46316 KB Output is correct
45 Correct 78 ms 46176 KB Output is correct
46 Correct 78 ms 45336 KB Output is correct
47 Correct 80 ms 45476 KB Output is correct
48 Correct 687 ms 107780 KB Output is correct
49 Correct 698 ms 107764 KB Output is correct
50 Correct 708 ms 108060 KB Output is correct
51 Correct 724 ms 121288 KB Output is correct
52 Correct 739 ms 118732 KB Output is correct
53 Correct 690 ms 93872 KB Output is correct
54 Correct 689 ms 82196 KB Output is correct
55 Correct 700 ms 81536 KB Output is correct
56 Correct 712 ms 76868 KB Output is correct
57 Execution timed out 2585 ms 192780 KB Time limit exceeded
58 Halted 0 ms 0 KB -