oj.uz

Submission #143208

# Submission time Handle Problem Language Result Execution time Memory
143208 2019-08-13T11:00:41 Z mlyean00 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 353 ms 140180 KB 
#include <bits/stdc++.h>

#include "shoes.h"

using namespace std;
using ll = long long;

int sgn(int x) {
    if (x == 0) return 0;
    return x > 0 ? 1 : -1;
}

ll count_inversions(vector<int>& v, int l, int r) {
    if (r - l == 1) return 0;
    int mid = (l + r) / 2;
    ll ans = count_inversions(v, l, mid) + count_inversions(v, mid, r);

    int l_ptr = l, r_ptr = mid;

    vector<int> m;
    m.reserve(r - l);

    while (l_ptr < mid || r_ptr < r) {
        if (l_ptr == mid) {
            m.push_back(v[r_ptr++]);
        } else if (r_ptr == r) {
            ans += r_ptr - mid;
            m.push_back(v[l_ptr++]);
        } else if (v[l_ptr] <= v[r_ptr]) {
            ans += r_ptr - mid;
            m.push_back(v[l_ptr++]);
        } else {
            m.push_back(v[r_ptr++]);
        }
    }

    copy(m.begin(), m.end(), v.begin() + l);

    return ans;
}

ll count_swaps(vector<int> s) {
    int n = s.size() / 2;

    vector<int> v {0};
    for (int x : s) {
        if (x > 0) v.push_back(x);
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());

    for (int i = 0; i < 2 * n; ++i) {
        int k = sgn(s[i]);
        s[i] = k * (lower_bound(v.begin(), v.end(), abs(s[i])) - v.begin());
    }

    vector<int> t;

    vector<int> cnt(v.size());
    for (int i = 0; i < 2 * n; ++i) {
        int sz = abs(s[i]);
        if (cnt[sz] == 0 || sgn(s[i]) == sgn(cnt[sz])) {
            t.push_back(-sz);
            t.push_back(sz);
        }
        cnt[sz] += sgn(s[i]);
    }
    assert(t.size() == 2 * n);

    int offset = v.size() - 1;
    vector<stack<int>> st(2 * v.size() - 1);
    for (int i = 2 * n - 1; i >= 0; --i) {
        st[s[i] + offset].push(i);
    }

    vector<int> perm(2 * n);
    for (int i = 0; i < 2 * n; ++i) {
        perm[i] = st[t[i] + offset].top();
        st[t[i] + offset].pop();
    }

    return count_inversions(perm, 0, 2 * n);
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from shoes.cpp:1:
shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:68:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(t.size() == 2 * n);
            ~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 8 ms 764 KB Output is correct
21 Correct 8 ms 916 KB Output is correct
22 Correct 65 ms 5484 KB Output is correct
23 Correct 59 ms 5480 KB Output is correct
24 Correct 70 ms 5484 KB Output is correct
25 Correct 59 ms 5484 KB Output is correct
26 Correct 64 ms 5484 KB Output is correct
27 Correct 58 ms 5524 KB Output is correct
28 Correct 61 ms 5612 KB Output is correct
29 Correct 59 ms 5484 KB Output is correct
30 Correct 59 ms 5492 KB Output is correct
31 Correct 64 ms 5580 KB Output is correct
32 Correct 59 ms 5612 KB Output is correct
33 Correct 58 ms 5484 KB Output is correct
34 Correct 59 ms 5540 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 380 KB Output is correct
37 Correct 59 ms 5480 KB Output is correct
38 Correct 59 ms 5484 KB Output is correct
39 Correct 59 ms 5456 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 289 ms 140136 KB Output is correct
6 Correct 107 ms 16872 KB Output is correct
7 Correct 281 ms 140156 KB Output is correct
8 Correct 65 ms 5868 KB Output is correct
9 Correct 277 ms 140136 KB Output is correct
10 Correct 191 ms 72704 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 352 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 3 ms 632 KB Output is correct
41 Correct 3 ms 1656 KB Output is correct
42 Correct 4 ms 1784 KB Output is correct
43 Correct 4 ms 1528 KB Output is correct
44 Correct 4 ms 1400 KB Output is correct
45 Correct 4 ms 1272 KB Output is correct
46 Correct 3 ms 1016 KB Output is correct
47 Correct 3 ms 888 KB Output is correct
48 Correct 3 ms 764 KB Output is correct
49 Correct 3 ms 632 KB Output is correct
50 Correct 3 ms 380 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 4 ms 1656 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 352 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 252 KB Output is correct
39 Correct 2 ms 380 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 2 ms 252 KB Output is correct
45 Correct 2 ms 256 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 3 ms 376 KB Output is correct
54 Correct 8 ms 764 KB Output is correct
55 Correct 8 ms 916 KB Output is correct
56 Correct 65 ms 5484 KB Output is correct
57 Correct 59 ms 5480 KB Output is correct
58 Correct 70 ms 5484 KB Output is correct
59 Correct 59 ms 5484 KB Output is correct
60 Correct 64 ms 5484 KB Output is correct
61 Correct 58 ms 5524 KB Output is correct
62 Correct 61 ms 5612 KB Output is correct
63 Correct 59 ms 5484 KB Output is correct
64 Correct 59 ms 5492 KB Output is correct
65 Correct 64 ms 5580 KB Output is correct
66 Correct 59 ms 5612 KB Output is correct
67 Correct 58 ms 5484 KB Output is correct
68 Correct 59 ms 5540 KB Output is correct
69 Correct 2 ms 256 KB Output is correct
70 Correct 2 ms 380 KB Output is correct
71 Correct 59 ms 5480 KB Output is correct
72 Correct 59 ms 5484 KB Output is correct
73 Correct 59 ms 5456 KB Output is correct
74 Correct 2 ms 376 KB Output is correct
75 Correct 2 ms 256 KB Output is correct
76 Correct 2 ms 376 KB Output is correct
77 Correct 2 ms 376 KB Output is correct
78 Correct 289 ms 140136 KB Output is correct
79 Correct 107 ms 16872 KB Output is correct
80 Correct 281 ms 140156 KB Output is correct
81 Correct 65 ms 5868 KB Output is correct
82 Correct 277 ms 140136 KB Output is correct
83 Correct 191 ms 72704 KB Output is correct
84 Correct 2 ms 376 KB Output is correct
85 Correct 2 ms 376 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 3 ms 632 KB Output is correct
88 Correct 3 ms 1656 KB Output is correct
89 Correct 4 ms 1784 KB Output is correct
90 Correct 4 ms 1528 KB Output is correct
91 Correct 4 ms 1400 KB Output is correct
92 Correct 4 ms 1272 KB Output is correct
93 Correct 3 ms 1016 KB Output is correct
94 Correct 3 ms 888 KB Output is correct
95 Correct 3 ms 764 KB Output is correct
96 Correct 3 ms 632 KB Output is correct
97 Correct 3 ms 380 KB Output is correct
98 Correct 3 ms 376 KB Output is correct
99 Correct 4 ms 1656 KB Output is correct
100 Correct 4 ms 1656 KB Output is correct
101 Correct 25 ms 12920 KB Output is correct
102 Correct 14 ms 3448 KB Output is correct
103 Correct 290 ms 140012 KB Output is correct
104 Correct 353 ms 140140 KB Output is correct
105 Correct 217 ms 81644 KB Output is correct
106 Correct 288 ms 140172 KB Output is correct
107 Correct 117 ms 20076 KB Output is correct
108 Correct 135 ms 35056 KB Output is correct
109 Correct 61 ms 5736 KB Output is correct
110 Correct 59 ms 5484 KB Output is correct
111 Correct 261 ms 125096 KB Output is correct
112 Correct 253 ms 110188 KB Output is correct
113 Correct 122 ms 21740 KB Output is correct
114 Correct 275 ms 140080 KB Output is correct
115 Correct 323 ms 140180 KB Output is correct