# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532026 | hohohaha | Min-max tree (BOI18_minmaxtree) | C++14 | 325 ms | 262148 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;
#define fori(i, l, r) for(int i = (int) (l); i <= (int) (r); i++)
#define ford(i, r, l) for(int i = (int) (r); i >= (int) (l); i--)
#define ii pair<int, int>
#define fi first
#define se second
#define vi vector<int>
#define eb emplace_back
#define sp ' '
#define endl '\n'
//#define int long long
mt19937_64 rng(chrono::steady_clock().now().time_since_epoch().count());
const int maxn = 3e5 + 5;
const int inf = INT_MAX / 2ll;
int n;
int m;
char tp[maxn];
int v[maxn];
int bg[maxn];
int en[maxn];
ii E[maxn];
vector<ii> g[maxn];
set<ii> cur_mx[maxn], cur_mn[maxn];
ii mx_mn[maxn], mn_mx[maxn];
int ans[maxn];
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... |