oj.uz

Submission #679379

# Submission time Handle Problem Language Result Execution time Memory
679379 2023-01-08T07:33:59 Z Nahian9696 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 99 ms 24516 KB 
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

// #define int long long

#define f0(i, n) for(int i = 0; i < n; i++)
#define f1(i, n) for(int i = 1; i <= n; i++)

bool compare(pair<long long, long long> p1, pair<long long, long long> p2) {
	long long ind1 = p1.first + p1.second;
	long long ind2 = p2.first + p2.second;
	if(p1.first > p1.second) ind1++;
	if(p2.first > p2.second) ind2++;
	return ind1 < ind2;
}

class segment_tree {
	private:
	long long size, size_n;
	vector<long long> tree;

	public:
	segment_tree(long long n, vector<long long> arr) {
		long long base = 1;
		while(base < 2*n) base *= 2;
		size = base;
		tree.resize(size, 0);
		base /= 2;
		size_n = base;
		f0(i, n) tree[i + base] = arr[i];
		for(long long i = base - 1; i >= 0; i--) {
			tree[i] = tree[2*i] + tree[2*i + 1];
		}
	}
	void update(long long ind, long long val) {
		ind += size_n;
		long long delta = val - tree[ind];
		while(ind > 0) {
			tree[ind] += delta;
			ind /= 2;
		}
	}
	long long query(long long l, long long r) {
		l += size_n;
		r += size_n;
		long long res = 0;
		while( l <= r) {
			if(l % 2 == 1) {
				res += tree[l];
				l++;
			}
			if(r % 2 == 0) {
				res += tree[r];
				r--;
			}
			l /= 2;
			r /= 2;
		}
		return res;
	}
};

long long count_swaps(std::vector<int> s) {
	long long n = s.size()/2;
	vector<pair<long long, long long>> pp;

	vector<long long> v[n+1][2];

	f0(i, 2*n) {
		if(s[i] < 0) {
			v[-s[i]][0].push_back(i);
		} else {
			v[s[i]][1].push_back(i);
		}
	}

	f1(i, n) {
		f0(j, v[i][0].size()) {
			pp.push_back({v[i][0][j], v[i][1][j]});
		}
	}

	sort(pp.begin(), pp.end(), compare);

	long long ans[2*n];
	long long ans2[2*n];


	f0(i, n) {
		ans[2*i] = pp[i].first;
		ans[2*i + 1] = pp[i].second;
		ans2[pp[i].first] = 2*i;
		ans2[pp[i].second] = 2*i + 1;
		// ans += abs(pp[i].first - 2*i);
		// ans += abs(pp[i].second - 2*i - 1);
		// cout << pp[i].first << " " << 2*i << " " << pp[i].second << " " << 2*i + 1 << endl;
	}

	segment_tree st(2*n, vector<long long>(2*n, 0));

	long long ret = 0;

	f0(i, 2*n) {
		ret += ans2[i];
		ret -= st.query(0, ans2[i]);
		st.update(ans2[i], 1);
	}

	return ret;
	// return ans;


	return 1;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:8:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f0(i, n) for(int i = 0; i < n; i++)
......
   80 |   f0(j, v[i][0].size()) {
      |      ~~~~~~~~~~~~~~~~~             
shoes.cpp:80:3: note: in expansion of macro 'f0'
   80 |   f0(j, v[i][0].size()) {
      |   ^~
shoes.cpp:87:12: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   87 |  long long ans[2*n];
      |            ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 288 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 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 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 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 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 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 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 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 5 ms 2388 KB Output is correct
21 Correct 6 ms 2364 KB Output is correct
22 Correct 52 ms 18612 KB Output is correct
23 Correct 49 ms 18612 KB Output is correct
24 Correct 49 ms 18544 KB Output is correct
25 Correct 49 ms 18548 KB Output is correct
26 Correct 50 ms 19856 KB Output is correct
27 Correct 49 ms 19604 KB Output is correct
28 Correct 49 ms 19816 KB Output is correct
29 Correct 55 ms 19900 KB Output is correct
30 Correct 48 ms 19864 KB Output is correct
31 Correct 49 ms 19820 KB Output is correct
32 Correct 47 ms 19868 KB Output is correct
33 Correct 48 ms 19608 KB Output is correct
34 Correct 47 ms 19872 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 47 ms 19884 KB Output is correct
38 Correct 48 ms 19868 KB Output is correct
39 Correct 47 ms 19808 KB Output is correct

Subtask #4
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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 76 ms 23276 KB Output is correct
6 Correct 63 ms 21008 KB Output is correct
7 Correct 80 ms 24472 KB Output is correct
8 Correct 52 ms 20292 KB Output is correct
9 Correct 76 ms 24480 KB Output is correct
10 Correct 74 ms 21896 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 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 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 288 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 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 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 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 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 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 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 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 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 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 288 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 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 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 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 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 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 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 5 ms 2388 KB Output is correct
55 Correct 6 ms 2364 KB Output is correct
56 Correct 52 ms 18612 KB Output is correct
57 Correct 49 ms 18612 KB Output is correct
58 Correct 49 ms 18544 KB Output is correct
59 Correct 49 ms 18548 KB Output is correct
60 Correct 50 ms 19856 KB Output is correct
61 Correct 49 ms 19604 KB Output is correct
62 Correct 49 ms 19816 KB Output is correct
63 Correct 55 ms 19900 KB Output is correct
64 Correct 48 ms 19864 KB Output is correct
65 Correct 49 ms 19820 KB Output is correct
66 Correct 47 ms 19868 KB Output is correct
67 Correct 48 ms 19608 KB Output is correct
68 Correct 47 ms 19872 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 300 KB Output is correct
71 Correct 47 ms 19884 KB Output is correct
72 Correct 48 ms 19868 KB Output is correct
73 Correct 47 ms 19808 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 76 ms 23276 KB Output is correct
79 Correct 63 ms 21008 KB Output is correct
80 Correct 80 ms 24472 KB Output is correct
81 Correct 52 ms 20292 KB Output is correct
82 Correct 76 ms 24480 KB Output is correct
83 Correct 74 ms 21896 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 0 ms 212 KB Output is correct
86 Correct 0 ms 212 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 468 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 468 KB Output is correct
94 Correct 1 ms 468 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 2868 KB Output is correct
102 Correct 6 ms 2528 KB Output is correct
103 Correct 99 ms 24516 KB Output is correct
104 Correct 85 ms 24480 KB Output is correct
105 Correct 75 ms 22076 KB Output is correct
106 Correct 77 ms 24480 KB Output is correct
107 Correct 64 ms 20876 KB Output is correct
108 Correct 65 ms 21124 KB Output is correct
109 Correct 60 ms 20952 KB Output is correct
110 Correct 48 ms 19908 KB Output is correct
111 Correct 75 ms 23772 KB Output is correct
112 Correct 77 ms 23092 KB Output is correct
113 Correct 69 ms 20848 KB Output is correct
114 Correct 78 ms 24508 KB Output is correct
115 Correct 72 ms 24508 KB Output is correct