oj.uz

Submission #653894

# Submission time Handle Problem Language Result Execution time Memory
653894 2022-10-28T18:30:51 Z aryan12 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 139 ms 18772 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

const long long N = 2e5 + 5;
long long BIT[N];

bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
	return (a.second - a.first) < (b.second - b.first);
}

void Update(long long idx, long long val) {
	for(long long i = idx; i < N; i += (i & (-i))) {
		BIT[i] += val;
	}
}

long long Query(long long x) {
	long long ans = 0;
	for(long long i = x; i > 0; i -= (i & (-i))) {
		ans += BIT[i];
	}
	return ans;
}

long long count_swaps(vector<int> input) {
	long long n = input.size();
	vector<pair<long long, long long> > pair_of_shoes;
	vector<long long> pos(n + 1), idx[n + 1];
	for(long long i = 0; i <= n; i++) {
		pos[i] = 0;
	}
	for(long long i = 0; i < n; i++) {
		if(input[i] > 0) {
			input[i] += n / 2;
		}
		else {
			input[i] = abs(input[i]);
		}
		//cout << "input[i] = " << input[i] << "\n";
		idx[input[i]].push_back(i);
		if(input[i] > n / 2) {
			if(pos[input[i] - n / 2] != idx[input[i] - n / 2].size()) {
				long long pos1 = idx[input[i] - n / 2][pos[input[i] - n / 2]], pos2 = idx[input[i]][pos[input[i]]];
				pair_of_shoes.push_back(make_pair(idx[input[i] - n / 2][pos[input[i] - n / 2]], idx[input[i]][pos[input[i]]]));
				pos[input[i] - n / 2]++;
				pos[input[i]]++;
				//cout << "pos1 = " << pos1 << ", pos2 = " << pos2 << " hi\n";
			}
		}
		if(input[i] <= n / 2) {
			if(pos[input[i] + n / 2] != idx[input[i] + n / 2].size()) {
				long long pos1 = idx[input[i] + n / 2][pos[input[i] + n / 2]], pos2 = idx[input[i]][pos[input[i]]];
				pair_of_shoes.push_back(make_pair(idx[input[i] + n / 2][pos[input[i] + n / 2]], idx[input[i]][pos[input[i]]]));
				pos[input[i] + n / 2]++;
				pos[input[i]]++;
				//cout << "pos1 = " << pos1 << ", pos2 = " << pos2 << " omg\n";
			}
		}
	}
	long long ans = 0, res = 0;
	sort(pair_of_shoes.begin(), pair_of_shoes.end(), cmp);
	for(long long i = 0; i < pair_of_shoes.size(); i++) {
		ans += pair_of_shoes[i].second - pair_of_shoes[i].first - 1;
		if(input[pair_of_shoes[i].first] > input[pair_of_shoes[i].second]) {
			ans++;
		}
		pair_of_shoes[i].first++;
		pair_of_shoes[i].second++;
		//cout << pair_of_shoes[i].first << " " << pair_of_shoes[i].second << "\n";
		if(pair_of_shoes[i].first != pair_of_shoes[i].second - 1) {
			Update(pair_of_shoes[i].first + 1, 1);
			Update(pair_of_shoes[i].second, -1);
			long long temp = Query(pair_of_shoes[i].first); //whoever started before pair_of_shoes[i].first
			long long ok = Query(pair_of_shoes[i].second); //whoever started in the middle (also contains the ones which started before pair_of_shoes[i].first)
			res += ok + temp;
			//cout << "ok = " << ok << ", temp = " << temp << "\n";
		}
	}
	return ans - res;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:43:29: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |    if(pos[input[i] - n / 2] != idx[input[i] - n / 2].size()) {
shoes.cpp:44:15: warning: unused variable 'pos1' [-Wunused-variable]
   44 |     long long pos1 = idx[input[i] - n / 2][pos[input[i] - n / 2]], pos2 = idx[input[i]][pos[input[i]]];
      |               ^~~~
shoes.cpp:44:68: warning: unused variable 'pos2' [-Wunused-variable]
   44 |     long long pos1 = idx[input[i] - n / 2][pos[input[i] - n / 2]], pos2 = idx[input[i]][pos[input[i]]];
      |                                                                    ^~~~
shoes.cpp:52:29: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |    if(pos[input[i] + n / 2] != idx[input[i] + n / 2].size()) {
shoes.cpp:53:15: warning: unused variable 'pos1' [-Wunused-variable]
   53 |     long long pos1 = idx[input[i] + n / 2][pos[input[i] + n / 2]], pos2 = idx[input[i]][pos[input[i]]];
      |               ^~~~
shoes.cpp:53:68: warning: unused variable 'pos2' [-Wunused-variable]
   53 |     long long pos1 = idx[input[i] + n / 2][pos[input[i] + n / 2]], pos2 = idx[input[i]][pos[input[i]]];
      |                                                                    ^~~~
shoes.cpp:63:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for(long long i = 0; i < pair_of_shoes.size(); i++) {
      |                       ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 4 ms 1992 KB Output is correct
21 Correct 4 ms 1900 KB Output is correct
22 Correct 42 ms 14128 KB Output is correct
23 Correct 32 ms 12572 KB Output is correct
24 Correct 40 ms 14364 KB Output is correct
25 Correct 39 ms 13980 KB Output is correct
26 Correct 43 ms 14220 KB Output is correct
27 Correct 31 ms 12460 KB Output is correct
28 Correct 39 ms 14228 KB Output is correct
29 Correct 36 ms 14184 KB Output is correct
30 Correct 38 ms 14212 KB Output is correct
31 Correct 41 ms 14364 KB Output is correct
32 Correct 39 ms 14180 KB Output is correct
33 Correct 39 ms 13912 KB Output is correct
34 Correct 38 ms 14156 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 37 ms 14168 KB Output is correct
38 Correct 40 ms 14120 KB Output is correct
39 Correct 37 ms 14172 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 252 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 78 ms 18772 KB Output is correct
6 Correct 52 ms 15008 KB Output is correct
7 Correct 71 ms 18772 KB Output is correct
8 Correct 38 ms 14704 KB Output is correct
9 Correct 76 ms 18656 KB Output is correct
10 Correct 78 ms 16016 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 308 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 452 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 444 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 444 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 308 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 312 KB Output is correct
45 Correct 1 ms 312 KB Output is correct
46 Correct 1 ms 312 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 316 KB Output is correct
51 Correct 1 ms 312 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 4 ms 1992 KB Output is correct
55 Correct 4 ms 1900 KB Output is correct
56 Correct 42 ms 14128 KB Output is correct
57 Correct 32 ms 12572 KB Output is correct
58 Correct 40 ms 14364 KB Output is correct
59 Correct 39 ms 13980 KB Output is correct
60 Correct 43 ms 14220 KB Output is correct
61 Correct 31 ms 12460 KB Output is correct
62 Correct 39 ms 14228 KB Output is correct
63 Correct 36 ms 14184 KB Output is correct
64 Correct 38 ms 14212 KB Output is correct
65 Correct 41 ms 14364 KB Output is correct
66 Correct 39 ms 14180 KB Output is correct
67 Correct 39 ms 13912 KB Output is correct
68 Correct 38 ms 14156 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 37 ms 14168 KB Output is correct
72 Correct 40 ms 14120 KB Output is correct
73 Correct 37 ms 14172 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 0 ms 252 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 78 ms 18772 KB Output is correct
79 Correct 52 ms 15008 KB Output is correct
80 Correct 71 ms 18772 KB Output is correct
81 Correct 38 ms 14704 KB Output is correct
82 Correct 76 ms 18656 KB Output is correct
83 Correct 78 ms 16016 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 468 KB Output is correct
89 Correct 1 ms 468 KB Output is correct
90 Correct 1 ms 452 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 1 ms 444 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 1 ms 444 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 468 KB Output is correct
101 Correct 7 ms 1984 KB Output is correct
102 Correct 7 ms 1728 KB Output is correct
103 Correct 139 ms 18680 KB Output is correct
104 Correct 85 ms 17140 KB Output is correct
105 Correct 95 ms 16424 KB Output is correct
106 Correct 77 ms 18772 KB Output is correct
107 Correct 58 ms 15088 KB Output is correct
108 Correct 57 ms 13876 KB Output is correct
109 Correct 42 ms 14972 KB Output is correct
110 Correct 38 ms 14204 KB Output is correct
111 Correct 78 ms 17980 KB Output is correct
112 Correct 92 ms 17320 KB Output is correct
113 Correct 63 ms 15116 KB Output is correct
114 Correct 76 ms 18736 KB Output is correct
115 Correct 83 ms 18752 KB Output is correct