# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
621017 | 2022-08-03T11:06:05 Z | A_D | Sorting (IOI15_sorting) | C++14 | 1 ms | 852 KB |
#include "sorting.h" #include <bits/stdc++.h> using namespace std; const int N=2e5+100; int a[N]; int n; int num=0; vector<int> vec1; vector<int> vec2; void mer(int l,int r) { /* if(l==r)return; int mid=(l+r)/2; mer(l,mid); mer(mid+1,r); int l1=l; int l2=mid+1; while(l1<=mid&&l2<=r){ if(a[l1]>a[l2]){ } } */ } int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) { num=0; n=N; for(int i=0;i<N;i++){ a[i]=S[i]; } // mer(0,n-1); for(int i=0;i<n;i++){ for(int j=0;j<n-1;j++){ if(a[j+1]<a[j]){ if(num!=0){ P[num]=0; Q[num]=0; num++; } swap(a[j],a[j+1]); P[num]=j; Q[num]=j+1; num++; } } } return num; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 228 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 852 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 852 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |