oj.uz

Submission #408959

# Submission time Handle Problem Language Result Execution time Memory
408959 2021-05-19T22:42:59 Z Tc14 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 286 ms 23244 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;

struct SegmentTree {

    int Cap;
    ve<int> Seg;

    int left(int x) { return 2 * x; }
    int right(int x) { return 2 * x + 1; }
    int parent(int x) { return x / 2; }

    void build(int a) {
        Cap = 1 << (int)ceil(log2(a));
        Seg = ve<int>(2 * Cap);
    }

    int query(int a, int b) {
        return query(a, b, 0, Cap - 1, 1);
    }

    int query(int a, int b, int i, int j, int curr) {

        if (a <= i && j <= b) return Seg[curr];
        if (b < i || j < a) return 0;

        int m = (i + j) / 2;
        return query(a, b, i, m, left(curr)) + query(a, b, m + 1, j, right(curr));
    }

    void update(int p) {

        Seg[Cap + p] = 1;
        int curr = parent(Cap + p);

        while (curr != 0) {
            Seg[curr] = Seg[left(curr)] + Seg[right(curr)];
            curr = parent(curr);
        }
    }

};

ll count_swaps(ve<int> S) {

    int n;
    ve<int> A;
    ve<pii> F;
    map<int, pair<ve<int>, ve<int>>> M;
    SegmentTree Seg;

    n = (int)S.size() / 2;
    A = ve<int>(2 * n);
    F = ve<pii>(2 * n, {-1, -1});

    for (int i = 0; i < 2 * n; i++) {
        int s = S[i];
        if (s < 0) M[-s].first.push_back(i);
        else M[s].second.push_back(i);
    }

    for (auto x : M) {
        int l = (int)x.second.first.size();
        for (int i = 0; i < l; i++) {
            int a = x.second.first[i];
            int b = x.second.second[i];
            F[min(a, b)] = {a, b};
        }
    }

    int cnt = 0;
    for (int i = 0; i < 2 * n; i++) {
        int a, b;
        tie(a, b) = F[i];
        if (a != -1) {
            A[a] = cnt;
            A[b] = cnt + 1;
            cnt += 2;
        }
    }

    ll ans = 0;
    Seg.build(2 * n);

    for (int i = 0; i < 2 * n; i++) {
        ans += Seg.query(A[i], 2 * n - 1);
        Seg.update(A[i]);
    }

    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 292 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 9 ms 1104 KB Output is correct
21 Correct 9 ms 1196 KB Output is correct
22 Correct 88 ms 8404 KB Output is correct
23 Correct 79 ms 8488 KB Output is correct
24 Correct 83 ms 8460 KB Output is correct
25 Correct 87 ms 8248 KB Output is correct
26 Correct 85 ms 8456 KB Output is correct
27 Correct 78 ms 8232 KB Output is correct
28 Correct 82 ms 8328 KB Output is correct
29 Correct 79 ms 8448 KB Output is correct
30 Correct 80 ms 8328 KB Output is correct
31 Correct 83 ms 8340 KB Output is correct
32 Correct 79 ms 8448 KB Output is correct
33 Correct 77 ms 8252 KB Output is correct
34 Correct 80 ms 8332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 83 ms 8332 KB Output is correct
38 Correct 84 ms 8340 KB Output is correct
39 Correct 80 ms 8336 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 266 ms 23076 KB Output is correct
6 Correct 122 ms 9684 KB Output is correct
7 Correct 250 ms 23112 KB Output is correct
8 Correct 86 ms 8580 KB Output is correct
9 Correct 248 ms 23108 KB Output is correct
10 Correct 173 ms 15272 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 292 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 292 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 428 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 2 ms 428 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 2 ms 460 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 292 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 296 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 296 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 9 ms 1104 KB Output is correct
55 Correct 9 ms 1196 KB Output is correct
56 Correct 88 ms 8404 KB Output is correct
57 Correct 79 ms 8488 KB Output is correct
58 Correct 83 ms 8460 KB Output is correct
59 Correct 87 ms 8248 KB Output is correct
60 Correct 85 ms 8456 KB Output is correct
61 Correct 78 ms 8232 KB Output is correct
62 Correct 82 ms 8328 KB Output is correct
63 Correct 79 ms 8448 KB Output is correct
64 Correct 80 ms 8328 KB Output is correct
65 Correct 83 ms 8340 KB Output is correct
66 Correct 79 ms 8448 KB Output is correct
67 Correct 77 ms 8252 KB Output is correct
68 Correct 80 ms 8332 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 83 ms 8332 KB Output is correct
72 Correct 84 ms 8340 KB Output is correct
73 Correct 80 ms 8336 KB Output is correct
74 Correct 1 ms 204 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 266 ms 23076 KB Output is correct
79 Correct 122 ms 9684 KB Output is correct
80 Correct 250 ms 23112 KB Output is correct
81 Correct 86 ms 8580 KB Output is correct
82 Correct 248 ms 23108 KB Output is correct
83 Correct 173 ms 15272 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 1 ms 292 KB Output is correct
86 Correct 1 ms 204 KB Output is correct
87 Correct 1 ms 332 KB Output is correct
88 Correct 2 ms 428 KB Output is correct
89 Correct 2 ms 460 KB Output is correct
90 Correct 2 ms 460 KB Output is correct
91 Correct 2 ms 460 KB Output is correct
92 Correct 2 ms 428 KB Output is correct
93 Correct 2 ms 332 KB Output is correct
94 Correct 2 ms 332 KB Output is correct
95 Correct 2 ms 332 KB Output is correct
96 Correct 2 ms 332 KB Output is correct
97 Correct 1 ms 332 KB Output is correct
98 Correct 1 ms 332 KB Output is correct
99 Correct 2 ms 460 KB Output is correct
100 Correct 2 ms 460 KB Output is correct
101 Correct 16 ms 2380 KB Output is correct
102 Correct 13 ms 1444 KB Output is correct
103 Correct 276 ms 23192 KB Output is correct
104 Correct 200 ms 23072 KB Output is correct
105 Correct 190 ms 16416 KB Output is correct
106 Correct 286 ms 23112 KB Output is correct
107 Correct 121 ms 10140 KB Output is correct
108 Correct 126 ms 11588 KB Output is correct
109 Correct 81 ms 8796 KB Output is correct
110 Correct 79 ms 8340 KB Output is correct
111 Correct 232 ms 21316 KB Output is correct
112 Correct 237 ms 19608 KB Output is correct
113 Correct 131 ms 10180 KB Output is correct
114 Correct 249 ms 23156 KB Output is correct
115 Correct 250 ms 23244 KB Output is correct