# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90747 | IOrtroiii | Popeala (CEOI16_popeala) | C++14 | 1988 ms | 132120 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.
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int n, t, s;
long long a[20005];
vector<int> go[20005];
long long f[55][20005];
char board[55][20005];
template<class num_t>
struct range {
num_t a[20005];
num_t f[15][20005];
void upd(int u,num_t v) {
a[u] = v;
}
void build() {
for (int i = 0; i <= t; ++i) f[0][i] = a[i];
for (int i = 1; i <= 14; ++i) {
for (int j = 0; j + (1 << i) - 1 <= t; ++j) {
f[i][j] = min(f[i - 1][j], f[i - 1][j + (1 << (i - 1))]);
}
}
}
num_t get(int l,int r) {
int LG = __lg(r - l + 1);
return min(f[LG][l], f[LG][r - (1 << LG) + 1]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |