# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108001 | 2024-11-02T14:44:27 Z | Aviansh | Sorting (IOI15_sorting) | C++17 | 83 ms | 77900 KB |
#include "sorting.h" #include <bits/stdc++.h> using namespace std; int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) { int be[n]; iota(be,be+n,0); int ber[m][n]; for(int i = m-1;i>=0;i--){ swap(be[x[i]],be[y[i]]); int temp[n]; for(int i = 0;i<n;i++){ temp[be[i]]=i; } copy(temp,temp+n,ber[i]); } int r = 0; for(int i = 0;i<n;i++){ swap(s[x[i]],s[y[i]]); int ind = find(s,s+n,i)-s; swap(s[ind],s[ber[r+1][i]]); p[r]=ind; q[r]=(ber[r+1][i]); r++; } for(;r<m;r++){ p[r]=0; q[r]=0; swap(s[x[r]],s[y[r]]); } assert(0); for(int i = 0;i<n;i++){ assert(s[i]==i); } return r; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 83 ms | 77900 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 83 ms | 77900 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |