# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362611 | NachoLibre | Sorting (IOI15_sorting) | C++17 | 296 ms | 33184 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 <bits/stdc++.h>
using namespace std;
#define sz(a) ((int)a.size())
typedef vector<int> vint;
#ifndef wambule
#include "sorting.h"
#else
#endif
const int N = 200005, M = 600005;
int n, m, s[N], x[M], y[M], c[N], d[N];
inline void S(int x, int y) {
d[c[x]] = y;
d[c[y]] = x;
swap(c[x], c[y]);
}
void Gc() {
for(int i = 0; i < n; ++i) {
c[i] = s[i];
d[s[i]] = i;
}
}
vector<pair<int, int>> C(int a) {
vector<pair<int, int>> dr(1, {0, 0});
Gc();
for(int i = 0; i < a; ++i) {
S(x[i], y[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... |