# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434024 | pliam | Sorting (IOI15_sorting) | C++14 | 544 ms | 23372 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;
#define MAXN 200005
int from[MAXN];
int from_pos[MAXN];
int s_pos[MAXN];
int n;
int s[MAXN];
int* x;
int* y;
int p[MAXN];
int q[MAXN];
void change_from(int a,int b){
swap(from_pos[a],from_pos[b]);
from[from_pos[a]]=a;
from[from_pos[b]]=b;
}
void swap_s(int a,int b){
swap(s[a],s[b]);
s_pos[s[a]]=a;
s_pos[s[b]]=b;
}
bool check(int r){
for(int i=0;i<n;i++){
from[i]=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... |