# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302041 | Berted | Sorting (IOI15_sorting) | C++14 | 298 ms | 36484 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 <iostream>
#define pii pair<int, int>
#define fst first
#define snd second
using namespace std;
int N, A[200001], T[200001], pos[200001];
pii S[600001];
bool vis[200001];
vector<int> check;
void DFS(int u)
{
if (!vis[u])
{
vis[u] = 1;
check.push_back(u);
DFS(T[u]);
}
}
vector<pii> getSwaps(int x)
{
vector<pii> ret;
for (int i = 0; i < N; i++) {T[i] = A[i]; vis[i] = 0;}
for (int i = 0; i < x; i++) {swap(T[S[i].fst], T[S[i].snd]);}
for (int i = 0; i < N; 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... |