# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774968 | huutuan | Addk (eJOI21_addk) | C++14 | 260 ms | 12004 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 int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)
struct ST_node{
int x;
ST_node (int a=0): x(a){}
friend ST_node sus(const ST_node& a, const ST_node& b){
return ST_node(a.x+b.x);
}
};
struct SegmentTree{
int n; vector<ST_node> t;
void init(int _n){
n=_n;
t.assign(4*n+1, ST_node());
}
void build(int k, int l, int r, int* a){
if (l==r){
t[k]=ST_node(a[l]);
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |