| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 378407 | limabeans | Po (COCI21_po) | C++17 | 50 ms | 13668 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;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int inf = 2e9;
struct sparse_table {
const static int LOG = 20;
int n;
vector<int> a[LOG+1];
vector<int> lg_floor;
int eval(int x, int y) {
return min(x, y);
}
void init(vector<int> v) {
n = v.size();
lg_floor.resize(n+10);
lg_floor[1] = 0;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||