# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446256 | benedict0724 | Dynamic Diameter (CEOI19_diameter) | C++17 | 2 ms | 460 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;
typedef pair<int, int> pl;
int par[100002], v[100002], E[100002];
int dp[100002][2];
int tree[400002];
int init(int i, int l, int r){
if(l == r) return tree[i] = dp[l][1];
int m = (l + r)/2;
return tree[i] = max(init(i*2, l, m), init(i*2+1, m+1, r));
}
void update(int i, int l, int r, int id, int val){
if(id < l | r < id) return;
if(l == r) { tree[i] = val; return; }
int m = (l + r)/2;
if(id <= m) update(i*2, l, m, id, val);
else update(i*2+1, m+1, r, id, val);
tree[i] = max(tree[i*2], tree[i*2+1]);
}
int query() { return tree[1]; }
int main()
{
ios::sync_with_stdio(false); cin.tie(NULL);
int n, q, w; cin >> n >> q >> w;
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... |