# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376035 | wind_reaper | Game (IOI13_game) | C++17 | 13096 ms | 28908 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
/*struct SegmentTree{
struct Node{
int64_t val;
Node *lc, *rc;
Node() : val(0), lc(0), rc(0) {}
};
vector<Node> tree;
Node* new_node(){
tree.emplace_back();
return &tree.back();
}
Node *root;
int L, R;
void init(int _L, int _R){
this->L = _L;
this->R = _R;
root = new_node();
}
void update(int idx, int64_t val, Node* &node, int l, int 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... |