# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647642 | ymm | Sterilizing Spray (JOI15_sterilizing) | C++17 | 249 ms | 5332 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 Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 100'010;
ll seg[N<<2];
int n, q, k;
void spray(int l, int r, int k, int i, int b, int e)
{
if (r <= b || e <= l)
return;
if (k == 1 || seg[i] == 0)
return;
if (e-b == 1) {
seg[i] /= k;
return;
}
spray(l,r,k,2*i+1,b,(b+e)/2);
spray(l,r,k,2*i+2,(b+e)/2,e);
seg[i] = seg[2*i+1] + seg[2*i+2];
}
void set_to(int p, ll x, int i, int b, int e)
{
if (e-b == 1) {
# | 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... |