oj.uz

답안 #599208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
599208 2022-07-19T11:40:53 Z Temmie 정렬하기 (IOI15_sorting) C++17
0 / 100
 3 ms 3540 KB 
#include <bits/stdc++.h>

int findSwapPairs(int n, int a[], int m, int u[], int v[], int uu[], int vv[]) {
	int l = 0, r = m, best = m;
	int inv[200'005];
	int u1[200'005];
	int v1[200'005];
	int b[200'005];
	while (l <= r) {
		int mid = (l + r) >> 1;
		for (int i = 0; i < n; i++) {
			b[i] = a[i];
		}
		for (int i = 0; i < mid; i++) {
			std::swap(a[u[i]], a[v[i]]);
		}
		for (int i = 0; i < n; i++) {
			inv[a[i]] = i;
		}
		int need = 0;
		memset(u1, 0, sizeof(u1));
		memset(v1, 0, sizeof(v1));
		for (int i = 0; i < n; i++) {
			if (a[i] == i) {
				continue;
			}
			int node = i;
			while (a[node] != node) {
				std::swap(a[node], a[inv[node]]);
				u1[need] = node;
				v1[need] = inv[node];
				need++;
				node = inv[node];
				int x = node;
				int y = inv[node];
				inv[a[x]] = x;
				inv[a[y]] = y;
			}
		}
		if (need < mid) {
			for (int i = 0; i < mid; i++) {
				uu[i] = u1[i];
				vv[i] = v1[i];
			}
			best = mid;
			r = mid - 1;
		} else {
			l = mid + 1;
		}
		for (int i = 0; i < n; i++) {
			a[i] = b[i];
		}
	}
	return best;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 3540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 3540 KB Output isn't correct
2 Halted 0 ms 0 KB -