oj.uz

Submission #730228

# Submission time Handle Problem Language Result Execution time Memory
730228 2023-04-25T12:16:30 Z Desh03 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 559 ms 35516 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
struct st {
    vector<int> tr, lz;
    int sz;
    st(int n) {
        sz = n;
        while (__builtin_popcount(sz) ^ 1) sz++;
        tr.resize(sz << 1), lz.resize(sz << 1);
    }
    void push(int v, int l, int r) {
        int m = l + r >> 1;
        tr[v << 1] += lz[v] * (m - l + 1);
        lz[v << 1] += lz[v];
        tr[v << 1 | 1] += lz[v] * (r - m);
        lz[v << 1 | 1] += lz[v];
        lz[v] = 0;
    }
    void upd(int v, int l, int r, int ql, int qr) {
        if (l > qr || r < ql) return;
        if (l >= ql && r <= qr) {
            tr[v] += r - l + 1;
            lz[v]++;
            return;
        }
        if (lz[v]) push(v, l, r);
        int m = l + r >> 1;
        upd(v << 1, l, m, ql, qr);
        upd(v << 1 | 1, m + 1, r, ql, qr);
        tr[v] = tr[v << 1] + tr[v << 1 | 1];
    }
    int query(int v, int l, int r, int ql, int qr) {
        if (l > qr || r < ql) return 0;
        if (l >= ql && r <= qr) return tr[v];
        if (lz[v]) push(v, l, r);
        int m = l + r >> 1;
        return query(v << 1, l, m, ql, qr) + query(v << 1 | 1, m + 1, r, ql, qr);
    }
    int query(int i) {
        return query(1, 0, sz - 1, i, i);
    }
    void upd(int l, int r) {
        if (l > r) return;
        upd(1, 0, sz - 1, l, r);
    }
};
long long count_swaps(vector<int> s) {
    map<int, set<int>> mp;
    int n = s.size();
    st st(n);
    for (int i = 0; i < n; i++) {
        mp[s[i]].insert(i);
    }
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        if (mp[s[i]].find(i) == mp[s[i]].end()) continue;
        auto it = mp[-s[i]].begin();
        if (s[i] < 0) {
            ans += (*it + st.query(*it)) - (i + st.query(i)) - 1, st.upd(i + 1, *it - 1);
        } else {
            ans += (*it + st.query(*it)) - (i + st.query(i)), st.upd(i, *it - 1);
        }
        mp[s[i]].erase(i), mp[-s[i]].erase(it);
    }
    return ans;
}

Compilation message

shoes.cpp: In member function 'void st::push(int, int, int)':
shoes.cpp:13:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |         int m = l + r >> 1;
      |                 ~~^~~
shoes.cpp: In member function 'void st::upd(int, int, int, int, int)':
shoes.cpp:28:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         int m = l + r >> 1;
      |                 ~~^~~
shoes.cpp: In member function 'int st::query(int, int, int, int, int)':
shoes.cpp:37:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |         int m = l + r >> 1;
      |                 ~~^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 228 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 12 ms 2004 KB Output is correct
21 Correct 11 ms 2024 KB Output is correct
22 Correct 127 ms 16636 KB Output is correct
23 Correct 108 ms 16544 KB Output is correct
24 Correct 120 ms 16588 KB Output is correct
25 Correct 143 ms 16404 KB Output is correct
26 Correct 121 ms 16564 KB Output is correct
27 Correct 129 ms 16500 KB Output is correct
28 Correct 141 ms 16628 KB Output is correct
29 Correct 145 ms 16612 KB Output is correct
30 Correct 154 ms 16628 KB Output is correct
31 Correct 128 ms 16828 KB Output is correct
32 Correct 150 ms 16548 KB Output is correct
33 Correct 148 ms 16436 KB Output is correct
34 Correct 146 ms 16584 KB Output is correct
35 Correct 0 ms 296 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 142 ms 16636 KB Output is correct
38 Correct 150 ms 16576 KB Output is correct
39 Correct 150 ms 16660 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 548 ms 35392 KB Output is correct
6 Correct 303 ms 18252 KB Output is correct
7 Correct 417 ms 35396 KB Output is correct
8 Correct 138 ms 16632 KB Output is correct
9 Correct 442 ms 35516 KB Output is correct
10 Correct 429 ms 25900 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 260 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 296 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 3 ms 608 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 3 ms 564 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 432 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Correct 3 ms 596 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 260 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 296 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 228 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 296 KB Output is correct
49 Correct 1 ms 304 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 12 ms 2004 KB Output is correct
55 Correct 11 ms 2024 KB Output is correct
56 Correct 127 ms 16636 KB Output is correct
57 Correct 108 ms 16544 KB Output is correct
58 Correct 120 ms 16588 KB Output is correct
59 Correct 143 ms 16404 KB Output is correct
60 Correct 121 ms 16564 KB Output is correct
61 Correct 129 ms 16500 KB Output is correct
62 Correct 141 ms 16628 KB Output is correct
63 Correct 145 ms 16612 KB Output is correct
64 Correct 154 ms 16628 KB Output is correct
65 Correct 128 ms 16828 KB Output is correct
66 Correct 150 ms 16548 KB Output is correct
67 Correct 148 ms 16436 KB Output is correct
68 Correct 146 ms 16584 KB Output is correct
69 Correct 0 ms 296 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 142 ms 16636 KB Output is correct
72 Correct 150 ms 16576 KB Output is correct
73 Correct 150 ms 16660 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 548 ms 35392 KB Output is correct
79 Correct 303 ms 18252 KB Output is correct
80 Correct 417 ms 35396 KB Output is correct
81 Correct 138 ms 16632 KB Output is correct
82 Correct 442 ms 35516 KB Output is correct
83 Correct 429 ms 25900 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 296 KB Output is correct
86 Correct 1 ms 212 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 3 ms 608 KB Output is correct
89 Correct 2 ms 596 KB Output is correct
90 Correct 3 ms 564 KB Output is correct
91 Correct 2 ms 468 KB Output is correct
92 Correct 2 ms 468 KB Output is correct
93 Correct 2 ms 468 KB Output is correct
94 Correct 2 ms 468 KB Output is correct
95 Correct 2 ms 468 KB Output is correct
96 Correct 2 ms 432 KB Output is correct
97 Correct 2 ms 340 KB Output is correct
98 Correct 2 ms 340 KB Output is correct
99 Correct 3 ms 596 KB Output is correct
100 Correct 2 ms 596 KB Output is correct
101 Correct 33 ms 3700 KB Output is correct
102 Correct 23 ms 2388 KB Output is correct
103 Correct 559 ms 35476 KB Output is correct
104 Correct 341 ms 35492 KB Output is correct
105 Correct 406 ms 27180 KB Output is correct
106 Correct 460 ms 35404 KB Output is correct
107 Correct 343 ms 18708 KB Output is correct
108 Correct 287 ms 20780 KB Output is correct
109 Correct 133 ms 16556 KB Output is correct
110 Correct 141 ms 16568 KB Output is correct
111 Correct 428 ms 33320 KB Output is correct
112 Correct 515 ms 31216 KB Output is correct
113 Correct 332 ms 19020 KB Output is correct
114 Correct 453 ms 35396 KB Output is correct
115 Correct 450 ms 35276 KB Output is correct