# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434617 | 2021-06-21T13:15:45 Z | Maqsut_03 | Sorting (IOI15_sorting) | C++14 | 12 ms | 832 KB |
#include "sorting.h" #include<bits/stdc++.h> using namespace std; int S[500500]; int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) { cout << M << endl; for (int i = 0; i < M;i++) cout<<i << ' ' <<P[i] << ' ' <<Q[i] << endl; for (int i = 0; i < N; i++) S[i] = s[i]; int r = 0; for (int i=0; i<N; i++) for (int j=i; j<N; j++) { if (S[i] > S[j]) { swap(S[i], S[j]); P[r] = i; Q[r] = j; r++; } } cout << M << endl; for (int i = 0; i < M;i++) cout<<i << ' ' <<P[i] << ' ' <<Q[i] << endl; return M; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 12 ms | 832 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 12 ms | 832 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |