oj.uz

Submission #875185

# Submission time Handle Problem Language Result Execution time Memory
875185 2023-11-18T18:42:37 Z StefanL2005 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 92 ms 18904 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

void update(int node, int left, int right, int point, vector<int> &tree)
{
    if (left == right)
        tree[node] = 1;
    else
    {
        int m = (left + right) / 2;
 
        if (point <= m)
            update(2*node, left, m, point, tree);
        else
            update(2*node + 1, m + 1, right, point , tree);
    
        tree[node] = tree[2*node] + tree[2*node + 1];
    }
}
 
int querry(int node, int l, int r, int ql, int qr, vector<int> &tree)
{
    if (ql <= l && r <= qr)
        return tree[node];
    
    int m = (l + r) / 2;
 
    if (qr <= m)
        return querry(2 * node, l, m, ql, qr, tree);
    if (ql > m)
        return querry(2 * node + 1, m + 1, r, ql, qr, tree);
    
    return querry(2 * node, l, m, ql, qr, tree) + querry(2 * node + 1, m + 1, r, ql, qr, tree);
}

ll count_swaps (vector<int> S)
{
    int n = S.size() / 2;
    ll ans = 0;
    vector<int> Taken(2 * n, 0);
    vector<int> Tree(8 * n, 0);
    vector<vector<int>> Poz(2 * n + 1);
    vector<int> l(2*n + 1, 0);

    for (int i = 0; i < 2 * n; i++)
    {
        if (S[i] < 0)
            Poz[abs(S[i])].push_back(i);
        else
            Poz[S[i] + n].push_back(i);
    }
    
    for (int i = 0; i < 2 * n; i++)
    {
        if (Taken[i] == 1)
            continue;

        int p1 = Poz[abs(S[i])][l[abs(S[i])]];
        int p2 = Poz[abs(S[i]) + n][l[abs(S[i]) + n]];

        l[abs(S[i])]++;
        l[abs(S[i]) + n]++;
        Taken[p1] = 1; Taken[p2] = 1;

        if (p2 == p1 + 1)
            continue;
            
        if (p1 < p2)
            ans += p2 - p1 - 1 - querry(1, 0, 2*n-1, p1, p2, Tree);
        else    
            ans += p1 - p2 - querry(1, 0, 2*n-1, p2, p1, Tree);

        update(1, 0, 2*n-1, p1, Tree);
        update(1, 0, 2*n-1, p2, Tree);
        Taken[p1] = 1; Taken[p2] = 1;
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 8 ms 1628 KB Output is correct
21 Correct 5 ms 1624 KB Output is correct
22 Correct 51 ms 13440 KB Output is correct
23 Correct 19 ms 13528 KB Output is correct
24 Correct 52 ms 13528 KB Output is correct
25 Correct 53 ms 13516 KB Output is correct
26 Correct 66 ms 13672 KB Output is correct
27 Correct 43 ms 13268 KB Output is correct
28 Correct 55 ms 13612 KB Output is correct
29 Correct 53 ms 13772 KB Output is correct
30 Correct 56 ms 13744 KB Output is correct
31 Correct 51 ms 13404 KB Output is correct
32 Correct 51 ms 13768 KB Output is correct
33 Correct 50 ms 13524 KB Output is correct
34 Correct 51 ms 13768 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 51 ms 13780 KB Output is correct
38 Correct 50 ms 13768 KB Output is correct
39 Correct 61 ms 13772 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 81 ms 17648 KB Output is correct
6 Correct 58 ms 12856 KB Output is correct
7 Correct 68 ms 17500 KB Output is correct
8 Correct 51 ms 12276 KB Output is correct
9 Correct 66 ms 17652 KB Output is correct
10 Correct 84 ms 14568 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 428 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 436 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 8 ms 1628 KB Output is correct
55 Correct 5 ms 1624 KB Output is correct
56 Correct 51 ms 13440 KB Output is correct
57 Correct 19 ms 13528 KB Output is correct
58 Correct 52 ms 13528 KB Output is correct
59 Correct 53 ms 13516 KB Output is correct
60 Correct 66 ms 13672 KB Output is correct
61 Correct 43 ms 13268 KB Output is correct
62 Correct 55 ms 13612 KB Output is correct
63 Correct 53 ms 13772 KB Output is correct
64 Correct 56 ms 13744 KB Output is correct
65 Correct 51 ms 13404 KB Output is correct
66 Correct 51 ms 13768 KB Output is correct
67 Correct 50 ms 13524 KB Output is correct
68 Correct 51 ms 13768 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 51 ms 13780 KB Output is correct
72 Correct 50 ms 13768 KB Output is correct
73 Correct 61 ms 13772 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 1 ms 504 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 81 ms 17648 KB Output is correct
79 Correct 58 ms 12856 KB Output is correct
80 Correct 68 ms 17500 KB Output is correct
81 Correct 51 ms 12276 KB Output is correct
82 Correct 66 ms 17652 KB Output is correct
83 Correct 84 ms 14568 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 1 ms 348 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 1 ms 348 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 1 ms 604 KB Output is correct
100 Correct 1 ms 604 KB Output is correct
101 Correct 7 ms 2136 KB Output is correct
102 Correct 7 ms 1628 KB Output is correct
103 Correct 92 ms 18744 KB Output is correct
104 Correct 35 ms 18860 KB Output is correct
105 Correct 70 ms 16220 KB Output is correct
106 Correct 74 ms 18768 KB Output is correct
107 Correct 58 ms 14204 KB Output is correct
108 Correct 54 ms 14604 KB Output is correct
109 Correct 55 ms 13748 KB Output is correct
110 Correct 51 ms 13736 KB Output is correct
111 Correct 71 ms 18216 KB Output is correct
112 Correct 80 ms 17492 KB Output is correct
113 Correct 77 ms 14224 KB Output is correct
114 Correct 72 ms 18776 KB Output is correct
115 Correct 73 ms 18904 KB Output is correct