Submission #420941

#TimeUsernameProblemLanguageResultExecution timeMemory
420941LouayFarahSorting (IOI15_sorting)C++14
0 / 100
2 ms832 KiB
#include "bits/stdc++.h" #include "sorting.h" using namespace std; bool sorted(int s[], int n) { int i = 0; while(i<n) { if(s[i]!=i) return false; i++; } return true; } int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) { int res = 0; for(int i = 1; i<=n; i++) { int j = i; while(s[j]<s[j-1]&&j>0) { if(sorted(s, n)) break; if(x[res]!=y[res]) swap(x[res], y[res]); p[res] = j; q[res] = j-1; res++; swap(s[j], s[j-1]); j--; } } return res; }

Compilation message (stderr)

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