# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484037 | Cross_Ratio | Sorting (IOI15_sorting) | C++14 | 1 ms | 460 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 <bits/stdc++.h>
#include "sorting.h"
using namespace std;
typedef pair<long long int, int> P;
vector<P> So;
vector<long long int> S;
vector<int> X, Y;
int N;
int findSwapPairs(int N2, int S2[], int M, int X2[], int Y2[], int P1[], int P2[]) {
N = N2;
int i, j;
for(i=0;i<N;i++) {
So.push_back(P(S2[i],i));
S.push_back(S2[i]);
X.push_back(X2[i]);
Y.push_back(Y2[i]);
}
for(i=0;i<N;i++) {
So[i].first = N * So[i].first + i;
S[i] = N * S[i] + i;
}
sort(So.begin(),So.end());
int cnt = 0;
for(i=0;i<N;i++) {
if(S[i] == So[i].first) continue;
P1[cnt] = i;
P2[cnt] = So[i].second;
swap(S[i],S[So[i].second]);
cnt++;
}
return cnt;
}
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... |