제출 #1065141

#제출 시각아이디문제언어결과실행 시간메모리
1065141wfe2017정렬하기 (IOI15_sorting)C++11
0 / 100
1 ms348 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
 
#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
 
#include "sorting.h"
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	vi s;
	for (int i = 0; i < N; i++) {
		s.pb(S[i]);
	}
	for (int i = 0; i < N; i++) {
		int pos = -1;
		for (int j = 0; j < N; j++) {
			if (s[j] == i)
				pos = j;
		}
		P[i] = i;
		Q[i] = pos;
		swap(s[i], s[pos]);
	}
	return N;
}

컴파일 시 표준 에러 (stderr) 메시지

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:15:39: warning: unused parameter 'M' [-Wunused-parameter]
   15 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:15:46: warning: unused parameter 'X' [-Wunused-parameter]
   15 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:15:55: warning: unused parameter 'Y' [-Wunused-parameter]
   15 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...