# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20248 | Angelos | Sorting (IOI15_sorting) | C++98 | 0 ms | 0 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 <algorithm>
using namespace std;
int *s, *x, *y, *p, *q, n;
int obj[200005], cur[200005];
int orev[200005], crev[200005];
bool trial(int t){
for(int i=0; i<n; i++){
obj[i] = i;
}
for(int i=t-1; i>=0; i--){
swap(obj[x[i]], obj[y[i]]);
}
for(int i=0; i<n; i++){
orev[obj[i]] = i;
cur[i] = s[i];
crev[cur[i]] = i;
}
int pt = 0;
for(int i=0; i<t; i++){
swap(obj[x[i]], obj[y[i]]);
swap(cur[x[i]], cur[y[i]]);
crev[cur[x[i]]] = x[i];
orev[obj[x[i]]] = x[i];
crev[cur[y[i]]] = y[i];
orev[obj[y[i]]] = y[i];
while(pt < n && crev[pt] == orev[pt]) pt++;
if(pt == n){