# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421102 | 2021-06-08T18:08:22 Z | LouayFarah | Sorting (IOI15_sorting) | C++14 | 2 ms | 844 KB |
#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 k = 0; k<n; k++) { for(int i = 0; i<n-1; i++) { if(sorted(s, n)) break; if(s[i]>s[i+1]) { p[res] = i; p[res+1] = i+1; swap(p[res], p[res+1]); res++; } } } return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 288 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 844 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 844 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |