# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985063 | qwerasdfzxcl | New Home (APIO18_new_home) | C++17 | 916 ms | 486376 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;
typedef long long ll;
constexpr int INF = 1e9 + 100;
struct SegLeft{
vector<int> X;
int tree[600600], sz;
pair<int, int> buf[10001000];
int lsz;
inline void push(int i, int x){
if (tree[i] <= x) return;
buf[lsz++] = {i, tree[i]};
tree[i] = x;
}
inline void pop(){
--lsz;
tree[buf[lsz].first] = buf[lsz].second;
}
void init(const vector<int> &_X){
X = _X;
sz = X.size();
lsz = 0;
# | 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... |