oj.uz

Submission #143642

# Submission time Handle Problem Language Result Execution time Memory
143642 2019-08-14T19:39:09 Z JustInCase Arranging Shoes (IOI19_shoes) C++17
100 / 100
 867 ms 150952 KB 
#include <bits/stdc++.h>

#ifndef LOCAL
	#include "shoes.h"
	#define int32_t int
	#define int64_t long long
#endif

const int32_t MAX_N = 2e5;

struct SegmentTree {
	int32_t treeSize;
	int32_t data[4 * MAX_N + 5], lazy[4 * MAX_N + 5];	

	void init(int32_t _treeSize) {
		treeSize = _treeSize;
	}

	void push_lazy(int32_t node, int32_t low, int32_t high) {
		if(lazy[node] == 0) {
			return;
		}

		data[node] += lazy[node];
		if(low != high) {
			lazy[2 * node] += lazy[node];
			lazy[2 * node + 1] += lazy[node];
		}
		lazy[node] = 0;
	}

	void update(int32_t node, int32_t low, int32_t high, int32_t qLow, int32_t qHigh, int32_t qVal) {
		push_lazy(node, low, high);

		if(low > qHigh || high < qLow) {
			return;
		}
		else if(low >= qLow && high <= qHigh) {
			lazy[node] += qVal;
			push_lazy(node, low, high);
			return;
		}

		int32_t mid = (low + high) / 2;
		update(2 * node, low, mid, qLow, qHigh, qVal);
		update(2 * node + 1, mid + 1, high, qLow, qHigh, qVal);
	}

	int32_t query(int32_t node, int32_t low, int32_t high, int32_t qInd) {
		push_lazy(node, low, high);

		if(low > qInd || high < qInd) {
			return 0;
		}
		else if(low == qInd && high == qInd) {
			return data[node];
		}

		int32_t mid = (low + high) / 2;
		return std::max(query(2 * node, low, mid, qInd), query(2 * node + 1, mid + 1, high, qInd));
	}
};

SegmentTree segTree;

int64_t count_swaps(std::vector< int32_t > s) {
	int32_t n = s.size();
	
	int64_t ans = 0;
	
	std::map< int32_t, std::queue< int32_t > > lastOccurance;
	std::vector< int32_t > pairInd(n, -1);
	for(int32_t i = 0; i < n; i++) {
		if(!lastOccurance[-s[i]].empty()) {
			if(s[i] < 0) {
				ans++;
			}
			pairInd[lastOccurance[-s[i]].front()] = i;
			lastOccurance[-s[i]].pop();
		}
		else {
			lastOccurance[s[i]].push(i);
		}
	}

	segTree.init(n);
	for(int32_t i = 0; i < n; i++) {
		if(pairInd[i] != -1) {
			int32_t ind1 = i + segTree.query(1, 1, n, i + 1);
			int32_t ind2 = pairInd[i] + segTree.query(1, 1, n, pairInd[i] + 1);
			
			ans += (int64_t) ind2 - ind1 - 1;
			segTree.update(1, 1, n, i + 1, pairInd[i] + 1, 1);
		}
	}

	return ans;
}

#ifdef LOCAL
int main() {
	int32_t n;
	std::cin >> n;

	std::vector< int32_t > v(2 * n);
	for(int32_t i = 0; i < 2 * n; i++) {
		std::cin >> v[i];
	}

	std::cout << count_swaps(v) << '\n';
}
#endif

Subtask #1
10.0 / 10.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

Subtask #2
20.0 / 20.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 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 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 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 252 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 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 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 11 ms 1020 KB Output is correct
21 Correct 11 ms 1144 KB Output is correct
22 Correct 98 ms 6776 KB Output is correct
23 Correct 86 ms 5728 KB Output is correct
24 Correct 95 ms 6776 KB Output is correct
25 Correct 97 ms 7160 KB Output is correct
26 Correct 98 ms 6852 KB Output is correct
27 Correct 83 ms 5856 KB Output is correct
28 Correct 98 ms 7244 KB Output is correct
29 Correct 98 ms 7288 KB Output is correct
30 Correct 99 ms 7172 KB Output is correct
31 Correct 99 ms 6776 KB Output is correct
32 Correct 97 ms 7288 KB Output is correct
33 Correct 96 ms 7168 KB Output is correct
34 Correct 98 ms 7160 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 99 ms 7336 KB Output is correct
38 Correct 98 ms 7160 KB Output is correct
39 Correct 101 ms 7212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 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 693 ms 150872 KB Output is correct
6 Correct 225 ms 19524 KB Output is correct
7 Correct 723 ms 150856 KB Output is correct
8 Correct 104 ms 7220 KB Output is correct
9 Correct 723 ms 150952 KB Output is correct
10 Correct 533 ms 79076 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 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 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 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 252 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 3 ms 632 KB Output is correct
41 Correct 4 ms 1784 KB Output is correct
42 Correct 5 ms 1912 KB Output is correct
43 Correct 5 ms 1656 KB Output is correct
44 Correct 5 ms 1528 KB Output is correct
45 Correct 5 ms 1272 KB Output is correct
46 Correct 4 ms 1144 KB Output is correct
47 Correct 4 ms 1016 KB Output is correct
48 Correct 4 ms 888 KB Output is correct
49 Correct 4 ms 632 KB Output is correct
50 Correct 1 ms 376 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 5 ms 1784 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 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 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 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 252 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 380 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 380 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 3 ms 376 KB Output is correct
53 Correct 3 ms 376 KB Output is correct
54 Correct 11 ms 1020 KB Output is correct
55 Correct 11 ms 1144 KB Output is correct
56 Correct 98 ms 6776 KB Output is correct
57 Correct 86 ms 5728 KB Output is correct
58 Correct 95 ms 6776 KB Output is correct
59 Correct 97 ms 7160 KB Output is correct
60 Correct 98 ms 6852 KB Output is correct
61 Correct 83 ms 5856 KB Output is correct
62 Correct 98 ms 7244 KB Output is correct
63 Correct 98 ms 7288 KB Output is correct
64 Correct 99 ms 7172 KB Output is correct
65 Correct 99 ms 6776 KB Output is correct
66 Correct 97 ms 7288 KB Output is correct
67 Correct 96 ms 7168 KB Output is correct
68 Correct 98 ms 7160 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 99 ms 7336 KB Output is correct
72 Correct 98 ms 7160 KB Output is correct
73 Correct 101 ms 7212 KB Output is correct
74 Correct 2 ms 376 KB Output is correct
75 Correct 2 ms 380 KB Output is correct
76 Correct 2 ms 256 KB Output is correct
77 Correct 2 ms 376 KB Output is correct
78 Correct 693 ms 150872 KB Output is correct
79 Correct 225 ms 19524 KB Output is correct
80 Correct 723 ms 150856 KB Output is correct
81 Correct 104 ms 7220 KB Output is correct
82 Correct 723 ms 150952 KB Output is correct
83 Correct 533 ms 79076 KB Output is correct
84 Correct 2 ms 376 KB Output is correct
85 Correct 2 ms 376 KB Output is correct
86 Correct 2 ms 504 KB Output is correct
87 Correct 3 ms 632 KB Output is correct
88 Correct 4 ms 1784 KB Output is correct
89 Correct 5 ms 1912 KB Output is correct
90 Correct 5 ms 1656 KB Output is correct
91 Correct 5 ms 1528 KB Output is correct
92 Correct 5 ms 1272 KB Output is correct
93 Correct 4 ms 1144 KB Output is correct
94 Correct 4 ms 1016 KB Output is correct
95 Correct 4 ms 888 KB Output is correct
96 Correct 4 ms 632 KB Output is correct
97 Correct 1 ms 376 KB Output is correct
98 Correct 3 ms 376 KB Output is correct
99 Correct 5 ms 1784 KB Output is correct
100 Correct 5 ms 1784 KB Output is correct
101 Correct 49 ms 14072 KB Output is correct
102 Correct 24 ms 4124 KB Output is correct
103 Correct 867 ms 150900 KB Output is correct
104 Correct 636 ms 149820 KB Output is correct
105 Correct 495 ms 88548 KB Output is correct
106 Correct 723 ms 150904 KB Output is correct
107 Correct 233 ms 22868 KB Output is correct
108 Correct 287 ms 37760 KB Output is correct
109 Correct 100 ms 7160 KB Output is correct
110 Correct 100 ms 7400 KB Output is correct
111 Correct 714 ms 134892 KB Output is correct
112 Correct 641 ms 118964 KB Output is correct
113 Correct 277 ms 24620 KB Output is correct
114 Correct 706 ms 150904 KB Output is correct
115 Correct 813 ms 150860 KB Output is correct