| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 545764 | mat50013 | Radio (COCI22_radio) | C++11 | 1252 ms | 127984 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;
const int NMAX(1000005);
int lp[NMAX], n, q;
bool activ[NMAX];
set<int> vals[NMAX];
struct SegTree
{
vector<int> arb;
SegTree(){}
inline void init(int n)
{
int pt = 1;
while(pt < n)
pt <<= 1;
pt <<= 1;
arb.resize(pt, n + 1);
}
inline void update(int nod, int st, int dr, int poz, bool tip)
{
if(st == dr)
{
if(tip == 1)
{
int bz = poz;
arb[nod] = n + 1;
while(poz != 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... | ||||