# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420739 | 2021-06-08T13:39:28 Z | LouayFarah | Sorting (IOI15_sorting) | C++14 | 4 ms | 332 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[]) { bool sub0 = true, sub2 = true; for(int i = 0; i<m; i++) { if((x[i]!=y[i])||(x[i]==y[i]&&x[i]!=0)) { sub0 = false; break; } } for(int i = 0; i<m; i++) { if(x[i]!=0||y[i]!=1) { sub2 = false; break; } } if(sub0) { int i = 0; while(i<n) { bool sorted = true; int curr = 1; while(curr<=n) { if(s[curr-1]!=curr) { sorted = false; break; } curr++; } 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; } else if(sub2) { } else { } }
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 | 1 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 | 4 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |