oj.uz

Submission #735309

# Submission time Handle Problem Language Result Execution time Memory
735309 2023-05-04T00:12:34 Z That_Salamander Arranging Shoes (IOI19_shoes) C++17
100 / 100
 413 ms 153952 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <cstring>
#include <queue>
#include <unordered_set>
#include <unordered_map>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

ll countSwapsAndSort(vector<int>& s) {
    if (s.size() == 1) return 0;
    if (s.size() == 2) {
        if (s[0] > s[1]) {
            swap(s[0], s[1]);
            return 1;
        }

        return 0;
    }

    vector<int> left, right;
    int m = s.size() / 2;

    FOR(i, m) {
        left.push_back(s[i]);
    }

    FORB(i, m, s.size()) {
        right.push_back(s[i]);
    }

    ll res = 0;
    res += countSwapsAndSort(left);
    res += countSwapsAndSort(right);

    s.clear();

    int iLeft = 0;
    int iRight = 0;

    while (iLeft < left.size() && iRight < right.size()) {
        if (left[iLeft] < right[iRight]) {
            s.push_back(left[iLeft++]);
        } else {
            res += (left.size() - iLeft);
            s.push_back(right[iRight++]);
        }
    }

    FORB(i, iLeft, left.size()) s.push_back(left[i]);
    FORB(i, iRight, right.size()) s.push_back(right[i]);

    return res;
}

/*ll count_swaps(vector<int> s) {
    vector<int> perm(s.size());
    FOR(i, s.size()) perm[i] = i;
    ll res = 1000000000000000000ll;

    do {
        bool valid = true;
        for (int i = 0; i < s.size(); i += 2) {
            if (s[perm[i]] > 0 || s[perm[i + 1]] < 0) {
                valid = false;
                break;
            }

            if (s[perm[i]] != -s[perm[i + 1]]) {
                valid = false;
                break;
            }
        }

        if (!valid) continue;

        vector<int> inv(s.size());
        FOR(i, s.size()) {
            inv[perm[i]] = i;
        }

        res = min(res, countSwapsAndSort(inv));
    } while(next_permutation(perm.begin(), perm.end()));

    return res;
}*/

ll count_swaps(vector<int> s) {
    unordered_map<int, queue<int>> last;
    set<pair<int, int>> pairs;

    FOR(i, s.size()) {
        int x = s[i];
        if (last[-x].size()) {
            pairs.insert({last[-x].front(), i});
            last[-x].pop();
        } else {
            last[x].push(i);
        }
    }

    vector<int> inv(s.size());
    int i = 0;

    for (auto p: pairs) {
        if (s[p.first] > 0) swap(p.first, p.second);
        inv[p.first] = i++;
        inv[p.second] = i++;
    }

    return countSwapsAndSort(inv);
}

#ifdef LOCAL_TEST
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    vector<int> s(n * 2);

    for (int& i: s) cin >> i;

    cout << "Result: " << count_swaps(s) << endl;
}
#endif

Compilation message

shoes.cpp: In function 'll countSwapsAndSort(std::vector<int>&)':
shoes.cpp:14:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
......
   42 |     FORB(i, m, s.size()) {
      |          ~~~~~~~~~~~~~~                         
shoes.cpp:42:5: note: in expansion of macro 'FORB'
   42 |     FORB(i, m, s.size()) {
      |     ^~~~
shoes.cpp:55:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     while (iLeft < left.size() && iRight < right.size()) {
      |            ~~~~~~^~~~~~~~~~~~~
shoes.cpp:55:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     while (iLeft < left.size() && iRight < right.size()) {
      |                                   ~~~~~~~^~~~~~~~~~~~~~
shoes.cpp:14:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
......
   64 |     FORB(i, iLeft, left.size()) s.push_back(left[i]);
      |          ~~~~~~~~~~~~~~~~~~~~~                  
shoes.cpp:64:5: note: in expansion of macro 'FORB'
   64 |     FORB(i, iLeft, left.size()) s.push_back(left[i]);
      |     ^~~~
shoes.cpp:14:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
......
   65 |     FORB(i, iRight, right.size()) s.push_back(right[i]);
      |          ~~~~~~~~~~~~~~~~~~~~~~~                
shoes.cpp:65:5: note: in expansion of macro 'FORB'
   65 |     FORB(i, iRight, right.size()) s.push_back(right[i]);
      |     ^~~~
shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:13:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | #define FOR(var,bound) for(int var = 0; var < bound; var++)
......
  106 |     FOR(i, s.size()) {
      |         ~~~~~~~~~~~                          
shoes.cpp:106:5: note: in expansion of macro 'FOR'
  106 |     FOR(i, s.size()) {
      |     ^~~

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 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 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 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 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 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 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 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 224 KB Output is correct
29 Correct 1 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 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 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 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 1 ms 304 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 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 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 2 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 8 ms 1316 KB Output is correct
21 Correct 12 ms 1236 KB Output is correct
22 Correct 94 ms 10188 KB Output is correct
23 Correct 88 ms 10192 KB Output is correct
24 Correct 98 ms 10168 KB Output is correct
25 Correct 80 ms 10088 KB Output is correct
26 Correct 96 ms 10184 KB Output is correct
27 Correct 88 ms 10080 KB Output is correct
28 Correct 97 ms 10404 KB Output is correct
29 Correct 83 ms 10188 KB Output is correct
30 Correct 85 ms 10296 KB Output is correct
31 Correct 89 ms 10256 KB Output is correct
32 Correct 89 ms 10172 KB Output is correct
33 Correct 84 ms 9976 KB Output is correct
34 Correct 80 ms 10280 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 93 ms 10368 KB Output is correct
38 Correct 90 ms 10152 KB Output is correct
39 Correct 85 ms 10264 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 300 KB Output is correct
5 Correct 336 ms 153932 KB Output is correct
6 Correct 124 ms 22696 KB Output is correct
7 Correct 312 ms 153896 KB Output is correct
8 Correct 93 ms 10296 KB Output is correct
9 Correct 333 ms 153952 KB Output is correct
10 Correct 217 ms 82104 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 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 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 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 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 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 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 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 224 KB Output is correct
29 Correct 1 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 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 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 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 2 ms 1748 KB Output is correct
43 Correct 2 ms 1620 KB Output is correct
44 Correct 2 ms 1364 KB Output is correct
45 Correct 2 ms 1236 KB Output is correct
46 Correct 2 ms 1108 KB Output is correct
47 Correct 2 ms 980 KB Output is correct
48 Correct 2 ms 820 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 3 ms 1716 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 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 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 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 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 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 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 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 224 KB Output is correct
29 Correct 1 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 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 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 1 ms 304 KB Output is correct
40 Correct 1 ms 300 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 296 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 296 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 8 ms 1316 KB Output is correct
55 Correct 12 ms 1236 KB Output is correct
56 Correct 94 ms 10188 KB Output is correct
57 Correct 88 ms 10192 KB Output is correct
58 Correct 98 ms 10168 KB Output is correct
59 Correct 80 ms 10088 KB Output is correct
60 Correct 96 ms 10184 KB Output is correct
61 Correct 88 ms 10080 KB Output is correct
62 Correct 97 ms 10404 KB Output is correct
63 Correct 83 ms 10188 KB Output is correct
64 Correct 85 ms 10296 KB Output is correct
65 Correct 89 ms 10256 KB Output is correct
66 Correct 89 ms 10172 KB Output is correct
67 Correct 84 ms 9976 KB Output is correct
68 Correct 80 ms 10280 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 93 ms 10368 KB Output is correct
72 Correct 90 ms 10152 KB Output is correct
73 Correct 85 ms 10264 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 300 KB Output is correct
78 Correct 336 ms 153932 KB Output is correct
79 Correct 124 ms 22696 KB Output is correct
80 Correct 312 ms 153896 KB Output is correct
81 Correct 93 ms 10296 KB Output is correct
82 Correct 333 ms 153952 KB Output is correct
83 Correct 217 ms 82104 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 596 KB Output is correct
88 Correct 2 ms 1748 KB Output is correct
89 Correct 2 ms 1748 KB Output is correct
90 Correct 2 ms 1620 KB Output is correct
91 Correct 2 ms 1364 KB Output is correct
92 Correct 2 ms 1236 KB Output is correct
93 Correct 2 ms 1108 KB Output is correct
94 Correct 2 ms 980 KB Output is correct
95 Correct 2 ms 820 KB Output is correct
96 Correct 2 ms 596 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 3 ms 1716 KB Output is correct
100 Correct 2 ms 1748 KB Output is correct
101 Correct 27 ms 14028 KB Output is correct
102 Correct 12 ms 4084 KB Output is correct
103 Correct 413 ms 153932 KB Output is correct
104 Correct 337 ms 153848 KB Output is correct
105 Correct 291 ms 91684 KB Output is correct
106 Correct 303 ms 153932 KB Output is correct
107 Correct 146 ms 26168 KB Output is correct
108 Correct 156 ms 42248 KB Output is correct
109 Correct 81 ms 10280 KB Output is correct
110 Correct 81 ms 10280 KB Output is correct
111 Correct 314 ms 138228 KB Output is correct
112 Correct 298 ms 121256 KB Output is correct
113 Correct 192 ms 27880 KB Output is correct
114 Correct 303 ms 153932 KB Output is correct
115 Correct 319 ms 153864 KB Output is correct