oj.uz

답안 #425991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425991 2021-06-13T12:48:54 Z _fractal 정렬하기 (IOI15_sorting) C++14
20 / 100
 11 ms 360 KB 
#include "sorting.h"
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;


int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int A[N], pos[N];
	for (int i = 0; i < N; ++i)
		A[i] = i;
	for (int i = M - 1; i >= 0; --i)
		swap(A[X[i]], A[Y[i]]);/*
	for (int i = 0; i < M; ++i)
		cerr << P[i] << " " << Q[i] << '\n';
	cerr << "---------\n";*/
	int r = 0;
	for (int i = 0; i < M; ++i) {
		swap(S[X[i]], S[Y[i]]);
		swap(A[X[i]], A[Y[i]]);
		for (int j = 0; j < N; ++j)
			pos[A[j]] = j;
		for (int j = 0; j < N; ++j) {
			if (pos[S[j]] != j) {
				Q[i] = j, P[i] = pos[S[j]];
				++r;
				break;
			}
		}
		if (Q[i] == P[i])
			break;
		swap(S[Q[i]], S[P[i]]);
	}/*
	for (int i = 0; i < M; ++i) {
		cerr << X[i] << " " << Y[i] << '\n';
		if (i < r)
			cerr << P[i] << " " << Q[i] << '\n';
	}
	for (int i = 0; i < N; ++i)
		cerr << S[i] << " \n"[i + 1 == N];*/
	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 1 ms 204 KB Output is correct
6 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 1 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 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 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 1 ms 204 KB Output is correct
6 Correct 1 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 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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