# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434562 | 2021-06-21T12:06:32 Z | ismoilov | Sorting (IOI15_sorting) | C++14 | 7 ms | 332 KB |
#include "sorting.h" #include <bits/stdc++.h> using namespace std; int check(int a[], int n){ for(int i = 0; i < n; i ++) if(a[i] != i) return i; return -1; } int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) { int i = check(s, n); while(i != -1){ for(int j = 0; j < n; j ++){ if(s[j] == i){ swap(s[j], s[i]); p[i] = i, q[i] = j; //cout << i << " " << j << "\n"; } } i = check(s, n); } return n; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |