oj.uz

답안 #416510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416510 2021-06-02T14:10:06 Z victoriad 정렬하기 (IOI15_sorting) C++14
20 / 100
 1 ms 332 KB 
#include "sorting.h"
#include "vector"
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	vector<int>c(N);
	int r=0;
	for(int i=0;i<N;i++){
		c[S[i]]=i;
	}
	if(Y[0]==0){
	for(int i=0;i<N;i++){
		if(S[i]!=i){
			P[r]=i;
			Q[r]=c[i];
			int x=S[i];
			S[c[i]]=x;
			c[x]=c[i];
			r++;
		}
	}
	}
	else{
		int y=S[0];
		S[0]=S[1];
		S[1]=y;
		c[y]=1;
		c[S[0]]=0;
		if(S[1]!=0){
		P[r]=c[0];
		Q[r]=1;
		int x=S[1];
        S[1]=0;
		S[c[0]]=x;
		c[x]=c[0];
        c[0]=1;
		r++;
		}
		y=S[0];
		S[0]=S[1];
		S[1]=y;
		c[y]=1;
		c[S[0]]=0;
		for(int i=1;i<N;i++){
		if(S[i]!=i){
			P[r]=i;
			Q[r]=c[i];
			int x=S[i];
            S[i]=i;
			S[c[i]]=x;
			c[x]=c[i];
			r++;
		}
		}

		if(r%2==1){
			P[r]=0;
			Q[r]=1;
			r++;
		}

	}
	return r;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:4:39: warning: unused parameter 'M' [-Wunused-parameter]
    4 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:4:46: warning: unused parameter 'X' [-Wunused-parameter]
    4 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 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 0 ms 204 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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