oj.uz

Submission #920021

# Submission time Handle Problem Language Result Execution time Memory
920021 2024-02-02T01:22:41 Z tanprodium Arranging Shoes (IOI19_shoes) C++14
100 / 100
 50 ms 15768 KB 
// include
#include<bits/stdc++.h>
#include "shoes.h"

using namespace std;

// random
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

// templates
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (y > x) {
            x = y;
            return (true);
        } else return (false);
    }

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (y < x) {
            x = y;
            return (true);
        } else return (false);
    }

// define
#define fi    first
#define se    second

#define pub   push_back
#define pob   pop_back
#define puf   push_front
#define pof   pop_front
#define eb    emplace_back
#define upb   upper_bound
#define lwb   lower_bound

#define left  VAN
#define right TAN

#define all(a) (a).begin(),(a).end()
#define rall(a) (a).begin(),(a).end()
#define sort_and_unique(a) sort(all(a));(a).resize(unique(all(a))-a.begin())
#define max_ max_element
#define min_ min_element

// another define
using ll  = long long;
using ld  = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

// limit
const int oo = 2e9;

// function
void yesno(bool x) {
    cout << (x ? "YES\n" : "NO\n");
}

// structs
// FenwickTree
struct FenwickTree {
    vector<ll> ft;
    int from, to;

    FenwickTree() {}
    FenwickTree(int _from, int _to): from(_from), to(_to) {
        // set initial value

        ft.assign(to - from + 5, 0);
    }

private:
    void Upd(int p, ll v) {
        p = max(p, from);
        for (int j = p; j <= to; j += (j & (-j)))
            ft[j] += v;
    }

    ll Get(int p) {
        ll result = 0;
        p = min(p, to);
        for (int j = p; j >= from; j -= (j & (-j)))
            result += ft[j];
        return (result);
    }

public:
    void upd(int p, ll v) {
        Upd(p, v);
    }

    ll get(int p) {
        return (Get(p));
    }
};

ll count_swaps(vector<int> a) {
    int n = (int)a.size() / 2;
    ll ans = 0;
    vector<vector<int>> p(2 * n + 5);
    for (int i = 2 * n - 1; i >= 0; i--) {
        p[n + a[i]].push_back(i + 1);
        //cout << a[i] << ' ' << n + a[i] << '\n';
    }
    FenwickTree ft(1, 2 * n);
    for (int i = 0; i < 2 * n; i++) {
        bool ok = false;
        if ((int)p[n + a[i]].size()) {
            //cout << i << ' ' << a[i] << ' ' << p[n + a[i]].back() << '\n';
            if (p[n + a[i]].back() == i + 1) {
                ok = true;
            }
        }
        if (ok) {
            p[a[i] + n].pop_back();
            int l = i + 1;
            //cout << a[i] << '\n';
            int r = p[-a[i] + n].back();
            p[-a[i] + n].pop_back();
            if (a[i] < 0) {
                ans += r - l - 1 - ft.get(r) + ft.get(l - 1);
            } else {
                ans += r - l - ft.get(r) + ft.get(l - 1);
            }
            ft.upd(r, 1);
        }
    }
    return (ans);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 4 ms 1368 KB Output is correct
21 Correct 3 ms 1368 KB Output is correct
22 Correct 25 ms 9184 KB Output is correct
23 Correct 22 ms 9164 KB Output is correct
24 Correct 24 ms 8952 KB Output is correct
25 Correct 21 ms 9040 KB Output is correct
26 Correct 25 ms 10436 KB Output is correct
27 Correct 21 ms 10180 KB Output is correct
28 Correct 23 ms 10320 KB Output is correct
29 Correct 23 ms 10308 KB Output is correct
30 Correct 23 ms 10320 KB Output is correct
31 Correct 25 ms 10324 KB Output is correct
32 Correct 23 ms 10576 KB Output is correct
33 Correct 22 ms 10064 KB Output is correct
34 Correct 22 ms 10320 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 22 ms 10316 KB Output is correct
38 Correct 22 ms 10320 KB Output is correct
39 Correct 22 ms 10320 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 37 ms 14416 KB Output is correct
6 Correct 28 ms 10832 KB Output is correct
7 Correct 42 ms 15696 KB Output is correct
8 Correct 22 ms 10492 KB Output is correct
9 Correct 38 ms 15696 KB Output is correct
10 Correct 37 ms 12624 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 544 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 548 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 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 344 KB Output is correct
46 Correct 1 ms 344 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 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 544 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 504 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 600 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 4 ms 1368 KB Output is correct
55 Correct 3 ms 1368 KB Output is correct
56 Correct 25 ms 9184 KB Output is correct
57 Correct 22 ms 9164 KB Output is correct
58 Correct 24 ms 8952 KB Output is correct
59 Correct 21 ms 9040 KB Output is correct
60 Correct 25 ms 10436 KB Output is correct
61 Correct 21 ms 10180 KB Output is correct
62 Correct 23 ms 10320 KB Output is correct
63 Correct 23 ms 10308 KB Output is correct
64 Correct 23 ms 10320 KB Output is correct
65 Correct 25 ms 10324 KB Output is correct
66 Correct 23 ms 10576 KB Output is correct
67 Correct 22 ms 10064 KB Output is correct
68 Correct 22 ms 10320 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 22 ms 10316 KB Output is correct
72 Correct 22 ms 10320 KB Output is correct
73 Correct 22 ms 10320 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 600 KB Output is correct
77 Correct 1 ms 600 KB Output is correct
78 Correct 37 ms 14416 KB Output is correct
79 Correct 28 ms 10832 KB Output is correct
80 Correct 42 ms 15696 KB Output is correct
81 Correct 22 ms 10492 KB Output is correct
82 Correct 38 ms 15696 KB Output is correct
83 Correct 37 ms 12624 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 548 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 1 ms 344 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 344 KB Output is correct
93 Correct 1 ms 344 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 344 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 5 ms 1884 KB Output is correct
102 Correct 5 ms 1372 KB Output is correct
103 Correct 50 ms 15768 KB Output is correct
104 Correct 42 ms 15664 KB Output is correct
105 Correct 41 ms 12880 KB Output is correct
106 Correct 40 ms 15704 KB Output is correct
107 Correct 34 ms 11092 KB Output is correct
108 Correct 31 ms 11356 KB Output is correct
109 Correct 22 ms 10696 KB Output is correct
110 Correct 21 ms 10312 KB Output is correct
111 Correct 37 ms 14932 KB Output is correct
112 Correct 43 ms 14164 KB Output is correct
113 Correct 31 ms 11088 KB Output is correct
114 Correct 39 ms 15668 KB Output is correct
115 Correct 40 ms 15704 KB Output is correct