# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1038087 | SoulKnight | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 3 ms | 11356 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;
#define ll long long
#define ln '\n'
const int N = 2e5 + 5;
int n, a[N], glit = 1;
vector<int> vec, where[N];
#define lc (v << 1)
#define rc ((v << 1) + 1)
struct node{
int color;
int tm = N + 5;
} seg[4*N];
void pushdown(int v){
if (!seg[v].color) return;
seg[rc].color = (seg[rc].tm > seg[v].tm? seg[v].color: seg[rc].color);
seg[rc].tm = min(seg[rc].tm, seg[v].tm);
seg[lc].color = (seg[lc].tm > seg[v].tm? seg[v].color: seg[lc].color);
seg[lc].tm = min(seg[lc].tm, seg[v].tm);
seg[v].color = 0;
seg[v].tm = N + 5;
}
void upd(int v, int tl, int tr, int l, int r, int color){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |