oj.uz

Submission #185295

# Submission time Handle Problem Language Result Execution time Memory
185295 2020-01-11T10:13:28 Z aggu_01000101 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 402 ms 33136 KB 
#include <iostream>
#include <vector>
#include <shoes.h>
#include <map>
#include <unordered_map>
#define int long long
#define mid(l, u) ((l+u)/2)
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
using namespace std;
int query(int l, int u, int i, int ll, int uu, int segtree[], int lazy[]){
    if(lazy[i]){
        segtree[i]+=(u-l+1)*lazy[i];
        if(l!=u){
            lazy[lchild(i)]+=lazy[i];
            lazy[rchild(i)]+=lazy[i];
        }
        lazy[i] = 0;
    }
    if(l>=ll && u<=uu) return segtree[i];
    if(l>uu || u<ll) return 0;
    return query(l, mid(l, u), lchild(i), ll, uu, segtree, lazy) + query(mid(l, u)+1, u, rchild(i), ll, uu, segtree, lazy);
}
int update(int l, int u, int i, int ll, int uu, int segtree[], int lazy[]){
    if(ll>uu) return 0;
    if(lazy[i]){
        segtree[i]+=(u-l+1)*lazy[i];
        if(l!=u){
            lazy[lchild(i)]+=lazy[i];
            lazy[rchild(i)]+=lazy[i];
        }
        lazy[i] = 0;
    }
    if(l>=ll && u<=uu){
        segtree[i] += (u-l+1);
        if(l!=u){
            lazy[lchild(i)]++;
            lazy[rchild(i)]++;
        }
        return segtree[i];
    }
    if(l>uu || u<ll) return segtree[i];
    return segtree[i] = update(l, mid(l, u), lchild(i), ll, uu, segtree, lazy) + update(mid(l, u)+1, u, rchild(i), ll, uu, segtree, lazy);
}
int count_swaps(vector<int32_t> s){
    int n = s.size();
    //cout<<n<<endl;
    int segtree[4*n], lazy[4*n];
    for(int i = 0;i<4*n;i++) segtree[i] = lazy[i] = 0;
    unordered_map<int, vector<int>> mp;
    for(int i = n-1;i>=0;i--){
        mp[s[i]].push_back(i);
    }
    int ans = 0;
    for(int i = 0;i<n;i++){
        //cout<<i<<" "<<mp[-s[i]][mp[-s[i]].size()-1]<<endl;
        if(mp[-s[i]][mp[-s[i]].size()-1]>i) continue;
        int oind = mp[-s[i]][mp[-s[i]].size()-1];
        int toadd;
        if(s[i]>0){
            toadd = i - oind - 1;
            toadd-=query(0, n-1, 0, oind, oind, segtree, lazy);
        }
        else{
            toadd = i - oind;
            toadd-=query(0, n-1, 0, oind, oind, segtree, lazy);
        }
        //cout<<i<<" "<<mp[-s[i]]<<" "<<toadd<<endl;
        ans+=toadd;
        update(0, n-1, 0, oind+1, i-1, segtree,lazy);
        mp[-s[i]].pop_back();
        mp[s[i]].pop_back();
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 1 ms 380 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 356 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 4 ms 532 KB Output is correct
20 Correct 15 ms 2168 KB Output is correct
21 Correct 15 ms 2040 KB Output is correct
22 Correct 136 ms 17528 KB Output is correct
23 Correct 83 ms 17512 KB Output is correct
24 Correct 121 ms 17444 KB Output is correct
25 Correct 131 ms 17772 KB Output is correct
26 Correct 132 ms 17528 KB Output is correct
27 Correct 80 ms 17324 KB Output is correct
28 Correct 133 ms 18156 KB Output is correct
29 Correct 134 ms 18032 KB Output is correct
30 Correct 136 ms 18032 KB Output is correct
31 Correct 130 ms 17520 KB Output is correct
32 Correct 134 ms 18072 KB Output is correct
33 Correct 148 ms 17772 KB Output is correct
34 Correct 134 ms 18028 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 132 ms 18024 KB Output is correct
38 Correct 137 ms 18000 KB Output is correct
39 Correct 134 ms 18028 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 305 ms 31844 KB Output is correct
6 Correct 198 ms 18172 KB Output is correct
7 Correct 307 ms 33000 KB Output is correct
8 Correct 142 ms 17836 KB Output is correct
9 Correct 327 ms 32956 KB Output is correct
10 Correct 398 ms 24840 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 1 ms 376 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 396 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 400 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 2 ms 356 KB Output is correct
45 Correct 2 ms 256 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 4 ms 532 KB Output is correct
54 Correct 15 ms 2168 KB Output is correct
55 Correct 15 ms 2040 KB Output is correct
56 Correct 136 ms 17528 KB Output is correct
57 Correct 83 ms 17512 KB Output is correct
58 Correct 121 ms 17444 KB Output is correct
59 Correct 131 ms 17772 KB Output is correct
60 Correct 132 ms 17528 KB Output is correct
61 Correct 80 ms 17324 KB Output is correct
62 Correct 133 ms 18156 KB Output is correct
63 Correct 134 ms 18032 KB Output is correct
64 Correct 136 ms 18032 KB Output is correct
65 Correct 130 ms 17520 KB Output is correct
66 Correct 134 ms 18072 KB Output is correct
67 Correct 148 ms 17772 KB Output is correct
68 Correct 134 ms 18028 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 132 ms 18024 KB Output is correct
72 Correct 137 ms 18000 KB Output is correct
73 Correct 134 ms 18028 KB Output is correct
74 Correct 2 ms 256 KB Output is correct
75 Correct 2 ms 256 KB Output is correct
76 Correct 2 ms 376 KB Output is correct
77 Correct 2 ms 256 KB Output is correct
78 Correct 305 ms 31844 KB Output is correct
79 Correct 198 ms 18172 KB Output is correct
80 Correct 307 ms 33000 KB Output is correct
81 Correct 142 ms 17836 KB Output is correct
82 Correct 327 ms 32956 KB Output is correct
83 Correct 398 ms 24840 KB Output is correct
84 Correct 1 ms 376 KB Output is correct
85 Correct 0 ms 376 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 4 ms 632 KB Output is correct
89 Correct 3 ms 632 KB Output is correct
90 Correct 4 ms 632 KB Output is correct
91 Correct 4 ms 680 KB Output is correct
92 Correct 3 ms 504 KB Output is correct
93 Correct 3 ms 632 KB Output is correct
94 Correct 3 ms 508 KB Output is correct
95 Correct 3 ms 504 KB Output is correct
96 Correct 3 ms 504 KB Output is correct
97 Correct 3 ms 504 KB Output is correct
98 Correct 3 ms 504 KB Output is correct
99 Correct 4 ms 632 KB Output is correct
100 Correct 4 ms 632 KB Output is correct
101 Correct 26 ms 3448 KB Output is correct
102 Correct 21 ms 2328 KB Output is correct
103 Correct 402 ms 33084 KB Output is correct
104 Correct 221 ms 33136 KB Output is correct
105 Correct 303 ms 26760 KB Output is correct
106 Correct 317 ms 33084 KB Output is correct
107 Correct 165 ms 19776 KB Output is correct
108 Correct 128 ms 21084 KB Output is correct
109 Correct 132 ms 18412 KB Output is correct
110 Correct 132 ms 18156 KB Output is correct
111 Correct 359 ms 31292 KB Output is correct
112 Correct 352 ms 29628 KB Output is correct
113 Correct 247 ms 19728 KB Output is correct
114 Correct 308 ms 32972 KB Output is correct
115 Correct 319 ms 32960 KB Output is correct