# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302417 | bensonlzl | Sorting (IOI15_sorting) | C++14 | 48 ms | 13176 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;
typedef pair<int,int> pi;
int n, m, x[100005], y[100005], s[100005];
vector<pi> swaps;
bool sortable(int limit){
//cerr << "STARTING " << limit << '\n';
swaps.clear();
vector<int> p(n), rev(n);
vector<int> fp(n);
vector<int> vis(n,0);
vector<pi> temp;
for (int i = 0; i < n; ++i){
p[i] = i;
}
for (int i = 0; i < limit; ++i){
swap(p[x[i]],p[y[i]]);
}
for (int i = 0; i < n; ++i){
fp[i] = s[p[i]];
}
for (int i = 0; i < n; ++i){
if (!vis[i]){
vis[i] = 1;
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... |