oj.uz

Submission #417641

# Submission time Handle Problem Language Result Execution time Memory
417641 2021-06-04T05:16:50 Z usachevd0 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 194 ms 21108 KB 
#include <bits/stdc++.h>
#ifndef LOCAL
    #include "shoes.h"
#endif

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define Time (clock() * 1.0 / CLOCKS_PER_SEC)
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1& x, T2 y) {
    return y < x ? (x = y, true) : false;
}
template<typename T1, typename T2> bool chkmax(T1& x, T2 y) {
    return y > x ? (x = y, true) : false;
}
void debug_out() {
    cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
    cerr << ' ' << A;
    debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
    for (int i = 0; i < n; ++i)
        cerr << a[i] << ' ';
    cerr << endl;
}
#ifdef LOCAL
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T>& v) {
    for (auto& x : v)
        stream << x << ' ';
    return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
    return stream << p.first << ' ' << p.second;
}

const int maxN = 2e5 + 5;
const ll INF64 = 1e18;

int mn[maxN];
vector<int> pos[maxN];

namespace fnw {
    int f[maxN];
    
    void add(int i, int delta) {
        for (++i; i < maxN; i += i & -i)
            f[i] += delta;
    }
    int pref(int i) {
        int ans = 0;
        for (++i; i >= 1; i -= i & -i)
            ans += f[i];
        return ans;
    }
}

ll count_swaps(vector<int> a) {
    int n = a.size();
    for (auto& x : a) {
        if (x < 0) {
            x *= -2;
        } else {
            x = x * 2 + 1;
        }
    }
    for (int i = n - 1; i >= 0; --i) {
        pos[a[i]].push_back(i);
    }
    ll ans = 0;
    set<pli> q;
    for (int x = 1; x <= n / 2; ++x)
        if (!pos[2 * x].empty()) {
            ll f = pos[2 * x].back() + pos[2 * x + 1].back() + (int)(pos[2 * x].back() > pos[2 * x + 1].back());
            q.insert({f, x});
        }
    for (int i = 0; i < n; ++i)
        fnw::add(i, 1);
    while (!q.empty()) {
        int x = q.begin()->se;
        q.erase(q.begin());
        
        int i = pos[2 * x].back();
        pos[2 * x].pop_back();
        int j = pos[2 * x + 1].back();
        pos[2 * x + 1].pop_back();
        
        ans += fnw::pref(i) + fnw::pref(j) - 3 + (int)(i > j);
        fnw::add(i, -1);
        fnw::add(j, -1);
        
        if (!pos[2 * x].empty()) {
            ll f = pos[2 * x].back() + pos[2 * x + 1].back() + (int)(pos[2 * x].back() > pos[2 * x + 1].back());
            q.insert({f, x});
        }
    }
    // for (int i = 0; i < n; i += 2) {
    //     fill(mn, mn + n + 2, -1);
    //     for (int j = 0; j < n; ++j) {
    //         if (a[j] != 0 && mn[a[j]] == -1)
    //             mn[a[j]] = j;
    //     }
    //     ll minF = INF64;
    //     int minX = -1;
    //     for (int x = 1; x <= n / 2; ++x)
    //         if (mn[2 * x] != -1) {
    //             ll f = mn[2 * x] + mn[2 * x + 1];
    //             if (mn[2 * x] > mn[2 * x + 1])
    //                 ++f;
    //             if (chkmin(minF, f))
    //                 minX = x;
    //         }
    //     // ans += minF;
    //     auto f = [&](int j) -> ll {
    //         int res = 0;
    //         while (j > 0) {
    //             res += (a[--j] != 0);
    //         }
    //         return res;
    //     };
    //     int j1 = f(mn[2 * minX]), j2 = f(mn[2 * minX + 1]);
    //     ans += j1 + j2 - 1;
    //     if (j1 > j2) {
    //         swap(j1, j2);
    //         ++ans;
    //     }
    //     a[mn[2 * minX]] = a[mn[2 * minX + 1]] = 0;
    //     // rotate(a.begin() + i, a.begin() + j1, a.begin() + j1 + 1);
    //     // rotate(a.begin() + i + 1, a.begin() + j2, a.begin() + j2 + 1);
    // }
    return ans;
}


#ifdef LOCAL
int32_t main() {
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    
        int n;
    assert(1 == scanf("%d", &n));
    vector<int> S(2 * n);
    for (int i = 0; i < 2 * n; i++)
        assert(1 == scanf("%d", &S[i]));
    fclose(stdin);

    long long result = count_swaps(S);

    printf("%lld\n", result);
    fclose(stdout);
    
    return 0;
}
#endif

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 8 ms 5332 KB Output is correct
21 Correct 8 ms 5404 KB Output is correct
22 Correct 46 ms 8228 KB Output is correct
23 Correct 47 ms 9596 KB Output is correct
24 Correct 46 ms 9476 KB Output is correct
25 Correct 44 ms 9276 KB Output is correct
26 Correct 47 ms 9616 KB Output is correct
27 Correct 46 ms 9408 KB Output is correct
28 Correct 44 ms 9480 KB Output is correct
29 Correct 44 ms 9404 KB Output is correct
30 Correct 44 ms 9404 KB Output is correct
31 Correct 48 ms 9520 KB Output is correct
32 Correct 44 ms 9468 KB Output is correct
33 Correct 50 ms 9328 KB Output is correct
34 Correct 45 ms 9512 KB Output is correct
35 Correct 4 ms 5000 KB Output is correct
36 Correct 4 ms 4940 KB Output is correct
37 Correct 44 ms 9476 KB Output is correct
38 Correct 44 ms 9404 KB Output is correct
39 Correct 44 ms 9524 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 158 ms 19872 KB Output is correct
6 Correct 87 ms 10568 KB Output is correct
7 Correct 162 ms 21000 KB Output is correct
8 Correct 46 ms 9512 KB Output is correct
9 Correct 164 ms 21104 KB Output is correct
10 Correct 151 ms 14788 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 4936 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 4 ms 4992 KB Output is correct
30 Correct 5 ms 4940 KB Output is correct
31 Correct 4 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 4 ms 4940 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 4 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 3 ms 4940 KB Output is correct
40 Correct 3 ms 4940 KB Output is correct
41 Correct 3 ms 4940 KB Output is correct
42 Correct 4 ms 4940 KB Output is correct
43 Correct 3 ms 4940 KB Output is correct
44 Correct 4 ms 4940 KB Output is correct
45 Correct 4 ms 4940 KB Output is correct
46 Correct 4 ms 4940 KB Output is correct
47 Correct 4 ms 4940 KB Output is correct
48 Correct 3 ms 4940 KB Output is correct
49 Correct 4 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 4 ms 4940 KB Output is correct
53 Correct 4 ms 4940 KB Output is correct
54 Correct 8 ms 5332 KB Output is correct
55 Correct 8 ms 5404 KB Output is correct
56 Correct 46 ms 8228 KB Output is correct
57 Correct 47 ms 9596 KB Output is correct
58 Correct 46 ms 9476 KB Output is correct
59 Correct 44 ms 9276 KB Output is correct
60 Correct 47 ms 9616 KB Output is correct
61 Correct 46 ms 9408 KB Output is correct
62 Correct 44 ms 9480 KB Output is correct
63 Correct 44 ms 9404 KB Output is correct
64 Correct 44 ms 9404 KB Output is correct
65 Correct 48 ms 9520 KB Output is correct
66 Correct 44 ms 9468 KB Output is correct
67 Correct 50 ms 9328 KB Output is correct
68 Correct 45 ms 9512 KB Output is correct
69 Correct 4 ms 5000 KB Output is correct
70 Correct 4 ms 4940 KB Output is correct
71 Correct 44 ms 9476 KB Output is correct
72 Correct 44 ms 9404 KB Output is correct
73 Correct 44 ms 9524 KB Output is correct
74 Correct 4 ms 4940 KB Output is correct
75 Correct 4 ms 4940 KB Output is correct
76 Correct 4 ms 4940 KB Output is correct
77 Correct 3 ms 4940 KB Output is correct
78 Correct 158 ms 19872 KB Output is correct
79 Correct 87 ms 10568 KB Output is correct
80 Correct 162 ms 21000 KB Output is correct
81 Correct 46 ms 9512 KB Output is correct
82 Correct 164 ms 21104 KB Output is correct
83 Correct 151 ms 14788 KB Output is correct
84 Correct 3 ms 4940 KB Output is correct
85 Correct 3 ms 4940 KB Output is correct
86 Correct 4 ms 4940 KB Output is correct
87 Correct 4 ms 5000 KB Output is correct
88 Correct 4 ms 5068 KB Output is correct
89 Correct 4 ms 5068 KB Output is correct
90 Correct 4 ms 5068 KB Output is correct
91 Correct 4 ms 5068 KB Output is correct
92 Correct 4 ms 5068 KB Output is correct
93 Correct 4 ms 5068 KB Output is correct
94 Correct 4 ms 5068 KB Output is correct
95 Correct 4 ms 5068 KB Output is correct
96 Correct 4 ms 5068 KB Output is correct
97 Correct 4 ms 4940 KB Output is correct
98 Correct 4 ms 4940 KB Output is correct
99 Correct 4 ms 5068 KB Output is correct
100 Correct 4 ms 5132 KB Output is correct
101 Correct 12 ms 6372 KB Output is correct
102 Correct 12 ms 5668 KB Output is correct
103 Correct 194 ms 21092 KB Output is correct
104 Correct 153 ms 21088 KB Output is correct
105 Correct 147 ms 15620 KB Output is correct
106 Correct 116 ms 21040 KB Output is correct
107 Correct 109 ms 10692 KB Output is correct
108 Correct 107 ms 11920 KB Output is correct
109 Correct 47 ms 9732 KB Output is correct
110 Correct 46 ms 9464 KB Output is correct
111 Correct 172 ms 19700 KB Output is correct
112 Correct 154 ms 18268 KB Output is correct
113 Correct 96 ms 10872 KB Output is correct
114 Correct 119 ms 21092 KB Output is correct
115 Correct 133 ms 21108 KB Output is correct