oj.uz

Submission #573367

# Submission time Handle Problem Language Result Execution time Memory
573367 2022-06-06T13:01:24 Z talant117408 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 172 ms 35540 KB 
#include "shoes.h"
#include <bits/stdc++.h>

#ifndef EVAL
#include "grader.cpp"
#endif
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'
 
int mod = 1e9+7;
 
ll modulo(ll a) {
    return ((a % mod) + mod) % mod;
}
 
ll add(ll a, ll b) {
    return modulo(a + b);
}
 
ll mult(ll a, ll b) {
    return modulo(a * b);
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) {
            res = mult(res, a);
        }
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 2e5+7;
int tree[N*4], lz[N*4];

void push(int v, int l, int r) {
    if (lz[v] != 0) {
        tree[v] += lz[v]*(r-l+1);
        if (l != r) {
            lz[v*2] += lz[v];
            lz[v*2+1] += lz[v];
        }
        lz[v] = 0;
    }
}

void update(int v, int l, int r, int ql, int qr) {
    push(v, l, r);
    if (ql > r || l > qr) return;
    if (ql <= l && r <= qr) {
        lz[v]++;
        push(v, l, r);
        return;
    }
    int mid = (l+r) >> 1;
    update(v*2, l, mid, ql, qr);
    update(v*2+1, mid+1, r, ql, qr);
    tree[v] = tree[v*2]+tree[v*2+1];
}

int get(int v, int l, int r, int pos) {
    push(v, l, r);
    if (l == r) return tree[v];
    int mid = (l+r) >> 1;
    if (pos <= mid) return get(v*2, l, mid, pos);
    else return get(v*2+1, mid+1, r, pos);
}

long long count_swaps(std::vector<int> s) {
    multiset <int> pos[sz(s)], neg[sz(s)];
    for (int i = 0; i < sz(s); i++) {
        if (s[i] < 0) neg[abs(s[i])].insert(i);
        else pos[abs(s[i])].insert(i);
    }
    vector <bool> used(sz(s));
    ll ans = 0;
    for (int i = 0; i < sz(s); i++) {
        if (used[i]) continue;
        int l = i + get(1, 0, sz(s)-1, i), r;
        if (s[i] < 0) {
            r = *pos[abs(s[i])].begin();
            used[r] = 1;
            if (i + 1 != r) {
                update(1, 0, sz(s)-1, i+1, r-1);
            }
            r += get(1, 0, sz(s)-1, r);
            ans += r-l-1;
        }
        else {
            r = *neg[abs(s[i])].begin();
            used[r] = 1; 
            if (i + 1 != r) {
                update(1, 0, sz(s)-1, i+1, r-1);
            }
            r += get(1, 0, sz(s)-1, r);
            ans += r-l;
        }
        neg[abs(s[i])].erase(neg[abs(s[i])].begin());
        pos[abs(s[i])].erase(pos[abs(s[i])].begin());
    }
    return ans;
}

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 1 ms 212 KB Output is correct
4 Correct 0 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 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 308 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 312 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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 11 ms 3908 KB Output is correct
21 Correct 11 ms 3896 KB Output is correct
22 Correct 121 ms 35432 KB Output is correct
23 Correct 88 ms 31284 KB Output is correct
24 Correct 113 ms 35348 KB Output is correct
25 Correct 130 ms 35232 KB Output is correct
26 Correct 115 ms 35440 KB Output is correct
27 Correct 87 ms 31036 KB Output is correct
28 Correct 130 ms 35372 KB Output is correct
29 Correct 136 ms 35404 KB Output is correct
30 Correct 128 ms 35368 KB Output is correct
31 Correct 110 ms 35404 KB Output is correct
32 Correct 146 ms 35376 KB Output is correct
33 Correct 131 ms 35276 KB Output is correct
34 Correct 134 ms 35540 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 134 ms 35388 KB Output is correct
38 Correct 133 ms 35352 KB Output is correct
39 Correct 126 ms 35392 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 127 ms 35392 KB Output is correct
6 Correct 166 ms 35404 KB Output is correct
7 Correct 132 ms 35480 KB Output is correct
8 Correct 121 ms 35396 KB Output is correct
9 Correct 131 ms 35420 KB Output is correct
10 Correct 139 ms 35380 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 1 ms 212 KB Output is correct
4 Correct 0 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 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 308 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 312 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 308 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 576 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 572 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 2 ms 596 KB Output is correct
52 Correct 1 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 1 ms 212 KB Output is correct
4 Correct 0 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 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 308 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 312 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 312 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 304 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 312 KB Output is correct
49 Correct 1 ms 308 KB Output is correct
50 Correct 1 ms 312 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Correct 2 ms 596 KB Output is correct
53 Correct 2 ms 596 KB Output is correct
54 Correct 11 ms 3908 KB Output is correct
55 Correct 11 ms 3896 KB Output is correct
56 Correct 121 ms 35432 KB Output is correct
57 Correct 88 ms 31284 KB Output is correct
58 Correct 113 ms 35348 KB Output is correct
59 Correct 130 ms 35232 KB Output is correct
60 Correct 115 ms 35440 KB Output is correct
61 Correct 87 ms 31036 KB Output is correct
62 Correct 130 ms 35372 KB Output is correct
63 Correct 136 ms 35404 KB Output is correct
64 Correct 128 ms 35368 KB Output is correct
65 Correct 110 ms 35404 KB Output is correct
66 Correct 146 ms 35376 KB Output is correct
67 Correct 131 ms 35276 KB Output is correct
68 Correct 134 ms 35540 KB Output is correct
69 Correct 1 ms 312 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 134 ms 35388 KB Output is correct
72 Correct 133 ms 35352 KB Output is correct
73 Correct 126 ms 35392 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 127 ms 35392 KB Output is correct
79 Correct 166 ms 35404 KB Output is correct
80 Correct 132 ms 35480 KB Output is correct
81 Correct 121 ms 35396 KB Output is correct
82 Correct 131 ms 35420 KB Output is correct
83 Correct 139 ms 35380 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 1 ms 308 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 576 KB Output is correct
89 Correct 2 ms 596 KB Output is correct
90 Correct 2 ms 572 KB Output is correct
91 Correct 3 ms 596 KB Output is correct
92 Correct 1 ms 596 KB Output is correct
93 Correct 1 ms 596 KB Output is correct
94 Correct 2 ms 596 KB Output is correct
95 Correct 2 ms 596 KB Output is correct
96 Correct 2 ms 596 KB Output is correct
97 Correct 1 ms 596 KB Output is correct
98 Correct 2 ms 596 KB Output is correct
99 Correct 1 ms 596 KB Output is correct
100 Correct 1 ms 596 KB Output is correct
101 Correct 13 ms 3824 KB Output is correct
102 Correct 15 ms 3796 KB Output is correct
103 Correct 169 ms 35532 KB Output is correct
104 Correct 100 ms 31252 KB Output is correct
105 Correct 145 ms 35432 KB Output is correct
106 Correct 130 ms 35344 KB Output is correct
107 Correct 142 ms 35408 KB Output is correct
108 Correct 98 ms 31276 KB Output is correct
109 Correct 140 ms 35384 KB Output is correct
110 Correct 130 ms 35444 KB Output is correct
111 Correct 154 ms 35416 KB Output is correct
112 Correct 159 ms 35392 KB Output is correct
113 Correct 172 ms 35388 KB Output is correct
114 Correct 147 ms 35412 KB Output is correct
115 Correct 127 ms 35428 KB Output is correct