# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1159774 | gohchingjayk | Janjetina (COCI21_janjetina) | C++20 | 352 ms | 589824 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
constexpr int INF = 1ull << 60;
int w[100000 + 5];
int N, K;
struct Node {
Node *left = nullptr, *right = nullptr;
int l, r;
//int val;
Node(int a, int b) {
l = a, r = b;
if (l == r) {
//val = w[l];
}
else {
left = new Node(l, (l+r)>>1);
right = new Node(((l+r)>>1) + 1, r);
//val = max(left->val, right->val);
}
}
int rmq(int start) {
if (r < start) return 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... |