oj.uz

Submission #775789

# Submission time Handle Problem Language Result Execution time Memory
775789 2023-07-07T01:23:15 Z Sandarach151 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 165 ms 141316 KB 
#include<bits/stdc++.h>
using namespace std;

class segmentTree{
    private:
        int sze;
        vector<int> vect;
        void privUpdate(int pos, int val, int nodepos, int nodeleft, int noderight){
            if(nodeleft==noderight){
                vect[nodepos]=val;
            }
            else{
                int nodemid = (nodeleft+noderight)/2;
                if(pos<=nodemid){
                    privUpdate(pos, val, 2*nodepos+1, nodeleft, nodemid);
                }
                else{
                    privUpdate(pos, val, 2*nodepos+2, nodemid+1, noderight);
                }
                vect[nodepos]=vect[2*nodepos+1]+vect[2*nodepos+2];
            }
        }
        int privGetSum(int queryleft, int queryright, int nodepos, int nodeleft, int noderight){
            if(queryleft>noderight || queryright<nodeleft){
                return 0;
            }
            else if(queryleft<=nodeleft && queryright>=noderight){
                return vect[nodepos];
            }
            else{
                int nodemid = (nodeleft+noderight)/2;
                return privGetSum(queryleft, queryright, 2*nodepos+1, nodeleft, nodemid)+privGetSum(queryleft, queryright, 2*nodepos+2, nodemid+1, noderight);
            }
        }
    public:
        segmentTree(int n): sze(n){
            vect.resize(4*sze, 0);
        }
        void update(int pos, int val){
            privUpdate(pos, val, 0, 0, sze-1);
        }
        int getSum(int left, int right){
            return privGetSum(left, right, 0, 0, sze-1);
        }
};


long long count_swaps(std::vector<int> s) {
    int n = s.size()/2;
	queue<int> negative[n+1];
    queue<int> positive[n+1];
    segmentTree stree(2*n);
    long long ans = 0;
    for(int i=0; i<2*n; i++){
        if(s[i]<0){
            if(!positive[-1*s[i]].empty()){
                stree.update(i, -1);
                stree.update(positive[-1*s[i]].front(), 1);
                ans+= i-positive[-1*s[i]].front()+stree.getSum(positive[-1*s[i]].front(), i);
                positive[-1*s[i]].pop();
            }
            else{
                negative[-1*s[i]].push(i);
            }
        }
        else{
            if(!negative[s[i]].empty()){
                stree.update(i, -1);
                stree.update(negative[s[i]].front(), 1);
                ans+= i-negative[s[i]].front()-1+stree.getSum(negative[s[i]].front(), i);
                negative[s[i]].pop();
            }
            else{
                positive[s[i]].push(i);
            }
        }
    }
    return ans;
}

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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 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 1 ms 296 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 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 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 668 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 1 ms 1620 KB Output is correct
20 Correct 11 ms 14324 KB Output is correct
21 Correct 11 ms 14292 KB Output is correct
22 Correct 114 ms 140860 KB Output is correct
23 Correct 110 ms 140836 KB Output is correct
24 Correct 112 ms 140852 KB Output is correct
25 Correct 115 ms 141000 KB Output is correct
26 Correct 116 ms 140808 KB Output is correct
27 Correct 117 ms 140620 KB Output is correct
28 Correct 115 ms 141316 KB Output is correct
29 Correct 113 ms 141260 KB Output is correct
30 Correct 114 ms 141220 KB Output is correct
31 Correct 114 ms 140896 KB Output is correct
32 Correct 112 ms 141232 KB Output is correct
33 Correct 113 ms 141100 KB Output is correct
34 Correct 113 ms 141260 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 300 KB Output is correct
37 Correct 112 ms 141260 KB Output is correct
38 Correct 121 ms 141224 KB Output is correct
39 Correct 111 ms 141264 KB Output is correct

Subtask #4
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 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 142 ms 140792 KB Output is correct
6 Correct 122 ms 140748 KB Output is correct
7 Correct 148 ms 141028 KB Output is correct
8 Correct 114 ms 141260 KB Output is correct
9 Correct 141 ms 140804 KB Output is correct
10 Correct 128 ms 140832 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 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 1 ms 296 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 300 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 1620 KB Output is correct
42 Correct 1 ms 1620 KB Output is correct
43 Correct 1 ms 1620 KB Output is correct
44 Correct 2 ms 1620 KB Output is correct
45 Correct 2 ms 1576 KB Output is correct
46 Correct 2 ms 1620 KB Output is correct
47 Correct 1 ms 1620 KB Output is correct
48 Correct 1 ms 1620 KB Output is correct
49 Correct 2 ms 1620 KB Output is correct
50 Correct 1 ms 1620 KB Output is correct
51 Correct 1 ms 1620 KB Output is correct
52 Correct 1 ms 1620 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 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 1 ms 296 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 300 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 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 300 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 304 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 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 668 KB Output is correct
52 Correct 2 ms 1620 KB Output is correct
53 Correct 1 ms 1620 KB Output is correct
54 Correct 11 ms 14324 KB Output is correct
55 Correct 11 ms 14292 KB Output is correct
56 Correct 114 ms 140860 KB Output is correct
57 Correct 110 ms 140836 KB Output is correct
58 Correct 112 ms 140852 KB Output is correct
59 Correct 115 ms 141000 KB Output is correct
60 Correct 116 ms 140808 KB Output is correct
61 Correct 117 ms 140620 KB Output is correct
62 Correct 115 ms 141316 KB Output is correct
63 Correct 113 ms 141260 KB Output is correct
64 Correct 114 ms 141220 KB Output is correct
65 Correct 114 ms 140896 KB Output is correct
66 Correct 112 ms 141232 KB Output is correct
67 Correct 113 ms 141100 KB Output is correct
68 Correct 113 ms 141260 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 300 KB Output is correct
71 Correct 112 ms 141260 KB Output is correct
72 Correct 121 ms 141224 KB Output is correct
73 Correct 111 ms 141264 KB Output is correct
74 Correct 1 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 1 ms 300 KB Output is correct
78 Correct 142 ms 140792 KB Output is correct
79 Correct 122 ms 140748 KB Output is correct
80 Correct 148 ms 141028 KB Output is correct
81 Correct 114 ms 141260 KB Output is correct
82 Correct 141 ms 140804 KB Output is correct
83 Correct 128 ms 140832 KB Output is correct
84 Correct 0 ms 300 KB Output is correct
85 Correct 1 ms 296 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 596 KB Output is correct
88 Correct 1 ms 1620 KB Output is correct
89 Correct 1 ms 1620 KB Output is correct
90 Correct 1 ms 1620 KB Output is correct
91 Correct 2 ms 1620 KB Output is correct
92 Correct 2 ms 1576 KB Output is correct
93 Correct 2 ms 1620 KB Output is correct
94 Correct 1 ms 1620 KB Output is correct
95 Correct 1 ms 1620 KB Output is correct
96 Correct 2 ms 1620 KB Output is correct
97 Correct 1 ms 1620 KB Output is correct
98 Correct 1 ms 1620 KB Output is correct
99 Correct 1 ms 1620 KB Output is correct
100 Correct 2 ms 1620 KB Output is correct
101 Correct 13 ms 14268 KB Output is correct
102 Correct 19 ms 14440 KB Output is correct
103 Correct 161 ms 140836 KB Output is correct
104 Correct 130 ms 140844 KB Output is correct
105 Correct 139 ms 140836 KB Output is correct
106 Correct 138 ms 140872 KB Output is correct
107 Correct 120 ms 140848 KB Output is correct
108 Correct 120 ms 140840 KB Output is correct
109 Correct 117 ms 141308 KB Output is correct
110 Correct 121 ms 141224 KB Output is correct
111 Correct 165 ms 140748 KB Output is correct
112 Correct 151 ms 140848 KB Output is correct
113 Correct 162 ms 140848 KB Output is correct
114 Correct 143 ms 140848 KB Output is correct
115 Correct 140 ms 140860 KB Output is correct