oj.uz

Submission #893544

# Submission time Handle Problem Language Result Execution time Memory
893544 2023-12-27T06:42:35 Z UmairAhmadMirza Arranging Shoes (IOI19_shoes) C++14
100 / 100
 474 ms 150736 KB 
#include <bits/stdc++.h>
using namespace std;
int const N=2e5+5;
map<int,stack<int>> ind;
int n;
long long ans=0;
bool rem[N];
template<class TP> class SegmentTree{
    private://cannot be access outside
        //we can set constant here
        int const DEFAULT = 0;
        int const INF = 1e9;
        //global varibles
        vector<int> segtree;
        int sz;
    public:
        //constructor and it should be 4 * n in top_down segtree
        SegmentTree(int sz) : sz(sz), segtree(sz * 4, DEFAULT){};
        
        //Now here all function we want your data to have
        void recalculate(int node) {
            segtree[node] = segtree[2 * node+1] + segtree[2 * node + 2];
        }
        void update(int node, int left, int right, int ind, int val) {
            if (left == right) //we are in the indth leaf
                segtree[node] = val;
            else {
                int middle = (left + right) / 2;
                if (ind <= middle)//we need to update the left son
                    update(2 * node + 1, left, middle, ind, val);
                else
                    update(2 * node + 2, middle + 1, right, ind, val);
                //after updating said son, recalculate the current segment
                recalculate(node);
            }
        }
        int query(int node, int left, int right, int l, int r) {
            if (l <= left && right <= r) {
                //the segment of "node" is completely included in the query
                return segtree[node];
            }
            else {
                int answer = 0;
                int middle = (left + right) / 2;
                if (l <= middle) {
                    //the query segment and the left son segment have at least one element in common
                    answer += query(2 * node + 1, left, middle, l, r);
                }
                if (r > middle) {
                    //the query segment and the right son segment have at least one element in common
                    answer += query(2 * node + 2, middle + 1, right, l, r);
                }
                return answer;
            }
        }

};
long long count_swaps(vector<int> v){
	n=v.size();
	n/=2;
	for (int i = (2*n)-1; i>=0; --i)
		ind[v[i]].push(i);
	SegmentTree<int> tree(2*n);
	for (int i = 0; i < 2*n; ++i)
	{
		if(rem[i])
			continue;
		if(v[i]>0)
			ans++;
		ind[v[i]].pop();
		rem[i]=1;
		int op=v[i]*(-1);
		int index=ind[op].top();
		ind[op].pop();
		rem[index]=1;
		int swp=(index-i)-1;
		swp-=tree.query(0,1,2*n,i+1,index);
		ans+=swp;
		tree.update(0,1,2*n,index+1,1);
	}
	return ans;
}

Compilation message

shoes.cpp: In instantiation of 'SegmentTree<TP>::SegmentTree(int) [with TP = int]':
shoes.cpp:63:27:   required from here
shoes.cpp:15:13: warning: 'SegmentTree<int>::sz' will be initialized after [-Wreorder]
   15 |         int sz;
      |             ^~
shoes.cpp:14:21: warning:   'std::vector<int> SegmentTree<int>::segtree' [-Wreorder]
   14 |         vector<int> segtree;
      |                     ^~~~~~~
shoes.cpp:18:9: warning:   when initialized here [-Wreorder]
   18 |         SegmentTree(int sz) : sz(sz), segtree(sz * 4, DEFAULT){};
      |         ^~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 440 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 444 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 4 ms 972 KB Output is correct
21 Correct 6 ms 1116 KB Output is correct
22 Correct 41 ms 7264 KB Output is correct
23 Correct 37 ms 7252 KB Output is correct
24 Correct 39 ms 7356 KB Output is correct
25 Correct 41 ms 7004 KB Output is correct
26 Correct 45 ms 7760 KB Output is correct
27 Correct 33 ms 6980 KB Output is correct
28 Correct 41 ms 7296 KB Output is correct
29 Correct 41 ms 7256 KB Output is correct
30 Correct 41 ms 7256 KB Output is correct
31 Correct 40 ms 7260 KB Output is correct
32 Correct 41 ms 7256 KB Output is correct
33 Correct 40 ms 7004 KB Output is correct
34 Correct 44 ms 7260 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 40 ms 7248 KB Output is correct
38 Correct 41 ms 7364 KB Output is correct
39 Correct 41 ms 7252 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 421 ms 150392 KB Output is correct
6 Correct 122 ms 19028 KB Output is correct
7 Correct 416 ms 150452 KB Output is correct
8 Correct 41 ms 7252 KB Output is correct
9 Correct 413 ms 150508 KB Output is correct
10 Correct 311 ms 78676 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 444 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 444 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 440 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 704 KB Output is correct
41 Correct 2 ms 1884 KB Output is correct
42 Correct 2 ms 1880 KB Output is correct
43 Correct 2 ms 1628 KB Output is correct
44 Correct 2 ms 1372 KB Output is correct
45 Correct 1 ms 1216 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 1 ms 860 KB Output is correct
49 Correct 1 ms 712 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 2 ms 1884 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 444 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 444 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 440 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 600 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 440 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 444 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 456 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 4 ms 972 KB Output is correct
55 Correct 6 ms 1116 KB Output is correct
56 Correct 41 ms 7264 KB Output is correct
57 Correct 37 ms 7252 KB Output is correct
58 Correct 39 ms 7356 KB Output is correct
59 Correct 41 ms 7004 KB Output is correct
60 Correct 45 ms 7760 KB Output is correct
61 Correct 33 ms 6980 KB Output is correct
62 Correct 41 ms 7296 KB Output is correct
63 Correct 41 ms 7256 KB Output is correct
64 Correct 41 ms 7256 KB Output is correct
65 Correct 40 ms 7260 KB Output is correct
66 Correct 41 ms 7256 KB Output is correct
67 Correct 40 ms 7004 KB Output is correct
68 Correct 44 ms 7260 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 40 ms 7248 KB Output is correct
72 Correct 41 ms 7364 KB Output is correct
73 Correct 41 ms 7252 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 421 ms 150392 KB Output is correct
79 Correct 122 ms 19028 KB Output is correct
80 Correct 416 ms 150452 KB Output is correct
81 Correct 41 ms 7252 KB Output is correct
82 Correct 413 ms 150508 KB Output is correct
83 Correct 311 ms 78676 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 1 ms 704 KB Output is correct
88 Correct 2 ms 1884 KB Output is correct
89 Correct 2 ms 1880 KB Output is correct
90 Correct 2 ms 1628 KB Output is correct
91 Correct 2 ms 1372 KB Output is correct
92 Correct 1 ms 1216 KB Output is correct
93 Correct 1 ms 1116 KB Output is correct
94 Correct 1 ms 1116 KB Output is correct
95 Correct 1 ms 860 KB Output is correct
96 Correct 1 ms 712 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 2 ms 1884 KB Output is correct
100 Correct 2 ms 1884 KB Output is correct
101 Correct 23 ms 13916 KB Output is correct
102 Correct 11 ms 3672 KB Output is correct
103 Correct 474 ms 150464 KB Output is correct
104 Correct 426 ms 150424 KB Output is correct
105 Correct 362 ms 88148 KB Output is correct
106 Correct 420 ms 150408 KB Output is correct
107 Correct 144 ms 22572 KB Output is correct
108 Correct 199 ms 38572 KB Output is correct
109 Correct 47 ms 7288 KB Output is correct
110 Correct 41 ms 7256 KB Output is correct
111 Correct 447 ms 134992 KB Output is correct
112 Correct 454 ms 118356 KB Output is correct
113 Correct 186 ms 24548 KB Output is correct
114 Correct 465 ms 150352 KB Output is correct
115 Correct 432 ms 150736 KB Output is correct