# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288736 | b00n0rp | Sorting (IOI15_sorting) | C++17 | 356 ms | 17584 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<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define F first
#define S second
#define vi vector<int>
#define pb push_back
#define SZ(v) (int)v.size()
const int MAXN = 200005;
int a[MAXN],b[MAXN];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
int low = 0,high = M,mid,ans;
while(low <= high){
mid = (low+high)/2;
vector<pii> v;
for(int i = 0; i < N; i ++) a[i] = S[i];
for(int i = 0; i < mid; i ++){
swap(a[X[i]],a[Y[i]]);
}
for(int i = 0; i < N; i ++) b[a[i]] = i;
for(int i = 0; i < N; i ++){
if(a[i] == i) continue;
int pos = b[i];
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... |