# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387262 | ParsaAlizadeh | Sorting (IOI15_sorting) | C++17 | 204 ms | 22600 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>
#include "sorting.h"
using namespace std;
typedef pair<int, int> pii;
vector<int> perm;
vector<pii> alice, bob;
bool check(int t) {
vector<int> tmp(perm);
for (int i = 0; i < t; i++) {
swap(tmp[alice[i].first], tmp[alice[i].second]);
}
bob.clear();
for (int i = 0; i < tmp.size(); i++) {
while (tmp[i] != i) {
bob.emplace_back(tmp[i], tmp[tmp[i]]);
swap(tmp[i], tmp[tmp[i]]);
}
}
while (bob.size() < t)
bob.emplace_back(0, 0);
return bob.size() == t;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
perm.assign(S, S + N);
for (int i = 0; i < M; i++) {
alice.emplace_back(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... |