# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32168 | imeimi2000 | Sorting (IOI15_sorting) | C++14 | 226 ms | 14900 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 <vector>
#include <algorithm>
using namespace std;
typedef long long llong;
int arr[200000];
int x[200000];
int y[200000];
int n, m;
int tmp[200000];
bool ch[200000];
int ps[200000];
int qs[200000];
bool check(int r) {
int j, cnt = 0;
for (int i = 0; i < n; ++i) tmp[i] = arr[i], ch[i] = false;
for (int i = 0; i < r; ++i) swap(tmp[x[i]], tmp[y[i]]);
for (int i = 0; i < n; ++i) {
if (ch[i]) continue;
ch[i] = true;
j = tmp[i];
while (j != i) ++cnt, ch[j] = true, j = tmp[j];
}
return cnt <= r;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
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... |