oj.uz

답안 #135289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135289 2019-07-24T02:17:30 Z StevenH 정렬하기 (IOI15_sorting) C++14
20 / 100
 3 ms 632 KB 
#include "sorting.h"
#include <algorithm>
#include <cstdlib>
#include <cstdio>

using namespace std;

int ele[1000];

void swap(int &x ,int &y)
{int t=x; x=y; y=t;}

int comp(int x,int y)
{return x<y;}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    P[0] = 0;
	Q[0] = 0;

	for (int i=0; i<N; i++)
		ele[i]=S[i];

	sort(ele,ele+N,comp);

	int R=0;

	for(int i=0; i<N; i++)
	{
		int j;
		/*
		for(j=0;j<N;j++)
		{
			if(j>1 && j<i)
				continue;
			if(S[j]==ele[i])
				break;
		}*/
		for(j=i;j<N;j++)
			if(S[j]==ele[i])
				break;
		if(i==j)continue;
		P[R]=j;
		Q[R]=i;
		R++;
		swap(S[i],S[j]);
	}

	if(X[0]==0 && Y[0]==0)
	{
		if(S[0]>S[1])
		{
			P[R]=0;
			Q[R]=1;
			R++;
			swap(S[0],S[1]);
		}
	}
	/*else if (X[0]==0 && Y[0]==1)
	{
		for(int i=0;i<R;i++)swap(S[0],S[1]);
		if(S[0]>S[1])
		{
			P[R]=0;
			Q[R]=0;
			R++;
			swap(S[0],S[0]);
		}
	}*/
	/*for(int i=0;i<N;i++)printf("%d ",S[i]);
	printf("\n");*/
	return R;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:15:39: warning: unused parameter 'M' [-Wunused-parameter]
 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 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -