oj.uz

Submission #143778

# Submission time Handle Problem Language Result Execution time Memory
143778 2019-08-15T04:48:23 Z jwvg0425 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 219 ms 24488 KB 
#include "shoes.h"
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

constexpr int clog2(int n) { return ((n < 2) ? 1 : 1 + clog2(n / 2)); }

template<typename T, typename Merge>
class SegmentTree
{
public:
    SegmentTree(Merge m)
        :merge(m) {}

    void init(vector<T>& raw_)
    {
        raw = raw_;
        n = (int)raw.size();
        int sz = (1 << (clog2(n) + 1));
        data.resize(sz);

        _init(raw, 1, 0, n - 1);
    }

    T modify(int idx, function<T(T)> modifier) { return update(idx, modifier(raw[idx])); }
    T update(int idx, const T& newVal) { raw[idx] = newVal; return _update(1, 0, n - 1, idx, newVal); }
    T query(int left, int right) { return _query(1, 0, n - 1, left, right); }

private:
    vector<T> raw;
    vector<T> data;
    int n;
    Merge merge;

    T _init(vector<T>& raw, int node, int start, int end)
    {
        int mid = (start + end) / 2;
        if (start == end)
            return data[node] = raw[start];
        else
            return data[node] = merge(_init(raw, node * 2, start, mid),
                _init(raw, node * 2 + 1, mid + 1, end));
    }

    T _update(int node, int start, int end, int index, const T& newVal)
    {
        if (index < start || index > end)
            return data[node];

        if (start == end)
            data[node] = newVal;
        else
        {
            int mid = (start + end) / 2;
            data[node] = merge(_update(node * 2, start, mid, index, newVal),
                _update(node * 2 + 1, mid + 1, end, index, newVal));
        }

        return data[node];
    }

    T _query(int node, int start, int end, int left, int right)
    {
        if (left <= start && end <= right)
            return data[node];

        int mid = (start + end) / 2;

        if (mid < left)
            return _query(node * 2 + 1, mid + 1, end, left, right);

        if (mid + 1 > right)
            return _query(node * 2, start, mid, left, right);

        return merge(_query(node * 2, start, mid, left, right),
            _query(node * 2 + 1, mid + 1, end, left, right));
    }
};

template<typename T, typename Merge>
SegmentTree<T, Merge> segTree(Merge merge)
{
    return SegmentTree<T, Merge>(merge);
}

set<int> mi[100005];
set<int> pl[100005];

long long count_swaps(vector<int> s) {
    vector<bool> used(s.size(), false);

    long long ans = 0;
    vector<int> raw(s.size(), 1);

    auto tree = segTree<int>([](const int& l, const int& r) { return l + r; });
    tree.init(raw);

    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] > 0)
            pl[s[i]].insert(i);
        else
            mi[-s[i]].insert(i);
    }

    for (int i = 0; i < s.size(); i++)
    {
        if (used[i])
            continue;

        if (s[i] > 0)
        {
            int near = *mi[s[i]].lower_bound(i);
            mi[s[i]].erase(near);
            used[near] = true;
            ans += tree.query(0, near) - tree.query(0, i);
            tree.update(near, 0);
        }
        else
        {
            int near = *pl[-s[i]].lower_bound(i);
            pl[-s[i]].erase(near);
            used[near] = true;
            ans += tree.query(0, near) - tree.query(0, i) - 1;
            tree.update(near, 0);
        }
    }

    return ans;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:118:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < s.size(); i++)
                     ~~^~~~~~~~~~
shoes.cpp:126:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < s.size(); i++)
                     ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9632 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9632 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 10 ms 9720 KB Output is correct
6 Correct 10 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 11 ms 9720 KB Output is correct
11 Correct 11 ms 9724 KB Output is correct
12 Correct 10 ms 9720 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 10 ms 9720 KB Output is correct
15 Correct 10 ms 9720 KB Output is correct
16 Correct 11 ms 9720 KB Output is correct
17 Correct 11 ms 9720 KB Output is correct
18 Correct 11 ms 9852 KB Output is correct
19 Correct 14 ms 9848 KB Output is correct
20 Correct 22 ms 11256 KB Output is correct
21 Correct 22 ms 11256 KB Output is correct
22 Correct 139 ms 24284 KB Output is correct
23 Correct 153 ms 24324 KB Output is correct
24 Correct 145 ms 24440 KB Output is correct
25 Correct 144 ms 24440 KB Output is correct
26 Correct 135 ms 24396 KB Output is correct
27 Correct 153 ms 24408 KB Output is correct
28 Correct 149 ms 24440 KB Output is correct
29 Correct 146 ms 24312 KB Output is correct
30 Correct 147 ms 24368 KB Output is correct
31 Correct 139 ms 24412 KB Output is correct
32 Correct 143 ms 24312 KB Output is correct
33 Correct 144 ms 24312 KB Output is correct
34 Correct 145 ms 24312 KB Output is correct
35 Correct 11 ms 9720 KB Output is correct
36 Correct 10 ms 9724 KB Output is correct
37 Correct 146 ms 24312 KB Output is correct
38 Correct 143 ms 24284 KB Output is correct
39 Correct 145 ms 24488 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 11 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 139 ms 24444 KB Output is correct
6 Correct 168 ms 24444 KB Output is correct
7 Correct 135 ms 24312 KB Output is correct
8 Correct 131 ms 24312 KB Output is correct
9 Correct 135 ms 24284 KB Output is correct
10 Correct 152 ms 24440 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9632 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 11 ms 9720 KB Output is correct
6 Correct 10 ms 9720 KB Output is correct
7 Correct 10 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 11 ms 9720 KB Output is correct
11 Correct 10 ms 9724 KB Output is correct
12 Correct 10 ms 9720 KB Output is correct
13 Correct 10 ms 9720 KB Output is correct
14 Correct 10 ms 9720 KB Output is correct
15 Correct 10 ms 9720 KB Output is correct
16 Correct 10 ms 9720 KB Output is correct
17 Correct 10 ms 9724 KB Output is correct
18 Correct 10 ms 9720 KB Output is correct
19 Correct 11 ms 9720 KB Output is correct
20 Correct 11 ms 9720 KB Output is correct
21 Correct 11 ms 9784 KB Output is correct
22 Correct 10 ms 9720 KB Output is correct
23 Correct 11 ms 9720 KB Output is correct
24 Correct 10 ms 9720 KB Output is correct
25 Correct 10 ms 9720 KB Output is correct
26 Correct 10 ms 9720 KB Output is correct
27 Correct 10 ms 9720 KB Output is correct
28 Correct 10 ms 9720 KB Output is correct
29 Correct 10 ms 9688 KB Output is correct
30 Correct 10 ms 9720 KB Output is correct
31 Correct 10 ms 9720 KB Output is correct
32 Correct 11 ms 9640 KB Output is correct
33 Correct 10 ms 9720 KB Output is correct
34 Correct 10 ms 9720 KB Output is correct
35 Correct 11 ms 9724 KB Output is correct
36 Correct 10 ms 9720 KB Output is correct
37 Correct 10 ms 9720 KB Output is correct
38 Correct 10 ms 9720 KB Output is correct
39 Correct 10 ms 9720 KB Output is correct
40 Correct 10 ms 9720 KB Output is correct
41 Correct 10 ms 9720 KB Output is correct
42 Correct 10 ms 9720 KB Output is correct
43 Correct 10 ms 9720 KB Output is correct
44 Correct 11 ms 9720 KB Output is correct
45 Correct 11 ms 9724 KB Output is correct
46 Correct 10 ms 9720 KB Output is correct
47 Correct 10 ms 9720 KB Output is correct
48 Correct 10 ms 9720 KB Output is correct
49 Correct 10 ms 9720 KB Output is correct
50 Correct 11 ms 9720 KB Output is correct
51 Correct 11 ms 9720 KB Output is correct
52 Correct 11 ms 9852 KB Output is correct
53 Correct 14 ms 9848 KB Output is correct
54 Correct 22 ms 11256 KB Output is correct
55 Correct 22 ms 11256 KB Output is correct
56 Correct 139 ms 24284 KB Output is correct
57 Correct 153 ms 24324 KB Output is correct
58 Correct 145 ms 24440 KB Output is correct
59 Correct 144 ms 24440 KB Output is correct
60 Correct 135 ms 24396 KB Output is correct
61 Correct 153 ms 24408 KB Output is correct
62 Correct 149 ms 24440 KB Output is correct
63 Correct 146 ms 24312 KB Output is correct
64 Correct 147 ms 24368 KB Output is correct
65 Correct 139 ms 24412 KB Output is correct
66 Correct 143 ms 24312 KB Output is correct
67 Correct 144 ms 24312 KB Output is correct
68 Correct 145 ms 24312 KB Output is correct
69 Correct 11 ms 9720 KB Output is correct
70 Correct 10 ms 9724 KB Output is correct
71 Correct 146 ms 24312 KB Output is correct
72 Correct 143 ms 24284 KB Output is correct
73 Correct 145 ms 24488 KB Output is correct
74 Correct 10 ms 9720 KB Output is correct
75 Correct 10 ms 9720 KB Output is correct
76 Correct 11 ms 9720 KB Output is correct
77 Correct 10 ms 9720 KB Output is correct
78 Correct 139 ms 24444 KB Output is correct
79 Correct 168 ms 24444 KB Output is correct
80 Correct 135 ms 24312 KB Output is correct
81 Correct 131 ms 24312 KB Output is correct
82 Correct 135 ms 24284 KB Output is correct
83 Correct 152 ms 24440 KB Output is correct
84 Correct 10 ms 9720 KB Output is correct
85 Correct 10 ms 9720 KB Output is correct
86 Correct 10 ms 9720 KB Output is correct
87 Correct 11 ms 9720 KB Output is correct
88 Correct 11 ms 9848 KB Output is correct
89 Correct 12 ms 9848 KB Output is correct
90 Correct 11 ms 9848 KB Output is correct
91 Correct 11 ms 9848 KB Output is correct
92 Correct 11 ms 9848 KB Output is correct
93 Correct 12 ms 9848 KB Output is correct
94 Correct 11 ms 9848 KB Output is correct
95 Correct 12 ms 9976 KB Output is correct
96 Correct 11 ms 9848 KB Output is correct
97 Correct 12 ms 9848 KB Output is correct
98 Correct 11 ms 9848 KB Output is correct
99 Correct 12 ms 9848 KB Output is correct
100 Correct 12 ms 9848 KB Output is correct
101 Correct 22 ms 11256 KB Output is correct
102 Correct 24 ms 11256 KB Output is correct
103 Correct 219 ms 24444 KB Output is correct
104 Correct 146 ms 24312 KB Output is correct
105 Correct 187 ms 24312 KB Output is correct
106 Correct 133 ms 24440 KB Output is correct
107 Correct 205 ms 24384 KB Output is correct
108 Correct 181 ms 24312 KB Output is correct
109 Correct 127 ms 24408 KB Output is correct
110 Correct 146 ms 24312 KB Output is correct
111 Correct 136 ms 24404 KB Output is correct
112 Correct 177 ms 24440 KB Output is correct
113 Correct 195 ms 24440 KB Output is correct
114 Correct 129 ms 24416 KB Output is correct
115 Correct 135 ms 24368 KB Output is correct