oj.uz

Submission #864775

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

using namespace std;

typedef long long 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<ll> ans(m, n);
        {
                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])]++;
                }
                vector<pair<ll, ll>> vc;
                for (ll i = 0; i < m; i++) {
                        vc.emplace_back(c[i], i);
                }
                sort(vc.begin(), vc.end());
                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;
                                        }
                                }
                        }
                }
        }
        {
                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])]++;
                }
                vector<pair<ll, ll>> vc;
                for (ll i = 0; i < m; i++) {
                        vc.emplace_back(c[i], i);
                }
                sort(vc.begin(), vc.end());
                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: In function 'int main()':
rope.cpp:117:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
rope.cpp:118:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |                 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 1312 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 11 ms 1248 KB Output is correct
30 Correct 8 ms 1384 KB Output is correct
31 Correct 11 ms 1252 KB Output is correct
32 Correct 8 ms 1368 KB Output is correct
33 Correct 10 ms 1372 KB Output is correct
34 Correct 8 ms 1372 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 1312 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 11 ms 1248 KB Output is correct
30 Correct 8 ms 1384 KB Output is correct
31 Correct 11 ms 1252 KB Output is correct
32 Correct 8 ms 1368 KB Output is correct
33 Correct 10 ms 1372 KB Output is correct
34 Correct 8 ms 1372 KB Output is correct
35 Correct 56 ms 6748 KB Output is correct
36 Correct 57 ms 6740 KB Output is correct
37 Correct 54 ms 6736 KB Output is correct
38 Correct 54 ms 6736 KB Output is correct
39 Correct 56 ms 6740 KB Output is correct
40 Correct 40 ms 4432 KB Output is correct
41 Correct 36 ms 4124 KB Output is correct
42 Correct 33 ms 3676 KB Output is correct
43 Correct 33 ms 3676 KB Output is correct
44 Correct 36 ms 4432 KB Output is correct
45 Correct 37 ms 4176 KB Output is correct
46 Correct 32 ms 3672 KB Output is correct
47 Correct 40 ms 3924 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 1312 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 11 ms 1248 KB Output is correct
30 Correct 8 ms 1384 KB Output is correct
31 Correct 11 ms 1252 KB Output is correct
32 Correct 8 ms 1368 KB Output is correct
33 Correct 10 ms 1372 KB Output is correct
34 Correct 8 ms 1372 KB Output is correct
35 Correct 56 ms 6748 KB Output is correct
36 Correct 57 ms 6740 KB Output is correct
37 Correct 54 ms 6736 KB Output is correct
38 Correct 54 ms 6736 KB Output is correct
39 Correct 56 ms 6740 KB Output is correct
40 Correct 40 ms 4432 KB Output is correct
41 Correct 36 ms 4124 KB Output is correct
42 Correct 33 ms 3676 KB Output is correct
43 Correct 33 ms 3676 KB Output is correct
44 Correct 36 ms 4432 KB Output is correct
45 Correct 37 ms 4176 KB Output is correct
46 Correct 32 ms 3672 KB Output is correct
47 Correct 40 ms 3924 KB Output is correct
48 Correct 1672 ms 72272 KB Output is correct
49 Correct 1947 ms 72352 KB Output is correct
50 Correct 2088 ms 72428 KB Output is correct
51 Correct 1692 ms 63416 KB Output is correct
52 Correct 1363 ms 51768 KB Output is correct
53 Correct 837 ms 44836 KB Output is correct
54 Correct 606 ms 36468 KB Output is correct
55 Correct 632 ms 35668 KB Output is correct
56 Correct 516 ms 31968 KB Output is correct

Subtask #5
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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 1312 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 11 ms 1248 KB Output is correct
30 Correct 8 ms 1384 KB Output is correct
31 Correct 11 ms 1252 KB Output is correct
32 Correct 8 ms 1368 KB Output is correct
33 Correct 10 ms 1372 KB Output is correct
34 Correct 8 ms 1372 KB Output is correct
35 Correct 56 ms 6748 KB Output is correct
36 Correct 57 ms 6740 KB Output is correct
37 Correct 54 ms 6736 KB Output is correct
38 Correct 54 ms 6736 KB Output is correct
39 Correct 56 ms 6740 KB Output is correct
40 Correct 40 ms 4432 KB Output is correct
41 Correct 36 ms 4124 KB Output is correct
42 Correct 33 ms 3676 KB Output is correct
43 Correct 33 ms 3676 KB Output is correct
44 Correct 36 ms 4432 KB Output is correct
45 Correct 37 ms 4176 KB Output is correct
46 Correct 32 ms 3672 KB Output is correct
47 Correct 40 ms 3924 KB Output is correct
48 Correct 1672 ms 72272 KB Output is correct
49 Correct 1947 ms 72352 KB Output is correct
50 Correct 2088 ms 72428 KB Output is correct
51 Correct 1692 ms 63416 KB Output is correct
52 Correct 1363 ms 51768 KB Output is correct
53 Correct 837 ms 44836 KB Output is correct
54 Correct 606 ms 36468 KB Output is correct
55 Correct 632 ms 35668 KB Output is correct
56 Correct 516 ms 31968 KB Output is correct
57 Execution timed out 2527 ms 187972 KB Time limit exceeded
58 Halted 0 ms 0 KB -