# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135320 | tinjyu | 정렬하기 (IOI15_sorting) | C++14 | 7 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "sorting.h"
#include <iostream>
using namespace std;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[]) {
int num[50005];
for(int i=0;i<n;i++)num[i]=i;
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(s[i]<s[j])
{
swap(num[i],num[j]);
swap(s[i],s[j]);
}
}
}
for(int i=0;i<n;i++)s[num[i]]=i;
//for(int i=0;i<n;i++)cout<<s[i]<<" ";
//cout<<endl;
int r=0;
for(int i=0;i<n;i++)
{
int t=0;
for(int j=0;j<n;j++)if(s[j]==i)
{
t=j;
break;
}
//cout<<i<<" "<<t<<endl;
if(i==t)continue;
swap(s[i],s[t]);
P[r]=i;
Q[r]=t;
r++;
}
return r;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |