# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472901 | dxz05 | Sky Walking (IOI19_walk) | C++14 | 4073 ms | 1048576 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.
#pragma GCC optimize("Ofast,O2,O3")
#pragma GCC target("avx,avx2")
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MP make_pair
const int MAXN = 2e6 + 3e2;
void sort(vector<int> &l, vector<int> &r, vector<int> &y){
vector<pair<int, pair<int, int>>> vec(y.size());
for (int i = 0; i < y.size(); i++){
vec[i] = MP(y[i], MP(l[i], r[i]));
}
sort(vec.begin(), vec.end());
for (int i = 0; i < y.size(); i++){
y[i] = vec[i].first;
l[i] = vec[i].second.first;
r[i] = vec[i].second.second;
}
}
map<int, int> mp[MAXN];
int next_id = 0;
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... |