제출 #830661

#제출 시각아이디문제언어결과실행 시간메모리
830661Supersonic정렬하기 (IOI15_sorting)C++14
0 / 100
1 ms340 KiB
#include "sorting.h" #include <bits/stdc++.h> using namespace std; int l[200001]; int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) { for(int i=0;i<n;i++)l[s[i]]=i; int c=0; for(int i=0;i<n;i++){ if(l[i]==i)continue; int a=l[i]; int b=i; l[s[a]]=b;l[s[b]]=a; swap(s[a],s[b]); p[c]=a;q[c]=b; } return n; }

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:39: warning: unused parameter 'm' [-Wunused-parameter]
    5 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                   ~~~~^
sorting.cpp:5:46: warning: unused parameter 'x' [-Wunused-parameter]
    5 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                          ~~~~^~~
sorting.cpp:5:55: warning: unused parameter 'y' [-Wunused-parameter]
    5 | 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...