# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922608 | maxFedorchuk | Cat (info1cup19_cat) | C++17 | 305 ms | 31568 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;
const long long MX=2e5+10;
int a[MX];
int p[MX];
pair < int , int > vp1[MX];
pair < int , int > vp2[MX];
int n;
void swp(int i,int j) {
swap(a[i], a[j]);
swap(p[a[i]], p[a[j]]);
swap(a[n - i + 1], a[n - j + 1]);
swap(p[a[n - i + 1]], p[a[n - j + 1]]);
}
void fun() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
p[a[i]] = i;
}
for (int i = 1; i <= n / 2; i++) {
# | 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... |