# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434641 | 2021-06-21T13:40:38 Z | Maqsut_03 | Sorting (IOI15_sorting) | C++14 | 2 ms | 844 KB |
#include <bits/stdc++.h> #include "sorting.h" using namespace std; int S[555555]; int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]){ for (int i = 0 ; i<N;i++) S[i] = (int)s[i]; int R = 0; //for (int j=0;j<N;j++) cout <<S[j] << ' ' ; cout << endl; for (int i = 0 ; i< N; i++) { for (int j = 1; j < N; j++) { if (S[j-1] > S[j]) { int tmp = 0; //std::swap(S[j-1], S[j]); tmp = S[j-1]; S[j-1] = S[j]; S[j] = tmp; P[R] = j-1; Q[R] = j; //std::cout << j-1 << ' ' << j <<std:: endl; R++; } } //for (int j=0;j<N;j++) cout <<S[j] << ' ' ; cout << endl; //cout << i << endl; } assert(R<=M); for (int i = 0;i<N;i++) { assert(S[i]==i); } return R; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Incorrect | 1 ms | 204 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Incorrect | 1 ms | 204 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Incorrect | 1 ms | 204 KB | Output isn't correct |
6 | 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 | - |