oj.uz

Submission #758131

# Submission time Handle Problem Language Result Execution time Memory
758131 2023-06-14T08:02:03 Z PixelCat Rope (JOI17_rope) C++14
80 / 100
 2500 ms 77496 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];

void solve(int n, int m, vector<pii> v2, vector<int> v1) {
    for(auto &i:v2) {
        if(i.F > i.S) swap(i.F, i.S);
    }  // i.F <= i.S

    memset(cnt1, 0, sizeof(cnt1));
    map<pii, int> cnt2;
    for(auto &i:v2) {
        cnt1[i.F]++;
        cnt1[i.S]++;
        cnt2[i]++;
    }

    For(c1, 1, m) {
        For(c2, c1 + 1, m) {
            int cost = n - cnt1[c1] - cnt1[c2];
            if(cnt2.count(pii(c1, c2))) cost += cnt2[pii(c1, c2)];
            for(auto &i:v1) {
                cost -= max(i == c1, i == c2);
            }
            chmin(ans[c1], cost);
            chmin(ans[c2], cost);
        }
        int cost = n - cnt1[c1];
        for(auto &i:v1) cost -= (i == c1);
        chmin(ans[c1], cost);
    }
}

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 5 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8148 KB Output is correct
7 Correct 5 ms 8076 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 5 ms 8148 KB Output is correct
10 Correct 5 ms 8032 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 4 ms 8148 KB Output is correct
14 Correct 4 ms 8148 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8148 KB Output is correct
17 Correct 4 ms 8148 KB Output is correct
18 Correct 5 ms 8148 KB Output is correct
19 Correct 5 ms 8148 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 4 ms 8152 KB Output is correct
22 Correct 4 ms 8148 KB Output is correct
23 Correct 5 ms 8152 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8128 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8148 KB Output is correct
7 Correct 5 ms 8076 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 5 ms 8148 KB Output is correct
10 Correct 5 ms 8032 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 4 ms 8148 KB Output is correct
14 Correct 4 ms 8148 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8148 KB Output is correct
17 Correct 4 ms 8148 KB Output is correct
18 Correct 5 ms 8148 KB Output is correct
19 Correct 5 ms 8148 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 4 ms 8152 KB Output is correct
22 Correct 4 ms 8148 KB Output is correct
23 Correct 5 ms 8152 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8128 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct
27 Correct 22 ms 10592 KB Output is correct
28 Correct 18 ms 10576 KB Output is correct
29 Correct 16 ms 10672 KB Output is correct
30 Correct 16 ms 10720 KB Output is correct
31 Correct 19 ms 10576 KB Output is correct
32 Correct 14 ms 10576 KB Output is correct
33 Correct 17 ms 10684 KB Output is correct
34 Correct 16 ms 10672 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8148 KB Output is correct
7 Correct 5 ms 8076 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 5 ms 8148 KB Output is correct
10 Correct 5 ms 8032 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 4 ms 8148 KB Output is correct
14 Correct 4 ms 8148 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8148 KB Output is correct
17 Correct 4 ms 8148 KB Output is correct
18 Correct 5 ms 8148 KB Output is correct
19 Correct 5 ms 8148 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 4 ms 8152 KB Output is correct
22 Correct 4 ms 8148 KB Output is correct
23 Correct 5 ms 8152 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8128 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct
27 Correct 22 ms 10592 KB Output is correct
28 Correct 18 ms 10576 KB Output is correct
29 Correct 16 ms 10672 KB Output is correct
30 Correct 16 ms 10720 KB Output is correct
31 Correct 19 ms 10576 KB Output is correct
32 Correct 14 ms 10576 KB Output is correct
33 Correct 17 ms 10684 KB Output is correct
34 Correct 16 ms 10672 KB Output is correct
35 Correct 71 ms 13084 KB Output is correct
36 Correct 71 ms 13012 KB Output is correct
37 Correct 59 ms 13008 KB Output is correct
38 Correct 70 ms 13068 KB Output is correct
39 Correct 71 ms 13008 KB Output is correct
40 Correct 46 ms 11904 KB Output is correct
41 Correct 45 ms 11856 KB Output is correct
42 Correct 36 ms 11524 KB Output is correct
43 Correct 37 ms 11536 KB Output is correct
44 Correct 43 ms 11920 KB Output is correct
45 Correct 46 ms 11856 KB Output is correct
46 Correct 40 ms 11632 KB Output is correct
47 Correct 37 ms 11480 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8148 KB Output is correct
7 Correct 5 ms 8076 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 5 ms 8148 KB Output is correct
10 Correct 5 ms 8032 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 4 ms 8148 KB Output is correct
14 Correct 4 ms 8148 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8148 KB Output is correct
17 Correct 4 ms 8148 KB Output is correct
18 Correct 5 ms 8148 KB Output is correct
19 Correct 5 ms 8148 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 4 ms 8152 KB Output is correct
22 Correct 4 ms 8148 KB Output is correct
23 Correct 5 ms 8152 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8128 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct
27 Correct 22 ms 10592 KB Output is correct
28 Correct 18 ms 10576 KB Output is correct
29 Correct 16 ms 10672 KB Output is correct
30 Correct 16 ms 10720 KB Output is correct
31 Correct 19 ms 10576 KB Output is correct
32 Correct 14 ms 10576 KB Output is correct
33 Correct 17 ms 10684 KB Output is correct
34 Correct 16 ms 10672 KB Output is correct
35 Correct 71 ms 13084 KB Output is correct
36 Correct 71 ms 13012 KB Output is correct
37 Correct 59 ms 13008 KB Output is correct
38 Correct 70 ms 13068 KB Output is correct
39 Correct 71 ms 13008 KB Output is correct
40 Correct 46 ms 11904 KB Output is correct
41 Correct 45 ms 11856 KB Output is correct
42 Correct 36 ms 11524 KB Output is correct
43 Correct 37 ms 11536 KB Output is correct
44 Correct 43 ms 11920 KB Output is correct
45 Correct 46 ms 11856 KB Output is correct
46 Correct 40 ms 11632 KB Output is correct
47 Correct 37 ms 11480 KB Output is correct
48 Correct 1489 ms 65816 KB Output is correct
49 Correct 1494 ms 65924 KB Output is correct
50 Correct 1532 ms 66288 KB Output is correct
51 Correct 1202 ms 61152 KB Output is correct
52 Correct 926 ms 55248 KB Output is correct
53 Correct 950 ms 52020 KB Output is correct
54 Correct 788 ms 47788 KB Output is correct
55 Correct 728 ms 47396 KB Output is correct
56 Correct 835 ms 45644 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 5 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8148 KB Output is correct
7 Correct 5 ms 8076 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 5 ms 8148 KB Output is correct
10 Correct 5 ms 8032 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 4 ms 8148 KB Output is correct
14 Correct 4 ms 8148 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 4 ms 8148 KB Output is correct
17 Correct 4 ms 8148 KB Output is correct
18 Correct 5 ms 8148 KB Output is correct
19 Correct 5 ms 8148 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 4 ms 8152 KB Output is correct
22 Correct 4 ms 8148 KB Output is correct
23 Correct 5 ms 8152 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8128 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct
27 Correct 22 ms 10592 KB Output is correct
28 Correct 18 ms 10576 KB Output is correct
29 Correct 16 ms 10672 KB Output is correct
30 Correct 16 ms 10720 KB Output is correct
31 Correct 19 ms 10576 KB Output is correct
32 Correct 14 ms 10576 KB Output is correct
33 Correct 17 ms 10684 KB Output is correct
34 Correct 16 ms 10672 KB Output is correct
35 Correct 71 ms 13084 KB Output is correct
36 Correct 71 ms 13012 KB Output is correct
37 Correct 59 ms 13008 KB Output is correct
38 Correct 70 ms 13068 KB Output is correct
39 Correct 71 ms 13008 KB Output is correct
40 Correct 46 ms 11904 KB Output is correct
41 Correct 45 ms 11856 KB Output is correct
42 Correct 36 ms 11524 KB Output is correct
43 Correct 37 ms 11536 KB Output is correct
44 Correct 43 ms 11920 KB Output is correct
45 Correct 46 ms 11856 KB Output is correct
46 Correct 40 ms 11632 KB Output is correct
47 Correct 37 ms 11480 KB Output is correct
48 Correct 1489 ms 65816 KB Output is correct
49 Correct 1494 ms 65924 KB Output is correct
50 Correct 1532 ms 66288 KB Output is correct
51 Correct 1202 ms 61152 KB Output is correct
52 Correct 926 ms 55248 KB Output is correct
53 Correct 950 ms 52020 KB Output is correct
54 Correct 788 ms 47788 KB Output is correct
55 Correct 728 ms 47396 KB Output is correct
56 Correct 835 ms 45644 KB Output is correct
57 Execution timed out 2531 ms 77496 KB Time limit exceeded
58 Halted 0 ms 0 KB -