oj.uz

답안 #720534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720534 2023-04-08T12:18:30 Z joelgun14 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 131 ms 20644 KB 
#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

bool comp(pair<int, int> a, pair<int, int> b) {
	return a > b;
}

const int lim = 2e5 + 5;

struct fenwick {
	int a[lim];
	fenwick() {
		memset(a, 0, sizeof(a));
	}
	void upd(int idx, int val) {
		idx++;
		while(idx < lim) {
			a[idx] += val;
			idx += idx&-idx;
		}
	}
	int q(int idx) {
		idx++;
		int res = 0;
		while(idx) {
			res += a[idx];
			idx -= idx&-idx;
		}
		return res;
	}
};

long long count_swaps(std::vector<int> s) {
	// cari element yg distancenya paling kecil dr 0
	// based on left terkecil dan right terkecil
	ll res = 0;
	// buat vektor posisi
	// di kanan x -> mendekat
	// di kiri x -> sama aja
	// gmn handle case ini?
	// find pair with min cost but have issue of deletion handling
	// as deletion handling can cause a pair to be more efficient compared to before
	// ex
	// 2 y y 1 1 x x x x 2	
	// deletion of x can cause to be more eff?
	// all shoes same size -> ez
	// shoes i sm type i + n sama -> jadi i + n ke i + 1
	// problem: recalculate greedy buat di awal (atau ga butuh ya)
	// coba aja deh :"D
	int n = s.size();
	vector<int> l[n + 1], r[n + 1];
	for(int i = 0; i < s.size(); ++i) {
		if(s[i] < 0)
			l[-s[i]].push_back(i);
		else
			r[s[i]].push_back(i);
	}	
	priority_queue<pair<int, int>, vector<pair<int, int>>, function<bool(pair<int, int>, pair<int, int>)>> pq(comp);
	for(int i = 1; i <= n; ++i) {
		if(l[i].size()) {
			reverse(l[i].begin(), l[i].end());
			reverse(r[i].begin(), r[i].end());
			pq.push(make_pair(l[i].back() + r[i].back(), i));
		}
	}
	int curpos = 0;
	fenwick bit;
	while(pq.size()) {
		int idx = pq.top().second;
		pq.pop();
		res += abs(l[idx].back() - bit.q(l[idx].back()));
		bit.upd(l[idx].back(), 1);
		res += abs(r[idx].back() - bit.q(r[idx].back()));
		bit.upd(r[idx].back(), 1);
		l[idx].pop_back();
		r[idx].pop_back();
		if(l[idx].size())
			pq.push(make_pair(l[idx].back() + r[idx].back(), idx));
	}
	return res;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i = 0; i < s.size(); ++i) {
      |                 ~~^~~~~~~~~~
shoes.cpp:68:6: warning: unused variable 'curpos' [-Wunused-variable]
   68 |  int curpos = 0;
      |      ^~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 1 ms 980 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 1 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 1 ms 980 KB Output is correct
36 Correct 1 ms 980 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 1068 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 4 ms 2260 KB Output is correct
21 Correct 4 ms 2260 KB Output is correct
22 Correct 37 ms 12896 KB Output is correct
23 Correct 37 ms 14240 KB Output is correct
24 Correct 39 ms 14256 KB Output is correct
25 Correct 36 ms 14244 KB Output is correct
26 Correct 37 ms 14304 KB Output is correct
27 Correct 34 ms 13988 KB Output is correct
28 Correct 38 ms 14384 KB Output is correct
29 Correct 37 ms 14376 KB Output is correct
30 Correct 34 ms 14384 KB Output is correct
31 Correct 37 ms 14248 KB Output is correct
32 Correct 41 ms 14360 KB Output is correct
33 Correct 36 ms 14284 KB Output is correct
34 Correct 36 ms 14384 KB Output is correct
35 Correct 1 ms 980 KB Output is correct
36 Correct 1 ms 980 KB Output is correct
37 Correct 37 ms 14380 KB Output is correct
38 Correct 37 ms 14364 KB Output is correct
39 Correct 46 ms 14404 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 1060 KB Output is correct
5 Correct 93 ms 19408 KB Output is correct
6 Correct 85 ms 14864 KB Output is correct
7 Correct 94 ms 20644 KB Output is correct
8 Correct 37 ms 14208 KB Output is correct
9 Correct 93 ms 20632 KB Output is correct
10 Correct 109 ms 17096 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 1 ms 980 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 1 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 1 ms 980 KB Output is correct
36 Correct 1 ms 980 KB Output is correct
37 Correct 1 ms 980 KB Output is correct
38 Correct 1 ms 980 KB Output is correct
39 Correct 1 ms 980 KB Output is correct
40 Correct 1 ms 1108 KB Output is correct
41 Correct 1 ms 1236 KB Output is correct
42 Correct 2 ms 1236 KB Output is correct
43 Correct 2 ms 1236 KB Output is correct
44 Correct 1 ms 1236 KB Output is correct
45 Correct 1 ms 1236 KB Output is correct
46 Correct 2 ms 1112 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 2 ms 1108 KB Output is correct
49 Correct 2 ms 1108 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 1 ms 1108 KB Output is correct
52 Correct 1 ms 1236 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 1 ms 980 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 1 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 1 ms 980 KB Output is correct
36 Correct 1 ms 980 KB Output is correct
37 Correct 1 ms 980 KB Output is correct
38 Correct 1 ms 980 KB Output is correct
39 Correct 1 ms 1068 KB Output is correct
40 Correct 1 ms 980 KB Output is correct
41 Correct 1 ms 980 KB Output is correct
42 Correct 1 ms 980 KB Output is correct
43 Correct 1 ms 980 KB Output is correct
44 Correct 1 ms 980 KB Output is correct
45 Correct 1 ms 980 KB Output is correct
46 Correct 1 ms 980 KB Output is correct
47 Correct 1 ms 980 KB Output is correct
48 Correct 1 ms 980 KB Output is correct
49 Correct 1 ms 980 KB Output is correct
50 Correct 1 ms 980 KB Output is correct
51 Correct 2 ms 1108 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 4 ms 2260 KB Output is correct
55 Correct 4 ms 2260 KB Output is correct
56 Correct 37 ms 12896 KB Output is correct
57 Correct 37 ms 14240 KB Output is correct
58 Correct 39 ms 14256 KB Output is correct
59 Correct 36 ms 14244 KB Output is correct
60 Correct 37 ms 14304 KB Output is correct
61 Correct 34 ms 13988 KB Output is correct
62 Correct 38 ms 14384 KB Output is correct
63 Correct 37 ms 14376 KB Output is correct
64 Correct 34 ms 14384 KB Output is correct
65 Correct 37 ms 14248 KB Output is correct
66 Correct 41 ms 14360 KB Output is correct
67 Correct 36 ms 14284 KB Output is correct
68 Correct 36 ms 14384 KB Output is correct
69 Correct 1 ms 980 KB Output is correct
70 Correct 1 ms 980 KB Output is correct
71 Correct 37 ms 14380 KB Output is correct
72 Correct 37 ms 14364 KB Output is correct
73 Correct 46 ms 14404 KB Output is correct
74 Correct 1 ms 980 KB Output is correct
75 Correct 1 ms 980 KB Output is correct
76 Correct 1 ms 980 KB Output is correct
77 Correct 1 ms 1060 KB Output is correct
78 Correct 93 ms 19408 KB Output is correct
79 Correct 85 ms 14864 KB Output is correct
80 Correct 94 ms 20644 KB Output is correct
81 Correct 37 ms 14208 KB Output is correct
82 Correct 93 ms 20632 KB Output is correct
83 Correct 109 ms 17096 KB Output is correct
84 Correct 1 ms 980 KB Output is correct
85 Correct 1 ms 980 KB Output is correct
86 Correct 1 ms 980 KB Output is correct
87 Correct 1 ms 1108 KB Output is correct
88 Correct 1 ms 1236 KB Output is correct
89 Correct 2 ms 1236 KB Output is correct
90 Correct 2 ms 1236 KB Output is correct
91 Correct 1 ms 1236 KB Output is correct
92 Correct 1 ms 1236 KB Output is correct
93 Correct 2 ms 1112 KB Output is correct
94 Correct 1 ms 1108 KB Output is correct
95 Correct 2 ms 1108 KB Output is correct
96 Correct 2 ms 1108 KB Output is correct
97 Correct 1 ms 1108 KB Output is correct
98 Correct 1 ms 1108 KB Output is correct
99 Correct 1 ms 1236 KB Output is correct
100 Correct 1 ms 1236 KB Output is correct
101 Correct 8 ms 3036 KB Output is correct
102 Correct 7 ms 2388 KB Output is correct
103 Correct 131 ms 20620 KB Output is correct
104 Correct 106 ms 20644 KB Output is correct
105 Correct 115 ms 17444 KB Output is correct
106 Correct 86 ms 20644 KB Output is correct
107 Correct 94 ms 15100 KB Output is correct
108 Correct 74 ms 15536 KB Output is correct
109 Correct 39 ms 14504 KB Output is correct
110 Correct 35 ms 14412 KB Output is correct
111 Correct 99 ms 20004 KB Output is correct
112 Correct 104 ms 19232 KB Output is correct
113 Correct 80 ms 15024 KB Output is correct
114 Correct 90 ms 20592 KB Output is correct
115 Correct 95 ms 20620 KB Output is correct