oj.uz

Submission #690967

# Submission time Handle Problem Language Result Execution time Memory
690967 2023-01-30T19:40:59 Z finn__ Arranging Shoes (IOI19_shoes) C++17
100 / 100
 81 ms 16548 KB 
#include <bits/stdc++.h>
using namespace std;
#include "shoes.h"

struct FenwickTree
{
    vector<int> t;

    FenwickTree(size_t n)
    {
        t = vector<int>(n, 0);
    }

    void prefix_increment(int i, int x)
    {
        i++;
        while (i <= t.size())
        {
            t[i - 1] += x;
            i += i & -i;
        }
    }

    void range_increment(int i, int j, int x)
    {
        prefix_increment(i, x);
        if (j < t.size() - 1)
            prefix_increment(j + 1, -x);
    }

    int point_query(int i)
    {
        i++;
        int x = 0;
        while (i)
        {
            x += t[i - 1];
            i -= i & -i;
        }
        return x;
    }
};

long long count_swaps(vector<int> s)
{
    size_t const n = s.size();
    vector<bool> processed(n, 0);
    vector<priority_queue<unsigned, vector<unsigned>, greater<unsigned>>> q(n);
    for (unsigned i = 0; i < n; i++)
        q[2 * (abs(s[i]) - 1) + (s[i] < 0)].push(i);

    long long swaps_needed = 0;
    FenwickTree tree(n);

    for (unsigned i = 0; i < n; i++)
    {
        if (!processed[i])
        {
            processed[i] = 1;
            while (processed[q[2 * (abs(s[i]) - 1) + (s[i] > 0)].top()])
                q[2 * (abs(s[i]) - 1) + (s[i] > 0)].pop();
            unsigned j = q[2 * (abs(s[i]) - 1) + (s[i] > 0)].top();
            q[2 * (abs(s[i]) - 1) + (s[i] > 0)].pop();
            processed[j] = 1;
            swaps_needed += j + tree.point_query(j) - i - tree.point_query(i) - (s[i] < 0);
            tree.range_increment(i, j, 1);
        }
    }

    return swaps_needed;
}

Compilation message

shoes.cpp: In member function 'void FenwickTree::prefix_increment(int, int)':
shoes.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         while (i <= t.size())
      |                ~~^~~~~~~~~~~
shoes.cpp: In member function 'void FenwickTree::range_increment(int, int, int)':
shoes.cpp:27:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         if (j < t.size() - 1)
      |             ~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 300 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 216 KB Output is correct
29 Correct 0 ms 216 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 300 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 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 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 5 ms 1364 KB Output is correct
21 Correct 4 ms 1364 KB Output is correct
22 Correct 44 ms 11028 KB Output is correct
23 Correct 37 ms 11032 KB Output is correct
24 Correct 46 ms 10996 KB Output is correct
25 Correct 34 ms 10920 KB Output is correct
26 Correct 42 ms 11092 KB Output is correct
27 Correct 38 ms 10844 KB Output is correct
28 Correct 35 ms 11076 KB Output is correct
29 Correct 36 ms 11080 KB Output is correct
30 Correct 36 ms 11052 KB Output is correct
31 Correct 47 ms 11160 KB Output is correct
32 Correct 37 ms 11088 KB Output is correct
33 Correct 35 ms 10928 KB Output is correct
34 Correct 34 ms 11036 KB Output is correct
35 Correct 0 ms 300 KB Output is correct
36 Correct 1 ms 216 KB Output is correct
37 Correct 38 ms 11048 KB Output is correct
38 Correct 35 ms 11048 KB Output is correct
39 Correct 41 ms 11040 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 74 ms 16548 KB Output is correct
6 Correct 46 ms 11644 KB Output is correct
7 Correct 70 ms 16412 KB Output is correct
8 Correct 36 ms 11276 KB Output is correct
9 Correct 66 ms 16428 KB Output is correct
10 Correct 62 ms 13228 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 300 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 216 KB Output is correct
29 Correct 0 ms 216 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 300 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 432 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 432 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 312 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 2 ms 340 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 300 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 216 KB Output is correct
29 Correct 0 ms 216 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 300 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 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 300 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 5 ms 1364 KB Output is correct
55 Correct 4 ms 1364 KB Output is correct
56 Correct 44 ms 11028 KB Output is correct
57 Correct 37 ms 11032 KB Output is correct
58 Correct 46 ms 10996 KB Output is correct
59 Correct 34 ms 10920 KB Output is correct
60 Correct 42 ms 11092 KB Output is correct
61 Correct 38 ms 10844 KB Output is correct
62 Correct 35 ms 11076 KB Output is correct
63 Correct 36 ms 11080 KB Output is correct
64 Correct 36 ms 11052 KB Output is correct
65 Correct 47 ms 11160 KB Output is correct
66 Correct 37 ms 11088 KB Output is correct
67 Correct 35 ms 10928 KB Output is correct
68 Correct 34 ms 11036 KB Output is correct
69 Correct 0 ms 300 KB Output is correct
70 Correct 1 ms 216 KB Output is correct
71 Correct 38 ms 11048 KB Output is correct
72 Correct 35 ms 11048 KB Output is correct
73 Correct 41 ms 11040 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 74 ms 16548 KB Output is correct
79 Correct 46 ms 11644 KB Output is correct
80 Correct 70 ms 16412 KB Output is correct
81 Correct 36 ms 11276 KB Output is correct
82 Correct 66 ms 16428 KB Output is correct
83 Correct 62 ms 13228 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 432 KB Output is correct
89 Correct 1 ms 340 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 432 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 312 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 2 ms 340 KB Output is correct
100 Correct 1 ms 432 KB Output is correct
101 Correct 5 ms 1748 KB Output is correct
102 Correct 7 ms 1364 KB Output is correct
103 Correct 81 ms 16452 KB Output is correct
104 Correct 70 ms 16416 KB Output is correct
105 Correct 63 ms 13644 KB Output is correct
106 Correct 69 ms 16428 KB Output is correct
107 Correct 47 ms 11696 KB Output is correct
108 Correct 50 ms 12080 KB Output is correct
109 Correct 36 ms 11332 KB Output is correct
110 Correct 38 ms 11048 KB Output is correct
111 Correct 65 ms 15640 KB Output is correct
112 Correct 68 ms 15008 KB Output is correct
113 Correct 46 ms 11660 KB Output is correct
114 Correct 81 ms 16332 KB Output is correct
115 Correct 69 ms 16332 KB Output is correct