# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377442 | VEGAnn | Specijacija (COCI20_specijacija) | C++14 | 4075 ms | 133572 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 i2 array<ll,2>
using namespace std;
typedef long long ll;
const ll oo = 2e9;
const ll N = 200100;
const ll M = 10;
const ll PW = 10;
const ll HPW = 233;
const ll md = ll(1e9) + 7;
ll n, a[N], t;
ll q;
struct seg_tree{
seg_tree *l, *r;
ll sm;
seg_tree(): l(0), r(0), sm(0) {}
seg_tree(seg_tree *v): l(v -> l), r(v -> r), sm(v -> sm) {}
void build(ll tl, ll tr){
sm = tr - tl + 1;
if (tl == tr) return;
ll md = (tl + tr) >> 1;
l = new seg_tree();
r = new seg_tree();
# | 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... |