# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420779 | 2021-06-08T13:53:01 Z | LouayFarah | Sorting (IOI15_sorting) | C++14 | 4 ms | 348 KB |
#include "bits/stdc++.h" #include "sorting.h" using namespace std; int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) { int i = 0; while(i<n) { bool sorted = true; int curr = 1; while(curr<=n) { if(s[curr-1]!=curr) { sorted = false; break; } curr++; } if(sorted) break; int j = i; int mini = n+1; int ind = j; while(j<n) { if(s[j]<mini) { mini = s[j]; ind = j; } j++; } p[i] = i, q[i] = ind; swap(s[i], s[ind]); i++; } return i; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |