oj.uz

Submission #823199

# Submission time Handle Problem Language Result Execution time Memory
823199 2023-08-12T09:17:08 Z vjudge1 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 50 ms 16428 KB 
#include "shoes.h"

#include <bits/stdc++.h>

using namespace std;

struct fenwick {
    vector<int> t;
    fenwick(int N) : t(N + 1, 0) {}

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

    int get(int x) {
        int res = 0;
        while (x > 0) {
            res += t[x];
            x -= x & -x;
        }
        return res;
    }
};

long long count_swaps(std::vector<int> s) {
    vector<vector<int>> A(s.size() / 2);
    vector<vector<int>> B(s.size() / 2);
    for (int i = 0; i < s.size(); i++) {
        int x = abs(s[i]) - 1;
        if (s[i] < 0) {
            A[x].push_back(i);
        } else {
            B[x].push_back(i);
        }
    }
    for (int i = 0; i < s.size() / 2; i++) {
        reverse(A[i].begin(), A[i].end());
        reverse(B[i].begin(), B[i].end());
    }
    vector<int> used(s.size(), 0);
    vector<int> p(s.size());
    for (int i = 0, j = 1; i < s.size(); i++) {
        if (used[i]) {
            continue;
        }
        int x = abs(s[i]) - 1;
        p[A[x].back()] = j++;
        p[B[x].back()] = j++;
        used[A[x].back()] = used[B[x].back()] = true;
        A[x].pop_back();
        B[x].pop_back();
    }

    long long res = 0;
    fenwick tree(s.size() + 1);
    for (int i = s.size() - 1; i >= 0; i--) {
        res += tree.get(p[i]);
        tree.upd(p[i], 1);
    }

    return res;
}

Compilation message

shoes.cpp: In member function 'void fenwick::upd(int, int)':
shoes.cpp:12:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         while (x < t.size()) {
      |                ~~^~~~~~~~~~
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
shoes.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for (int i = 0; i < s.size() / 2; i++) {
      |                     ~~^~~~~~~~~~~~~~
shoes.cpp:45:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0, j = 1; i < s.size(); i++) {
      |                            ~~^~~~~~~~~~

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 1 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 292 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 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 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 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 0 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 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 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 1364 KB Output is correct
21 Correct 3 ms 1364 KB Output is correct
22 Correct 27 ms 9928 KB Output is correct
23 Correct 32 ms 11156 KB Output is correct
24 Correct 30 ms 11172 KB Output is correct
25 Correct 35 ms 10784 KB Output is correct
26 Correct 41 ms 11192 KB Output is correct
27 Correct 32 ms 10948 KB Output is correct
28 Correct 27 ms 11040 KB Output is correct
29 Correct 28 ms 11044 KB Output is correct
30 Correct 22 ms 11052 KB Output is correct
31 Correct 27 ms 11100 KB Output is correct
32 Correct 22 ms 11052 KB Output is correct
33 Correct 21 ms 10792 KB Output is correct
34 Correct 23 ms 11120 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 22 ms 11092 KB Output is correct
38 Correct 23 ms 11032 KB Output is correct
39 Correct 22 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 37 ms 15204 KB Output is correct
6 Correct 27 ms 11596 KB Output is correct
7 Correct 42 ms 16428 KB Output is correct
8 Correct 21 ms 11084 KB Output is correct
9 Correct 40 ms 16392 KB Output is correct
10 Correct 33 ms 13236 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 1 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 292 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 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 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 296 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 300 KB Output is correct
41 Correct 1 ms 340 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 340 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 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 312 KB Output is correct
51 Correct 1 ms 312 KB Output is correct
52 Correct 1 ms 444 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 1 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 292 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 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 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 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 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 300 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 296 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 308 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 3 ms 1364 KB Output is correct
55 Correct 3 ms 1364 KB Output is correct
56 Correct 27 ms 9928 KB Output is correct
57 Correct 32 ms 11156 KB Output is correct
58 Correct 30 ms 11172 KB Output is correct
59 Correct 35 ms 10784 KB Output is correct
60 Correct 41 ms 11192 KB Output is correct
61 Correct 32 ms 10948 KB Output is correct
62 Correct 27 ms 11040 KB Output is correct
63 Correct 28 ms 11044 KB Output is correct
64 Correct 22 ms 11052 KB Output is correct
65 Correct 27 ms 11100 KB Output is correct
66 Correct 22 ms 11052 KB Output is correct
67 Correct 21 ms 10792 KB Output is correct
68 Correct 23 ms 11120 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 22 ms 11092 KB Output is correct
72 Correct 23 ms 11032 KB Output is correct
73 Correct 22 ms 11040 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 1 ms 296 KB Output is correct
78 Correct 37 ms 15204 KB Output is correct
79 Correct 27 ms 11596 KB Output is correct
80 Correct 42 ms 16428 KB Output is correct
81 Correct 21 ms 11084 KB Output is correct
82 Correct 40 ms 16392 KB Output is correct
83 Correct 33 ms 13236 KB Output is correct
84 Correct 0 ms 296 KB Output is correct
85 Correct 0 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 ms 300 KB Output is correct
88 Correct 1 ms 340 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 340 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 340 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 1 ms 312 KB Output is correct
98 Correct 1 ms 312 KB Output is correct
99 Correct 1 ms 444 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 5 ms 1748 KB Output is correct
102 Correct 6 ms 1384 KB Output is correct
103 Correct 50 ms 16408 KB Output is correct
104 Correct 39 ms 16380 KB Output is correct
105 Correct 49 ms 13772 KB Output is correct
106 Correct 40 ms 16296 KB Output is correct
107 Correct 33 ms 11724 KB Output is correct
108 Correct 31 ms 12108 KB Output is correct
109 Correct 23 ms 11340 KB Output is correct
110 Correct 22 ms 11076 KB Output is correct
111 Correct 38 ms 15604 KB Output is correct
112 Correct 46 ms 14976 KB Output is correct
113 Correct 34 ms 11632 KB Output is correct
114 Correct 38 ms 16296 KB Output is correct
115 Correct 42 ms 16300 KB Output is correct