제출 #720219

#제출 시각아이디문제언어결과실행 시간메모리
720219mseebacher정렬하기 (IOI15_sorting)C++17
0 / 100
1 ms340 KiB
#include "sorting.h" #include <bits/stdc++.h> using namespace std; int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) { int ans = 0; for(int i = 0;i<n;i++){ if(s[i] == i) continue; swap(s[x[ans]],s[y[ans]]); for(int j = i+1;j<n;j++){ if(s[j] == i){ int abc = i; if(i == 1) abc = 0; swap(s[j],s[abc]); p[ans] = abc; q[ans] = j; ans++; break; } } } // 1x mehr swappen if(s[0] != 0){ p[ans] = 0; q[ans] = 0; ans++; } return ans; }

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:39: warning: unused parameter 'm' [-Wunused-parameter]
    7 | 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...