oj.uz

답안 #532747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532747 2022-03-03T19:54:57 Z sliviu 정렬하기 (IOI15_sorting) C++17
54 / 100
 2 ms 488 KB 
#include <bits/stdc++.h>
//#include <sorting.h>

using namespace std;

int findSwapPairs(int n, int s[], int m, int x[], int y[], int s1[], int s2[]) {
	vector<int> p(n);
	for (int i = 0; i < n; ++i)
		p[i] = s[i];
	int left = 0, right = n - 1;
	auto ok = [&](int pos) {
		auto p_ = p;
		for (int i = 0; i <= pos; ++i)
			swap(p_[x[i]], p_[y[i]]);
		int ans = n;
		vector<int> seen(n);
		for (int i = 0; i < n; ++i)
			if (!seen[i]) {
				--ans;
				seen[i] = 1;
				for (int j = p_[i]; j != i; j = p_[j])
					seen[j] = 1;
			}
		return ans <= pos + 1;
	};
	while (left < right) {
		int m = (left + right) / 2;
		if (ok(m))
			right = m;
		else
			left = m + 1;
	}
	auto p_ = p;
	for (int i = 0; i <= left; ++i)
		swap(p_[x[i]], p_[y[i]]);
	int cur = 0;
	vector<int> seen(n), inv(n);
	for (int i = 0; i < n; ++i)
		if (!seen[i] && p_[i] != i) {
			vector<int> sol = {i};
			for (int j = p_[i]; j != i; j = p_[j])
				sol.emplace_back(j), seen[j] = 1;
			for (int i = 0; i < (int)sol.size() - 1; ++i)
				s1[cur] = sol[i], s2[cur++] = sol[i + 1];
		}
	for (int i = 0; i < n; ++i)
		inv[p[i]] = i;
	for (int i = 0; i <= left; ++i) {
		swap(inv[p[x[i]]], inv[p[y[i]]]);
		swap(p[x[i]], p[y[i]]);
		s1[i] = inv[s1[i]], s2[i] = inv[s2[i]];
		swap(inv[p[s1[i]]], inv[p[s2[i]]]);
		swap(p[s1[i]], p[s2[i]]);
	}
	return left+1;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:27:7: warning: declaration of 'int m' shadows a parameter [-Wshadow]
   27 |   int m = (left + right) / 2;
      |       ^
sorting.cpp:6:39: note: shadowed declaration is here
    6 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int s1[], int s2[]) {
      |                                   ~~~~^
sorting.cpp:43:13: warning: declaration of 'i' shadows a previous local [-Wshadow]
   43 |    for (int i = 0; i < (int)sol.size() - 1; ++i)
      |             ^
sorting.cpp:38:11: note: shadowed declaration is here
   38 |  for (int i = 0; i < n; ++i)
      |           ^
sorting.cpp:6:39: warning: unused parameter 'm' [-Wunused-parameter]
    6 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int s1[], int s2[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 336 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 0 ms 208 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 488 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -