oj.uz

Submission #832109

# Submission time Handle Problem Language Result Execution time Memory
832109 2023-08-21T00:47:29 Z maomao90 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 51 ms 19560 KB 
// I can do all things through Christ who strengthens me
// Philippians 4:13

#include "shoes.h"
#include "bits/stdc++.h"
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define SZ(x) (int) x.size()
#define ALL(x) x.begin(), x.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 200005;

int n;
vi vp[2][MAXN];

namespace st2 {
    ll count_swaps(vi s) {
        vi lp, rp;
        REP (i, 0, 2 * n) {
            if (s[i] < 0) {
                lp.pb(i);
            } else {
                rp.pb(i);
            }
        }
        ll ans = 0;
        while (!s.empty()) {
            int id = -1;
            RREP (i, SZ(s) - 2, 0) {
                if (abs(s[i]) == abs(s.back()) && s[i] != s.back()) {
                    id = i;
                    break;
                }
            }
            assert(id != -1);
            ans += SZ(s) - id - (s.back() < 0 ? 1 : 2);
            s.pop_back();
            s.erase(s.begin() + id);
        }
        return ans;
        /*
        vi id(n);
        iota(ALL(id), 0);
        do {
            ll cur = 0;
            REP (i, 0, n) {
                REP (j, i + 1, n) {
                    if (id[i] > id[j]) {
                        cur++;
                    }
                }
            }
            vector<bool> vis(n, 0);
            REP (i, 0, n) {
                REP (j, 0, n) {
                    if (vis[j] || abs(s[lp[i]]) != abs(s[rp[j]])) {
                        continue;
                    }
                    vis[j] = 1;

                }
            }
        } while (next_permutation(ALL(id)));
        */
    }
}

namespace st3 {
    ll count_swaps(vi s) {
        int ptr = 0;
        ll ans = 0;
        REP (i, 0, 2 * n) {
            if (s[i] < 0) {
                ans += abs(i - ptr);
                ptr += 2;
            }
        }
        return ans;
    }
}

int fw[MAXN];
void incre(int i, int x) {
    i++;
    for (; i <= 2 * n; i += i & -i) {
        fw[i] += x;
    }
}
int qsm(int i) {
    i++;
    int res = 0;
    for (; i > 0; i -= i & -i) {
        res += fw[i];
    }
    return res;
}
int qsm(int s, int e) {
    return qsm(e) - qsm(s - 1);
}

ll count_swaps(vi s) {
    n = SZ(s) / 2;
    /*
    bool st3 = 1;
    REP (i, 1, 2 * n) {
        if (abs(s[i]) != abs(s[i - 1])) {
            st3 = 0;
        }
    }
    bool st2 = n <= 1000;
    if (st2) {
        return st2::count_swaps(s);
    } else if (st3) {
        return st3::count_swaps(s);
    }
    ll ans = 0;
    REP (i, 0, n) {
        ans += i;
    }
    */
    REP (i, 0, 2 * n) {
        if (s[i] < 0) {
            vp[0][-s[i]].pb(i);
        } else {
            vp[1][s[i]].pb(i);
        }
    }
    vector<bool> vis(2 * n, 0);
    ll ans = 0;
    RREP (i, 2 * n - 1, 0) {
        if (vis[i]) {
            continue;
        }
        bool b = s[i] > 0;
        int j = vp[b ^ 1][abs(s[i])].back();
        vp[b][abs(s[i])].pop_back(); vp[b ^ 1][abs(s[i])].pop_back();
        vis[i] = vis[j] = 1;
        cerr << i << ' ' << j << '\n';
        int cur = i - j - b;
        cur -= qsm(j, i);
        cerr << ' ' << qsm(j, i) << '\n';
        incre(j, 1); incre(i, 1);
        ans += cur;
    }
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9700 KB Output is correct
6 Correct 4 ms 9604 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 4 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 7 ms 10068 KB Output is correct
21 Correct 7 ms 10068 KB Output is correct
22 Correct 28 ms 12952 KB Output is correct
23 Correct 23 ms 13044 KB Output is correct
24 Correct 31 ms 12904 KB Output is correct
25 Correct 23 ms 12876 KB Output is correct
26 Correct 27 ms 13032 KB Output is correct
27 Correct 27 ms 13044 KB Output is correct
28 Correct 24 ms 12916 KB Output is correct
29 Correct 32 ms 12876 KB Output is correct
30 Correct 24 ms 12916 KB Output is correct
31 Correct 34 ms 12924 KB Output is correct
32 Correct 24 ms 12932 KB Output is correct
33 Correct 24 ms 12916 KB Output is correct
34 Correct 24 ms 12876 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 23 ms 12916 KB Output is correct
38 Correct 23 ms 12860 KB Output is correct
39 Correct 32 ms 12916 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 38 ms 18276 KB Output is correct
6 Correct 30 ms 13516 KB Output is correct
7 Correct 37 ms 18292 KB Output is correct
8 Correct 24 ms 12952 KB Output is correct
9 Correct 51 ms 18252 KB Output is correct
10 Correct 48 ms 15156 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9684 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 5 ms 9664 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 4 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9676 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct
21 Correct 4 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 4 ms 9684 KB Output is correct
24 Correct 4 ms 9684 KB Output is correct
25 Correct 5 ms 9656 KB Output is correct
26 Correct 4 ms 9684 KB Output is correct
27 Correct 4 ms 9684 KB Output is correct
28 Correct 4 ms 9684 KB Output is correct
29 Correct 4 ms 9692 KB Output is correct
30 Correct 5 ms 9684 KB Output is correct
31 Correct 4 ms 9684 KB Output is correct
32 Correct 4 ms 9684 KB Output is correct
33 Correct 4 ms 9684 KB Output is correct
34 Correct 4 ms 9684 KB Output is correct
35 Correct 4 ms 9684 KB Output is correct
36 Correct 4 ms 9684 KB Output is correct
37 Correct 4 ms 9684 KB Output is correct
38 Correct 4 ms 9684 KB Output is correct
39 Correct 5 ms 9700 KB Output is correct
40 Correct 4 ms 9604 KB Output is correct
41 Correct 4 ms 9684 KB Output is correct
42 Correct 4 ms 9684 KB Output is correct
43 Correct 4 ms 9684 KB Output is correct
44 Correct 4 ms 9684 KB Output is correct
45 Correct 4 ms 9684 KB Output is correct
46 Correct 4 ms 9684 KB Output is correct
47 Correct 4 ms 9684 KB Output is correct
48 Correct 4 ms 9684 KB Output is correct
49 Correct 4 ms 9684 KB Output is correct
50 Correct 4 ms 9684 KB Output is correct
51 Correct 4 ms 9684 KB Output is correct
52 Correct 4 ms 9684 KB Output is correct
53 Correct 4 ms 9684 KB Output is correct
54 Correct 7 ms 10068 KB Output is correct
55 Correct 7 ms 10068 KB Output is correct
56 Correct 28 ms 12952 KB Output is correct
57 Correct 23 ms 13044 KB Output is correct
58 Correct 31 ms 12904 KB Output is correct
59 Correct 23 ms 12876 KB Output is correct
60 Correct 27 ms 13032 KB Output is correct
61 Correct 27 ms 13044 KB Output is correct
62 Correct 24 ms 12916 KB Output is correct
63 Correct 32 ms 12876 KB Output is correct
64 Correct 24 ms 12916 KB Output is correct
65 Correct 34 ms 12924 KB Output is correct
66 Correct 24 ms 12932 KB Output is correct
67 Correct 24 ms 12916 KB Output is correct
68 Correct 24 ms 12876 KB Output is correct
69 Correct 5 ms 9684 KB Output is correct
70 Correct 5 ms 9684 KB Output is correct
71 Correct 23 ms 12916 KB Output is correct
72 Correct 23 ms 12860 KB Output is correct
73 Correct 32 ms 12916 KB Output is correct
74 Correct 6 ms 9684 KB Output is correct
75 Correct 4 ms 9684 KB Output is correct
76 Correct 4 ms 9684 KB Output is correct
77 Correct 4 ms 9684 KB Output is correct
78 Correct 38 ms 18276 KB Output is correct
79 Correct 30 ms 13516 KB Output is correct
80 Correct 37 ms 18292 KB Output is correct
81 Correct 24 ms 12952 KB Output is correct
82 Correct 51 ms 18252 KB Output is correct
83 Correct 48 ms 15156 KB Output is correct
84 Correct 4 ms 9684 KB Output is correct
85 Correct 4 ms 9684 KB Output is correct
86 Correct 4 ms 9684 KB Output is correct
87 Correct 5 ms 9684 KB Output is correct
88 Correct 5 ms 9684 KB Output is correct
89 Correct 4 ms 9684 KB Output is correct
90 Correct 4 ms 9684 KB Output is correct
91 Correct 5 ms 9684 KB Output is correct
92 Correct 4 ms 9752 KB Output is correct
93 Correct 4 ms 9684 KB Output is correct
94 Correct 5 ms 9684 KB Output is correct
95 Correct 4 ms 9684 KB Output is correct
96 Correct 5 ms 9684 KB Output is correct
97 Correct 4 ms 9688 KB Output is correct
98 Correct 5 ms 9628 KB Output is correct
99 Correct 5 ms 9684 KB Output is correct
100 Correct 4 ms 9684 KB Output is correct
101 Correct 7 ms 10580 KB Output is correct
102 Correct 8 ms 10200 KB Output is correct
103 Correct 47 ms 19544 KB Output is correct
104 Correct 41 ms 19540 KB Output is correct
105 Correct 47 ms 16848 KB Output is correct
106 Correct 40 ms 19460 KB Output is correct
107 Correct 36 ms 14880 KB Output is correct
108 Correct 34 ms 15156 KB Output is correct
109 Correct 25 ms 14536 KB Output is correct
110 Correct 32 ms 14172 KB Output is correct
111 Correct 40 ms 18764 KB Output is correct
112 Correct 41 ms 18112 KB Output is correct
113 Correct 34 ms 14804 KB Output is correct
114 Correct 39 ms 19472 KB Output is correct
115 Correct 36 ms 19560 KB Output is correct