# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
812304 | LIF | Sorting (IOI15_sorting) | C++14 | 139 ms | 28516 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;
int a[300005];
vector<pair<int,int> > last;
int pos[300005];
int AA[300005][2];
int val[300005][2];
vector<pair<int,int> > pp;
bool check(int now,int X[],int Y[],int N,int S[])
{
for(int i=0;i<N;i++)a[i] = S[i];
for(int i=0;i<now;i++)swap(a[X[i]],a[Y[i]]);
for(int i=0;i<N;i++)pos[a[i]] = i;
int ans = 0;
vector<pair<int,int> > temp;
for(int i=0;i<N;i++)
{
if(a[i] == i)continue;
int aa = i;
int bb = pos[i];
swap(a[aa],a[bb]);
pos[a[bb]] = bb;
temp.push_back(make_pair(aa,bb));
ans++;
}
if(temp.size() > now)return false;
if(temp.size() < now)for(int i=1;i<= now-temp.size();i++)temp.push_back(make_pair(0,0));
if(ans <= now)
{
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... |