oj.uz

Submission #164587

# Submission time Handle Problem Language Result Execution time Memory
164587 2019-11-21T17:22:31 Z qwerty234 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 216 ms 21752 KB 
#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
 
 
using namespace std;
 
 
const int N = 4e5 + 219;
const ll M = 3e5 + 19;
const ll inf = 1e15 + 10;
const ll mod = 1e9 + 7;
 
 
ll n, a[N], Last[N], Lastt[N], curL[N], curR[N], curL1[N], curR1[N], nx[N], prv[N], t[4 * N];
bool vis[N];
 
 
void upd(int v, int tl, int tr, int pos) {
    if (tl == tr) {
        t[v] = 1;
        return;
    }
    int tm = (tl + tr) / 2;
    if (pos <= tm)
        upd(v * 2, tl, tm, pos);
    else
        upd(v * 2 + 1, tm + 1, tr, pos);
    t[v] = t[v * 2] + t[v * 2 + 1];
}
 
 
ll get(int v, int tl, int tr, int l, int r) {
    if (r < tl || tr < l)
        return 0;
    int tm = (tl + tr) / 2;
    if (l <= tl && tr <= r)
        return t[v];
    return get(v * 2, tl, tm, l, r) + get(v * 2 + 1, tm + 1, tr, l, r);
}
 
 
ll count_swaps(vector <int> b) {
    n = b.size();
    for (int i = 0; i < b.size(); i++)
        a[i + 1] = b[i];
    for (int i = 1; i <= n; i++) {
        if (a[i] < 0) {
            prv[i] = Lastt[-a[i]];
            curR1[-a[i]] = i;
            Lastt[-a[i]] = i;
        } else {
            prv[i] = Last[a[i]];
            curR[a[i]] = i;
            Last[a[i]] = i;
        }
    }
    memset(Last, 0, sizeof(Last));
    memset(Lastt, 0, sizeof(Lastt));
    for (int i = n; i >= 1; i--) {
        if (a[i] < 0) {
            nx[i] = Lastt[-a[i]];
            curL1[-a[i]] = i;
            Lastt[-a[i]] = i;
        } else {
            nx[i] = Last[a[i]];
            curL[a[i]] = i;
            Last[a[i]] = i;
        }
    }
    ll ans = 0, t1, t2;
    ll L = 1, R = n;
    while (L <= R) {
        int crl, crr;
        if (a[L] < 0)
            t1 = curL[-a[L]] - L - get(1, 1, n, L, curL[-a[L]]) - 1;
        else
            t1 = curL1[a[L]] - L - get(1, 1, n, L, curL1[a[L]]) - 1;
        if (a[L] > 0)
            t1++;
        if (a[R] < 0)
            t2 = R - curR[-a[R]] - get(1, 1, n, curR[-a[R]], R) - 1;
        else
            t2 = R - curR1[a[R]] - get(1, 1, n, curR1[a[R]], R) - 1;
        if (a[R] < 0)
            t2++;
        if (t1 < t2) {
            ans += t1;
            if (a[L] < 0) {
                vis[L] = vis[curL[-a[L]]] = 1;
                upd(1, 1, n, L);
                upd(1, 1, n, curL[-a[L]]);
                curL1[-a[L]] = nx[curL1[-a[L]]];
                curL[-a[L]] = nx[curL[-a[L]]];
            } else {
                vis[L] = vis[curL1[a[L]]] = 1;
                upd(1, 1, n, L);
                upd(1, 1, n, curL1[a[L]]);
                curL[a[L]] = nx[curL[a[L]]];
                curL1[a[L]] = nx[curL1[a[L]]];
            }
        } else {
            ans += t2;
            if (a[R] < 0) {
                vis[R] = vis[curR[-a[R]]] = 1;
                upd(1, 1, n, R);
                upd(1, 1, n, curR[-a[R]]);
                curR1[-a[R]] = prv[curR1[-a[R]]];
                curR[-a[R]] = prv[curR[-a[R]]];
            } else {
                vis[R] = vis[curR1[a[R]]] = 1;
                upd(1, 1, n, R);
                upd(1, 1, n, curR1[a[R]]);
                curR[a[R]] = prv[curR[a[R]]];
                curR1[a[R]] = prv[curR1[a[R]]];
            }
        }
        while (vis[L])
            L++;
        while (vis[R])
            R--;
        if (R < L || L > n || R < 0)
            break;
    }
    return ans;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:49:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < b.size(); i++)
                     ~~^~~~~~~~~~
shoes.cpp:78:13: warning: unused variable 'crl' [-Wunused-variable]
         int crl, crr;
             ^~~
shoes.cpp:78:18: warning: unused variable 'crr' [-Wunused-variable]
         int crl, crr;
                  ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 7 ms 6648 KB Output is correct
4 Correct 8 ms 6648 KB Output is correct
5 Correct 7 ms 6648 KB Output is correct
6 Correct 7 ms 6648 KB Output is correct
7 Correct 7 ms 6648 KB Output is correct
8 Correct 8 ms 6648 KB Output is correct
9 Correct 8 ms 6652 KB Output is correct
10 Correct 7 ms 6648 KB Output is correct
11 Correct 19 ms 6648 KB Output is correct
12 Correct 7 ms 6648 KB Output is correct
13 Correct 8 ms 6648 KB Output is correct
14 Correct 8 ms 6636 KB Output is correct
15 Correct 7 ms 6648 KB Output is correct
16 Correct 8 ms 6648 KB Output is correct
17 Correct 8 ms 6648 KB Output is correct
18 Correct 8 ms 6776 KB Output is correct
19 Correct 9 ms 6776 KB Output is correct
20 Correct 17 ms 7928 KB Output is correct
21 Correct 17 ms 7928 KB Output is correct
22 Correct 113 ms 18424 KB Output is correct
23 Correct 103 ms 18424 KB Output is correct
24 Correct 108 ms 18516 KB Output is correct
25 Correct 106 ms 18364 KB Output is correct
26 Correct 111 ms 18524 KB Output is correct
27 Correct 96 ms 18296 KB Output is correct
28 Correct 106 ms 18524 KB Output is correct
29 Correct 106 ms 18556 KB Output is correct
30 Correct 107 ms 18524 KB Output is correct
31 Correct 113 ms 18488 KB Output is correct
32 Correct 107 ms 18552 KB Output is correct
33 Correct 106 ms 18424 KB Output is correct
34 Correct 109 ms 18616 KB Output is correct
35 Correct 8 ms 6648 KB Output is correct
36 Correct 7 ms 6648 KB Output is correct
37 Correct 112 ms 18424 KB Output is correct
38 Correct 106 ms 18552 KB Output is correct
39 Correct 110 ms 18524 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 7 ms 6648 KB Output is correct
4 Correct 7 ms 6648 KB Output is correct
5 Correct 133 ms 20316 KB Output is correct
6 Correct 126 ms 20316 KB Output is correct
7 Correct 133 ms 20344 KB Output is correct
8 Correct 216 ms 17272 KB Output is correct
9 Correct 132 ms 20536 KB Output is correct
10 Correct 174 ms 20368 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 7 ms 6648 KB Output is correct
3 Correct 7 ms 6648 KB Output is correct
4 Correct 8 ms 6648 KB Output is correct
5 Correct 7 ms 6648 KB Output is correct
6 Correct 7 ms 6648 KB Output is correct
7 Correct 8 ms 6652 KB Output is correct
8 Correct 8 ms 6648 KB Output is correct
9 Correct 8 ms 6648 KB Output is correct
10 Correct 8 ms 6648 KB Output is correct
11 Correct 8 ms 6648 KB Output is correct
12 Correct 7 ms 6648 KB Output is correct
13 Correct 7 ms 6648 KB Output is correct
14 Correct 8 ms 6648 KB Output is correct
15 Correct 8 ms 6648 KB Output is correct
16 Correct 8 ms 6648 KB Output is correct
17 Correct 8 ms 6648 KB Output is correct
18 Correct 8 ms 6648 KB Output is correct
19 Correct 8 ms 6624 KB Output is correct
20 Correct 8 ms 6648 KB Output is correct
21 Correct 8 ms 6648 KB Output is correct
22 Correct 8 ms 6648 KB Output is correct
23 Correct 8 ms 6772 KB Output is correct
24 Correct 8 ms 6648 KB Output is correct
25 Correct 8 ms 6648 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 8 ms 6648 KB Output is correct
28 Correct 8 ms 6648 KB Output is correct
29 Correct 8 ms 6648 KB Output is correct
30 Correct 7 ms 6648 KB Output is correct
31 Correct 8 ms 6648 KB Output is correct
32 Correct 8 ms 6648 KB Output is correct
33 Correct 7 ms 6648 KB Output is correct
34 Correct 7 ms 6648 KB Output is correct
35 Correct 7 ms 6724 KB Output is correct
36 Correct 7 ms 6648 KB Output is correct
37 Correct 7 ms 6648 KB Output is correct
38 Correct 8 ms 6648 KB Output is correct
39 Correct 7 ms 6648 KB Output is correct
40 Correct 7 ms 6648 KB Output is correct
41 Correct 7 ms 6648 KB Output is correct
42 Correct 8 ms 6648 KB Output is correct
43 Correct 8 ms 6652 KB Output is correct
44 Correct 7 ms 6648 KB Output is correct
45 Correct 19 ms 6648 KB Output is correct
46 Correct 7 ms 6648 KB Output is correct
47 Correct 8 ms 6648 KB Output is correct
48 Correct 8 ms 6636 KB Output is correct
49 Correct 7 ms 6648 KB Output is correct
50 Correct 8 ms 6648 KB Output is correct
51 Correct 8 ms 6648 KB Output is correct
52 Correct 8 ms 6776 KB Output is correct
53 Correct 9 ms 6776 KB Output is correct
54 Correct 17 ms 7928 KB Output is correct
55 Correct 17 ms 7928 KB Output is correct
56 Correct 113 ms 18424 KB Output is correct
57 Correct 103 ms 18424 KB Output is correct
58 Correct 108 ms 18516 KB Output is correct
59 Correct 106 ms 18364 KB Output is correct
60 Correct 111 ms 18524 KB Output is correct
61 Correct 96 ms 18296 KB Output is correct
62 Correct 106 ms 18524 KB Output is correct
63 Correct 106 ms 18556 KB Output is correct
64 Correct 107 ms 18524 KB Output is correct
65 Correct 113 ms 18488 KB Output is correct
66 Correct 107 ms 18552 KB Output is correct
67 Correct 106 ms 18424 KB Output is correct
68 Correct 109 ms 18616 KB Output is correct
69 Correct 8 ms 6648 KB Output is correct
70 Correct 7 ms 6648 KB Output is correct
71 Correct 112 ms 18424 KB Output is correct
72 Correct 106 ms 18552 KB Output is correct
73 Correct 110 ms 18524 KB Output is correct
74 Correct 7 ms 6648 KB Output is correct
75 Correct 7 ms 6648 KB Output is correct
76 Correct 7 ms 6648 KB Output is correct
77 Correct 7 ms 6648 KB Output is correct
78 Correct 133 ms 20316 KB Output is correct
79 Correct 126 ms 20316 KB Output is correct
80 Correct 133 ms 20344 KB Output is correct
81 Correct 216 ms 17272 KB Output is correct
82 Correct 132 ms 20536 KB Output is correct
83 Correct 174 ms 20368 KB Output is correct
84 Correct 7 ms 6648 KB Output is correct
85 Correct 7 ms 6648 KB Output is correct
86 Correct 8 ms 6648 KB Output is correct
87 Correct 8 ms 6648 KB Output is correct
88 Correct 8 ms 6776 KB Output is correct
89 Correct 8 ms 6776 KB Output is correct
90 Correct 8 ms 6776 KB Output is correct
91 Correct 8 ms 6776 KB Output is correct
92 Correct 9 ms 6776 KB Output is correct
93 Correct 8 ms 6776 KB Output is correct
94 Correct 8 ms 6776 KB Output is correct
95 Correct 8 ms 6776 KB Output is correct
96 Correct 9 ms 6776 KB Output is correct
97 Correct 8 ms 6776 KB Output is correct
98 Correct 8 ms 6776 KB Output is correct
99 Correct 9 ms 6776 KB Output is correct
100 Correct 8 ms 6780 KB Output is correct
101 Correct 20 ms 8184 KB Output is correct
102 Correct 20 ms 8148 KB Output is correct
103 Correct 183 ms 21752 KB Output is correct
104 Correct 123 ms 21544 KB Output is correct
105 Correct 147 ms 21624 KB Output is correct
106 Correct 158 ms 21580 KB Output is correct
107 Correct 140 ms 21644 KB Output is correct
108 Correct 133 ms 21588 KB Output is correct
109 Correct 121 ms 18424 KB Output is correct
110 Correct 108 ms 18460 KB Output is correct
111 Correct 128 ms 21624 KB Output is correct
112 Correct 176 ms 21752 KB Output is correct
113 Correct 180 ms 21752 KB Output is correct
114 Correct 151 ms 21576 KB Output is correct
115 Correct 150 ms 21624 KB Output is correct