Submission #134278

#TimeUsernameProblemLanguageResultExecution timeMemory
134278Runtime_error_정렬하기 (IOI15_sorting)C++14
20 / 100
4 ms436 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[]) { if(N < 2) return 0; int l =2, r =0; for(int i=0;i<M;i++){ swap( S[ X[i] ],S[ Y[i] ] ); while(S[l] == l && l<N) l++; if( l == N){ // for(int i=0;i<N;i++) // cout<<S[i]<<" "; if(S[0] == 0 && S[1] == 1) return i; P[i]=0,Q[i] = 1; i++; return i; } int j; for(j=0;j<N;j++) if(S[j] == l) break; P[i] = l , Q[i] = j; swap(S[l],S[j]); } }

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:8:15: warning: unused variable 'r' [-Wunused-variable]
     int l =2, r =0;
               ^
sorting.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...