# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891280 | fanwen | RMQ (NOI17_rmq) | C++17 | 633 ms | 600 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;
#define fi first
#define se second
#define ll long long
#define file(name) \
if(fopen(name".inp", "r")) \
freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout);
const int MAX = 1e5 + 5;
int n, q, ans[MAX];
vector <tuple <int, int, int>> queries;
namespace sub1 {
bool check() {
return max(n, q) <= 10;
}
template<class T, T (*merge) (T, T)>
struct sparse_table {
vector <vector <T>> q;
int n;
sparse_table() {}
sparse_table(const vector <T> &v) : n((int) v.size()) {
q.push_back(v);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |