oj.uz

Submission #864777

# Submission time Handle Problem Language Result Execution time Memory
864777 2023-10-23T15:17:42 Z green_gold_dog Rope (JOI17_rope) C++17
100 / 100
 2213 ms 143888 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef int ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, m;
        cin >> n >> m;
        if (m == 1) {
                cout << 0 << '\n';
                return;
        }
        vector<ll> arr(n);
        for (ll i = 0; i < n; i++) {
                cin >> arr[i];
                arr[i]--;
        }
        vector<ll> c(m);
        for (auto i : arr) {
                c[i]++;
        }
        vector<pair<ll, ll>> vc;
        for (ll i = 0; i < m; i++) {
                vc.emplace_back(c[i], i);
        }
        sort(vc.begin(), vc.end());
        vector<ll> ans(m, n);
        {
                unordered_map<pair<ll, ll>, ll> ma;
                for (ll i = 0; i + 1 < n; i += 2) {
                        ma[make_pair(arr[i], arr[i + 1])]++;
                        ma[make_pair(arr[i + 1], arr[i])]++;
                }
                for (ll i = 0; i < m; i++) {
                        for (ll j = m - 1; j >= 0; j--) {
                                if (vc[j].second != i) {
                                        assign_min(ans[i], n - c[i] - vc[j].first + ma[make_pair(i, vc[j].second)]);
                                        if (ma[make_pair(i, vc[j].second)] == 0) {
                                                break;
                                        }
                                }
                        }
                }
        }
        {
                unordered_map<pair<ll, ll>, ll> ma;
                for (ll i = 1; i + 1 < n; i += 2) {
                        ma[make_pair(arr[i], arr[i + 1])]++;
                        ma[make_pair(arr[i + 1], arr[i])]++;
                }
                for (ll i = 0; i < m; i++) {
                        for (ll j = m - 1; j >= 0; j--) {
                                if (vc[j].second != i) {
                                        assign_min(ans[i], n - c[i] - vc[j].first + ma[make_pair(i, vc[j].second)]);
                                        if (ma[make_pair(i, vc[j].second)] == 0) {
                                                break;
                                        }
                                }
                        }
                }
        }
        for (auto i : ans) {
                cout << i << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

rope.cpp:12:22: warning: overflow in conversion from 'long int' to 'll' {aka 'int'} changes value from '9000000000000000000' to '-494665728' [-Woverflow]
   12 | constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~
rope.cpp: In function 'int main()':
rope.cpp:113:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
rope.cpp:114:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 860 KB Output is correct
28 Correct 8 ms 860 KB Output is correct
29 Correct 9 ms 868 KB Output is correct
30 Correct 8 ms 860 KB Output is correct
31 Correct 9 ms 860 KB Output is correct
32 Correct 8 ms 860 KB Output is correct
33 Correct 9 ms 860 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 28 ms 5328 KB Output is correct
36 Correct 26 ms 5328 KB Output is correct
37 Correct 25 ms 5584 KB Output is correct
38 Correct 26 ms 5544 KB Output is correct
39 Correct 26 ms 5340 KB Output is correct
40 Correct 22 ms 4096 KB Output is correct
41 Correct 19 ms 3792 KB Output is correct
42 Correct 16 ms 3176 KB Output is correct
43 Correct 16 ms 2736 KB Output is correct
44 Correct 20 ms 3772 KB Output is correct
45 Correct 20 ms 3792 KB Output is correct
46 Correct 17 ms 2744 KB Output is correct
47 Correct 16 ms 2924 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 860 KB Output is correct
28 Correct 8 ms 860 KB Output is correct
29 Correct 9 ms 868 KB Output is correct
30 Correct 8 ms 860 KB Output is correct
31 Correct 9 ms 860 KB Output is correct
32 Correct 8 ms 860 KB Output is correct
33 Correct 9 ms 860 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 28 ms 5328 KB Output is correct
36 Correct 26 ms 5328 KB Output is correct
37 Correct 25 ms 5584 KB Output is correct
38 Correct 26 ms 5544 KB Output is correct
39 Correct 26 ms 5340 KB Output is correct
40 Correct 22 ms 4096 KB Output is correct
41 Correct 19 ms 3792 KB Output is correct
42 Correct 16 ms 3176 KB Output is correct
43 Correct 16 ms 2736 KB Output is correct
44 Correct 20 ms 3772 KB Output is correct
45 Correct 20 ms 3792 KB Output is correct
46 Correct 17 ms 2744 KB Output is correct
47 Correct 16 ms 2924 KB Output is correct
48 Correct 1020 ms 66060 KB Output is correct
49 Correct 966 ms 68656 KB Output is correct
50 Correct 959 ms 66020 KB Output is correct
51 Correct 863 ms 61912 KB Output is correct
52 Correct 459 ms 42432 KB Output is correct
53 Correct 425 ms 36552 KB Output is correct
54 Correct 344 ms 31484 KB Output is correct
55 Correct 302 ms 29636 KB Output is correct
56 Correct 299 ms 21536 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 10 ms 860 KB Output is correct
28 Correct 8 ms 860 KB Output is correct
29 Correct 9 ms 868 KB Output is correct
30 Correct 8 ms 860 KB Output is correct
31 Correct 9 ms 860 KB Output is correct
32 Correct 8 ms 860 KB Output is correct
33 Correct 9 ms 860 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 28 ms 5328 KB Output is correct
36 Correct 26 ms 5328 KB Output is correct
37 Correct 25 ms 5584 KB Output is correct
38 Correct 26 ms 5544 KB Output is correct
39 Correct 26 ms 5340 KB Output is correct
40 Correct 22 ms 4096 KB Output is correct
41 Correct 19 ms 3792 KB Output is correct
42 Correct 16 ms 3176 KB Output is correct
43 Correct 16 ms 2736 KB Output is correct
44 Correct 20 ms 3772 KB Output is correct
45 Correct 20 ms 3792 KB Output is correct
46 Correct 17 ms 2744 KB Output is correct
47 Correct 16 ms 2924 KB Output is correct
48 Correct 1020 ms 66060 KB Output is correct
49 Correct 966 ms 68656 KB Output is correct
50 Correct 959 ms 66020 KB Output is correct
51 Correct 863 ms 61912 KB Output is correct
52 Correct 459 ms 42432 KB Output is correct
53 Correct 425 ms 36552 KB Output is correct
54 Correct 344 ms 31484 KB Output is correct
55 Correct 302 ms 29636 KB Output is correct
56 Correct 299 ms 21536 KB Output is correct
57 Correct 2213 ms 143888 KB Output is correct
58 Correct 2021 ms 123984 KB Output is correct
59 Correct 1979 ms 124280 KB Output is correct
60 Correct 1938 ms 130944 KB Output is correct
61 Correct 1917 ms 130476 KB Output is correct
62 Correct 861 ms 68068 KB Output is correct
63 Correct 1107 ms 85100 KB Output is correct
64 Correct 942 ms 76312 KB Output is correct
65 Correct 506 ms 47832 KB Output is correct