# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
372369 | crackersamdjam | Fire (JOI20_ho_t5) | C++17 | 1087 ms | 56228 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 all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
const int MM = 2e5+5, NN = 400, SZ = 500, LOG = 18;
struct query{
int t, l, r, id;
bool operator<(const query &o) const{
return t < o.t;
}
} q[MM];
int n, qs;
ll a[MM], ans[MM], sp[LOG][MM];
ll qu(int l, int r){
int k = __lg(r-l+1);
return max(sp[k][l], sp[k][r-(1<<k)+1]);
}
stack<pair<int, ll>> st;
vector<pair<int, ll>> slope[NN];
ll curslope[NN], cursum[NN];
//at time i, slope changes by x
//changes sum by something
int ls[MM], rs[MM];
//rs how far will cover
# | 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... |