# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862055 | sleepntsheep | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 108 ms | 23636 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 <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)
#define N 200005
#define ALL(x) x.begin(), x.end()
int n, a[N], b[N], c[N], C, t[N<<2], lz[N<<2];
vector<int> at[N];
void build(int v, int l, int r)
{
if (l == r) t[v] = a[l];
else build(2*v+1, l, (l+r)/2), build(2*v+2, (l+r)/2+1, r);
}
void push(int v, int l, int r)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |