제출 #958584

#제출 시각아이디문제언어결과실행 시간메모리
95858412345678정렬하기 (IOI15_sorting)C++17
0 / 100
1 ms604 KiB
#include "sorting.h" #include <bits/stdc++.h> using namespace std; const int nx=505; int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) { int idx[nx], s[nx]; for (int i=0; i<N; i++) idx[i]=i, s[i]=S[i]; //for (int i=N-1; i>=0; i--) swap(idx[X[i]], idx[Y[i]]); for (int i=0; i<N; i++) { //swap(idx[X[i]], idx[Y[i]]); //swap(s[X[i]], s[Y[i]]); for (int j=0; j<N; j++) if (idx[j]==i) P[i]=j; for (int j=0; j<N; j++) { if (s[j]==i) { Q[i]=j; swap(s[P[i]], s[Q[i]]); break; } } } return N; }

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:8:39: warning: unused parameter 'M' [-Wunused-parameter]
    8 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:8:46: warning: unused parameter 'X' [-Wunused-parameter]
    8 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:8:55: warning: unused parameter 'Y' [-Wunused-parameter]
    8 | 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...