# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293524 | crossing0ver | Exercise Deadlines (CCO20_day1problem2) | C++17 | 235 ms | 8340 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>
#define vi vector<int>
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N = 2e5+5;
int MX[4*N],sum[4*N];
vector<int> v,v1;
void build(int v,int tl,int tr) {
if (tl == tr) {
MX[v] = v1[tl];
sum[v] = 1;
return;
}
int tm = (tl + tr)/2;
build(v*2,tl,tm);
build(v*2+1,tm+1,tr);
sum[v] = sum[v*2] + sum[v*2+1];
MX[v] = max(MX[v*2],MX[v*2+1]);
}
long long ans;
int idx;
void upd(int v,int tl,int tr,int val) {
if (tl == tr) {
sum[v] = 0;
MX[v] = -1;
idx = tl;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |