oj.uz

Submission #572563

# Submission time Handle Problem Language Result Execution time Memory
572563 2022-06-04T17:11:28 Z MadokaMagicaFan Arranging Shoes (IOI19_shoes) C++14
100 / 100
 32 ms 6624 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
const ll inf = 1e9;
const int md1 = 1e9+7;
const int md2 = 998244353;

#define all(v)                      v.begin(), v.end()
#define rall(v)                     v.rbegin(), v.rend()
#define sz(v)                       ((int)v.size())

#define forn(i,n)                   for(int i = 0; i < n; ++i)
#define forbe(i,b,e)                for(int i = b; i < e; ++i)

#define pb                          push_back

#define pry                         puts("YES")
#define prn                         puts("NO")
#define endl                        '\n'

#define fst                         first
#define scn                         second

const int N = 1e5;

bitset<2*N> c;

template<typename T>
struct BIT{
    int n;
    vector<T> fen;
    BIT(int n){
        this->n = n;
        fen.assign(n,0);
    }
    BIT(vector<T> a) : BIT(a.size()){
        for(int i = 0; i < n; ++i) add(i,a[i]);
    }
    void add(int x, T v){
        for(; x < n; x |= x+1) fen[x] += v;
    }
    T query(int x){
        T res = 0;
        for(; x >= 0; x = (x&(x+1))-1)
            res += fen[x];
        return res;
    }
    T query(int l, int r){
        return query(r) - query(l-1);
    }
};

ll
count_swaps(vector<int> s)
{
    ll ans = 0;
    int balance[sz(s)+1];
    vector<int> npos(sz(s),-1);
    vector<int> lpos(sz(s),-1);
    vector<int> spos(sz(s)+1,-1);
    vector<int> sspos(sz(s)+1,-1);
    for (int i = 0; i < sz(s); ++i) balance[i+1] = 0;

    int size;
    BIT<int> deltr(sz(s)+5);
    for (int i = 0; i < sz(s); ++i) {
        size = abs(s[i]);
        if (s[i] > 0) {
            if (balance[size] < 0) {
                c[i] = 1;
                npos[spos[size]] = i;
                spos[size] = lpos[spos[size]];
            } else {
                if (balance[size] == 0) {
                    spos[size] = i;
                    sspos[size] = i;
                } else {
                    lpos[sspos[size]] = i;
                    sspos[size] = i;
                }
            }
            ++balance[size];
        } else {
            if (balance[size] > 0) {
                c[i] = 1;
                npos[spos[size]] = i;
                spos[size] = lpos[spos[size]];
            } else {
                if (balance[size] == 0) {
                    spos[size] = i;
                    sspos[size] = i;
                } else {
                    lpos[sspos[size]] = i;
                    sspos[size] = i;
                }
            }
            --balance[size];
        }
    }

    for (int i = 0; i < sz(s); ++i) {
        if (c[i]) continue;
        size = abs(s[i]);
        if (s[i] < 0)
            --ans;
        ans += npos[i] - i - deltr.query(i,npos[i]);
        deltr.add(npos[i],1);
    }

    return ans;
}

#ifdef ONPC
void
solve()
{
    int n;
    cin >> n;
    vector<int> s(n);
    for (int i = 0; i < n; ++i)
        cin >> s[i];
    
    cout <<count_swaps(s) << endl;
}

int32_t
main()
{
    freopen("in", "r", stdin);
    int t = 1;
    /* cin >> t; */
    while(t--)
        solve();
}
#endif

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 220 KB Output is correct
7 Correct 0 ms 224 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 1 ms 224 KB Output is correct
10 Correct 0 ms 224 KB Output is correct
11 Correct 0 ms 224 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 224 KB Output is correct
14 Correct 0 ms 224 KB Output is correct
15 Correct 1 ms 224 KB Output is correct
16 Correct 1 ms 224 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 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 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 224 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 1 ms 224 KB Output is correct
7 Correct 0 ms 224 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 0 ms 224 KB Output is correct
10 Correct 0 ms 224 KB Output is correct
11 Correct 0 ms 224 KB Output is correct
12 Correct 0 ms 224 KB Output is correct
13 Correct 0 ms 224 KB Output is correct
14 Correct 1 ms 224 KB Output is correct
15 Correct 1 ms 224 KB Output is correct
16 Correct 0 ms 224 KB Output is correct
17 Correct 0 ms 224 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 3 ms 864 KB Output is correct
21 Correct 3 ms 864 KB Output is correct
22 Correct 28 ms 6564 KB Output is correct
23 Correct 25 ms 6624 KB Output is correct
24 Correct 27 ms 6612 KB Output is correct
25 Correct 23 ms 6480 KB Output is correct
26 Correct 30 ms 6548 KB Output is correct
27 Correct 32 ms 6616 KB Output is correct
28 Correct 29 ms 6488 KB Output is correct
29 Correct 24 ms 6608 KB Output is correct
30 Correct 25 ms 6608 KB Output is correct
31 Correct 26 ms 6612 KB Output is correct
32 Correct 24 ms 6496 KB Output is correct
33 Correct 26 ms 6612 KB Output is correct
34 Correct 27 ms 6496 KB Output is correct
35 Correct 0 ms 224 KB Output is correct
36 Correct 1 ms 224 KB Output is correct
37 Correct 26 ms 6592 KB Output is correct
38 Correct 28 ms 6604 KB Output is correct
39 Correct 24 ms 6476 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 27 ms 6520 KB Output is correct
6 Correct 25 ms 6552 KB Output is correct
7 Correct 25 ms 6596 KB Output is correct
8 Correct 26 ms 6568 KB Output is correct
9 Correct 29 ms 6468 KB Output is correct
10 Correct 28 ms 6592 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 220 KB Output is correct
7 Correct 0 ms 224 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 1 ms 224 KB Output is correct
10 Correct 0 ms 224 KB Output is correct
11 Correct 0 ms 224 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 224 KB Output is correct
14 Correct 0 ms 224 KB Output is correct
15 Correct 1 ms 224 KB Output is correct
16 Correct 1 ms 224 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 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 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 220 KB Output is correct
7 Correct 0 ms 224 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 1 ms 224 KB Output is correct
10 Correct 0 ms 224 KB Output is correct
11 Correct 0 ms 224 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 224 KB Output is correct
14 Correct 0 ms 224 KB Output is correct
15 Correct 1 ms 224 KB Output is correct
16 Correct 1 ms 224 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 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 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 224 KB Output is correct
38 Correct 0 ms 224 KB Output is correct
39 Correct 1 ms 224 KB Output is correct
40 Correct 1 ms 224 KB Output is correct
41 Correct 0 ms 224 KB Output is correct
42 Correct 0 ms 224 KB Output is correct
43 Correct 0 ms 224 KB Output is correct
44 Correct 0 ms 224 KB Output is correct
45 Correct 0 ms 224 KB Output is correct
46 Correct 0 ms 224 KB Output is correct
47 Correct 0 ms 224 KB Output is correct
48 Correct 1 ms 224 KB Output is correct
49 Correct 1 ms 224 KB Output is correct
50 Correct 0 ms 224 KB Output is correct
51 Correct 0 ms 224 KB Output is correct
52 Correct 1 ms 352 KB Output is correct
53 Correct 1 ms 352 KB Output is correct
54 Correct 3 ms 864 KB Output is correct
55 Correct 3 ms 864 KB Output is correct
56 Correct 28 ms 6564 KB Output is correct
57 Correct 25 ms 6624 KB Output is correct
58 Correct 27 ms 6612 KB Output is correct
59 Correct 23 ms 6480 KB Output is correct
60 Correct 30 ms 6548 KB Output is correct
61 Correct 32 ms 6616 KB Output is correct
62 Correct 29 ms 6488 KB Output is correct
63 Correct 24 ms 6608 KB Output is correct
64 Correct 25 ms 6608 KB Output is correct
65 Correct 26 ms 6612 KB Output is correct
66 Correct 24 ms 6496 KB Output is correct
67 Correct 26 ms 6612 KB Output is correct
68 Correct 27 ms 6496 KB Output is correct
69 Correct 0 ms 224 KB Output is correct
70 Correct 1 ms 224 KB Output is correct
71 Correct 26 ms 6592 KB Output is correct
72 Correct 28 ms 6604 KB Output is correct
73 Correct 24 ms 6476 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 27 ms 6520 KB Output is correct
79 Correct 25 ms 6552 KB Output is correct
80 Correct 25 ms 6596 KB Output is correct
81 Correct 26 ms 6568 KB Output is correct
82 Correct 29 ms 6468 KB Output is correct
83 Correct 28 ms 6592 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 0 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 0 ms 212 KB Output is correct
88 Correct 0 ms 340 KB Output is correct
89 Correct 1 ms 340 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 3 ms 852 KB Output is correct
102 Correct 3 ms 852 KB Output is correct
103 Correct 29 ms 6612 KB Output is correct
104 Correct 25 ms 6600 KB Output is correct
105 Correct 29 ms 6608 KB Output is correct
106 Correct 31 ms 6556 KB Output is correct
107 Correct 27 ms 6464 KB Output is correct
108 Correct 26 ms 6484 KB Output is correct
109 Correct 26 ms 6584 KB Output is correct
110 Correct 29 ms 6476 KB Output is correct
111 Correct 29 ms 6584 KB Output is correct
112 Correct 27 ms 6604 KB Output is correct
113 Correct 27 ms 6472 KB Output is correct
114 Correct 28 ms 6476 KB Output is correct
115 Correct 25 ms 6604 KB Output is correct