# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134311 | 2019-07-22T12:05:42 Z | Runtime_error_ | Sorting (IOI15_sorting) | C++14 | 1000 ms | 376 KB |
#include "sorting.h" #include <bits/stdc++.h> using namespace std; const int inf = 2e3+9; int pos[inf],from[inf],origin[inf]; int findSwapPairs(int n, int a[], int m, int x[], int y[], int p[], int q[]){ bool tr = 1; for(int i=0;i<n;i++){ pos[ a[i] ] = i; origin[i] = a[i]; if(a[i] != i) tr = 0; } if(tr) return 0; for(int i=0;i<m;i++){ int l = 0; for(int j=0;j<n;j++) from[j] = j,a[j] = origin[j],p[j] = q[j] = 0; for(int j=i;j>=0;j--) swap( from[ x[j] ] , from[ y[j] ] ); /*for(int j=0;j<n;j++) cout<<from[j]<<" "; cout<<endl;*/ for(int j=0;j<=i;j++){ swap(a[ x[j] ] , a[ y[j] ] ); swap(from[ x[j] ] , from[ y[j] ]); int idx,idfrom; while(l<n){ for(idx = 0;idx<n && a[idx] != l;idx++); for(idfrom = 0;idfrom<n && from[idfrom] != l;idfrom++); if(from[idx] != idfrom) break; l++; } swap(a[idx],a[idfrom]); //cout<<l<<" "<<idx<<" "<<idfrom<<endl; p[j] = idx,q[j] = idfrom; } //for(int i=0;i<n;i++) // cout<<a[i]<<" "; tr = 1; for(int i=0;i<n;i++) if(a[i] != i) tr = 0; if(tr) return i+1; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 3 ms | 376 KB | Output is correct |
11 | Correct | 3 ms | 376 KB | Output is correct |
12 | Correct | 3 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 3 ms | 376 KB | Output is correct |
11 | Correct | 3 ms | 376 KB | Output is correct |
12 | Correct | 3 ms | 376 KB | Output is correct |
13 | Correct | 2 ms | 376 KB | Output is correct |
14 | Incorrect | 2 ms | 376 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1078 ms | 376 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1078 ms | 376 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |