oj.uz

답안 #428102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
428102 2021-06-15T08:06:18 Z haxorman 정렬하기 (IOI15_sorting) C++14
20 / 100
 1000 ms 364 KB 
#include "sorting.h"
#include "bits/stdc++.h"
using namespace std;

const int mxN = 2e5 + 7;

int n, m, arr[mxN];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n = N, m = M;

	for (int i = 0; i < n; ++i) {
		arr[i] = S[i];
	}

	int R = 0;
	bool ok = false;
	for (int ind = 0; ind < m && !ok; ++ind) {
		swap(arr[X[ind]], arr[Y[ind]]);

		bool stop = false;
		for (int i = 0; i < n && !stop; ++i) {
			if (ind + 1 < m && (i == X[ind + 1] || i == Y[ind + 1]))
				continue;

			for (int j = 0; j < n && !stop; ++j) {
				if (arr[j] == i && i != j) {
					swap(arr[j], arr[i]);
					P[ind] = j, Q[ind] = i;
					++R;
					stop = true;
				}
			}
		}

		for (int i = 0; i < n; ++i) {
			if (arr[i] != i) {
				if (!stop) {
					P[ind] = 0;
					Q[ind] = 0;
					++R;
				}
				ok = false;
			}
		}
	}

	return R;
}

Subtask #1
8.0 / 8.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 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.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 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 23 ms 336 KB Output is correct
11 Correct 24 ms 328 KB Output is correct
12 Correct 22 ms 204 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.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 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 23 ms 336 KB Output is correct
11 Correct 24 ms 328 KB Output is correct
12 Correct 22 ms 204 KB Output is correct
13 Incorrect 1 ms 204 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1087 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1087 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -