# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
452113 | JovanB | Sorting (IOI15_sorting) | C++17 | 402 ms | 31964 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 niz[200005];
int x[600005], y[600005];
int p[600005], q[600005];
int n, m;
int prvo[200005];
int gde[200005];
int who[200005];
int tren[200005];
int trenwho[200005];
bool check(int k){
for(int i=0; i<n; i++){
gde[niz[i]] = i;
who[i] = niz[i];
tren[niz[i]] = i;
trenwho[i] = niz[i];
}
for(int i=0; i<k; i++){
swap(who[x[i]], who[y[i]]);
swap(gde[who[x[i]]], gde[who[y[i]]]);
}
for(int i=0; i<m; i++) p[i] = q[i] = 0;
int g = 0;
for(int i=0; i<n; i++){
if(gde[i] != i){
# | 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... |