oj.uz

답안 #425984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425984 2021-06-13T12:44:14 Z _fractal 정렬하기 (IOI15_sorting) C++14
0 / 100
 2 ms 460 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 >= 1; --i)
		swap(A[X[i]], A[Y[i]]);/*
	for (int i = 0; i < M; ++i)
		cerr << P[i] << " " << Q[i] << '\n';
	cerr << "---------\n";*/
	swap(S[X[0]], S[Y[0]]);
	int r = 0;
	for (int i = 0; i < M; ++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]]);
		assert(A[Q[i]] == S[Q[i]]);
		if (i + 1 < M) {
			swap(S[X[i + 1]], S[Y[i + 1]]);
			swap(A[X[i + 1]], A[Y[i + 1]]);
		}
	}/*
	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
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 Runtime error 1 ms 332 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #2
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 Runtime error 1 ms 332 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 1 ms 332 KB Execution killed with signal 6
3 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 Runtime error 1 ms 332 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -