# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1035956 | amine_aroua | Arranging Tickets (JOI17_arranging_tickets) | C++17 | 0 ms | 348 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
struct Node
{
int sum , cnt;
Node(){
sum = cnt = 0;
}
};
struct segTree
{
vector<Node> tree;
int BASE;
void build(int n)
{
BASE = n;
while(__builtin_popcount(BASE) != 1)
{
BASE++;
}
tree.assign(4*BASE , Node());
}
void upd(int node , int s , int e ,int l , int r , int val)
{
if(l > e || s > r)
return ;
if(l <= s && e <= 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |