# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1177050 | InvMOD | Happiness (Balkan15_HAPPINESS) | C++20 | 1082 ms | 251640 KiB |
#include<bits/stdc++.h>
//#define name "InvMOD"
#ifndef name
#include "happiness.h"
#endif // name
using namespace std;
using ll = long long;
struct Node{
ll sum;
Node *left, *right;
Node(ll v = 0): sum(v){
left = nullptr;
right = nullptr;
}
void update(ll l, ll r, ll x, ll val){
if(l == r){
sum += val;
}
else{
ll m = l+r>>1;
if(x <= m){
if(!left) left = new Node();
left->update(l, m, x, val);
}
# | 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... |