# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519885 | Vianti | Index (COCI21_index) | C++17 | 1978 ms | 91596 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;
const int maxP = 200000;
int cnt = 0;
struct Node {
int l, r;
int sum;
Node(int left, int right, int v) : l(left), r(right), sum(v) {};
Node() : l(0), r(0), sum(0) {};
};
Node nnode[36 * maxP];
struct SegTree {
int sz = 0;
int createTree(int l, int r) {
if (l == r) {
return cnt++;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |