# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293328 | 2020-09-07T21:53:51 Z | REALITYNB | Sorting (IOI15_sorting) | C++14 | 2 ms | 384 KB |
#include <bits/stdc++.h> using namespace std ; int findSwapPairs(int n , int s[] , int m , int x[] , int y[] , int p[] , int q[]){ /* if(n==1){ p[0]=q[0]=0 ; return 0 ; } if(n==2){ if(s[0]<s[1]) p[0]=0,q[0]=1 ; else p[0]=0,q[0]=0 ; return 0 ; }*/ int times = -1 ; int pp = 0 ; for(int i=0;i<n;i++){ swap(s[x[i]],s[y[i]]); for(int j=0;j<n;j++){ if(s[j]==pp){ p[i] = j ; q[i]=pp ; break ; } } times++ ; pp++ ; if(pp==n) break ; } /*if(s[0]>s[1]) p[pp-2]=q[pp-2]=0 ; else p[pp]=0 , q[pp-2]=1 ; */ return times ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 0 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 0 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 0 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |