# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519883 | Vianti | Index (COCI21_index) | C++17 | 2561 ms | 142888 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;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
struct Node {
Node* l, * r;
int sum;
Node(Node* left, Node* right, int v) {
l = left;
r = right;
sum = v;
}
Node() {
l = nullptr;
r = nullptr;
sum = 0;
}
};
struct SegTree {
int sz = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |