oj.uz

Submission #698518

# Submission time Handle Problem Language Result Execution time Memory
698518 2023-02-13T16:42:28 Z Boomyday Arranging Shoes (IOI19_shoes) C++17
100 / 100
 89 ms 23472 KB 


//
// Created by adavy on 2/11/2023.
//
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U

tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!



vi numShoes;
int n;
void ad(int i, int x){
    while(i<=n){
        numShoes[i] += x;
        i += i&(-i);
    }
}


int sm(int i){
    int s=0;
    //cout << i << endl;
    while(i>=1) {

        s += numShoes[i];
        i -= i & (-i);
    }
    return s;
}
ll count_swaps(vi S){
    n = len(S);
    vi shoes(n);

    F0R(i, n) shoes[i] = S[i];


    numShoes.resize(n+1);
    fill(all(numShoes), 0);
    FOR(i, 1, n+1) ad(i, 1);

    V<priority_queue<int, vector<int>, greater<int>>> pos(n+1);
    V<priority_queue<int, vector<int>, greater<int>>> neg(n+1);

    F0R(sh, len(shoes)){

        if(shoes[sh]>0) pos[shoes[sh]].push(sh);

        else neg[-shoes[sh]].push(sh);
    }
    //cout << "Foo" << endl;
    ll tot = 0;
    F0R(sh, len(shoes)){
        if (shoes[sh]==0) continue;
        //cout << sh << " "<< shoes[sh] << endl;
        if(shoes[sh]>0){


            pos[shoes[sh]].pop();
            int next_sh = neg[shoes[sh]].top(); neg[shoes[sh]].pop();
            //cout << "Bar" << endl;
            shoes[next_sh] = 0;
            tot += sm(next_sh) - sm(sh);
            ad(next_sh+1, -1); ad(sh+1, -1);
        }
        else{
            neg[-shoes[sh]].pop();
            int next_sh = pos[-shoes[sh]].top(); pos[-shoes[sh]].pop();
            shoes[next_sh] = 0;
            tot += sm(next_sh) - sm(sh+1);
            ad(next_sh+1, -1); ad(sh+1, -1);
        }

    }
    return tot;

}


/*int main(){
    int k;
    cin >> k;
    vi shs(k);
    F0R(i, k) cin >> shs[i];
    cout << count_swaps(shs) << endl;
}*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 304 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 296 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 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 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 296 KB Output is correct
35 Correct 0 ms 296 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 5 ms 2132 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 51 ms 18036 KB Output is correct
23 Correct 49 ms 18144 KB Output is correct
24 Correct 53 ms 18216 KB Output is correct
25 Correct 47 ms 18088 KB Output is correct
26 Correct 58 ms 18236 KB Output is correct
27 Correct 48 ms 18024 KB Output is correct
28 Correct 50 ms 18332 KB Output is correct
29 Correct 47 ms 18372 KB Output is correct
30 Correct 52 ms 18344 KB Output is correct
31 Correct 52 ms 18024 KB Output is correct
32 Correct 47 ms 18344 KB Output is correct
33 Correct 47 ms 18168 KB Output is correct
34 Correct 48 ms 18340 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 0 ms 296 KB Output is correct
37 Correct 48 ms 18340 KB Output is correct
38 Correct 52 ms 18460 KB Output is correct
39 Correct 50 ms 18344 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 61 ms 23340 KB Output is correct
6 Correct 54 ms 18600 KB Output is correct
7 Correct 60 ms 23452 KB Output is correct
8 Correct 51 ms 18096 KB Output is correct
9 Correct 59 ms 23468 KB Output is correct
10 Correct 64 ms 20368 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 304 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 296 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 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 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 296 KB Output is correct
35 Correct 0 ms 296 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 432 KB Output is correct
42 Correct 1 ms 432 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 432 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 304 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 296 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 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 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 296 KB Output is correct
35 Correct 0 ms 296 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 300 KB Output is correct
38 Correct 1 ms 300 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 300 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 300 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 5 ms 2132 KB Output is correct
55 Correct 5 ms 2132 KB Output is correct
56 Correct 51 ms 18036 KB Output is correct
57 Correct 49 ms 18144 KB Output is correct
58 Correct 53 ms 18216 KB Output is correct
59 Correct 47 ms 18088 KB Output is correct
60 Correct 58 ms 18236 KB Output is correct
61 Correct 48 ms 18024 KB Output is correct
62 Correct 50 ms 18332 KB Output is correct
63 Correct 47 ms 18372 KB Output is correct
64 Correct 52 ms 18344 KB Output is correct
65 Correct 52 ms 18024 KB Output is correct
66 Correct 47 ms 18344 KB Output is correct
67 Correct 47 ms 18168 KB Output is correct
68 Correct 48 ms 18340 KB Output is correct
69 Correct 1 ms 296 KB Output is correct
70 Correct 0 ms 296 KB Output is correct
71 Correct 48 ms 18340 KB Output is correct
72 Correct 52 ms 18460 KB Output is correct
73 Correct 50 ms 18344 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 61 ms 23340 KB Output is correct
79 Correct 54 ms 18600 KB Output is correct
80 Correct 60 ms 23452 KB Output is correct
81 Correct 51 ms 18096 KB Output is correct
82 Correct 59 ms 23468 KB Output is correct
83 Correct 64 ms 20368 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 432 KB Output is correct
89 Correct 1 ms 432 KB Output is correct
90 Correct 1 ms 468 KB Output is correct
91 Correct 2 ms 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 432 KB Output is correct
94 Correct 1 ms 468 KB Output is correct
95 Correct 1 ms 468 KB Output is correct
96 Correct 1 ms 468 KB Output is correct
97 Correct 1 ms 468 KB Output is correct
98 Correct 1 ms 468 KB Output is correct
99 Correct 1 ms 468 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 10 ms 2532 KB Output is correct
102 Correct 5 ms 2132 KB Output is correct
103 Correct 81 ms 23368 KB Output is correct
104 Correct 89 ms 23360 KB Output is correct
105 Correct 76 ms 20780 KB Output is correct
106 Correct 60 ms 23472 KB Output is correct
107 Correct 57 ms 18804 KB Output is correct
108 Correct 66 ms 19164 KB Output is correct
109 Correct 50 ms 18452 KB Output is correct
110 Correct 53 ms 18340 KB Output is correct
111 Correct 65 ms 22700 KB Output is correct
112 Correct 77 ms 22044 KB Output is correct
113 Correct 55 ms 18736 KB Output is correct
114 Correct 60 ms 23452 KB Output is correct
115 Correct 60 ms 23464 KB Output is correct