# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848970 | mickey080929 | Sushi (JOI16_sushi) | C++17 | 12080 ms | 92928 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>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define szz(x) (int)(x).size()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int inf = 1e9;
const int B = 640;
struct LazySegTree {
public:
void build(int _n) {
n = _n;
lg = Log2(n);
sz = (1 << lg);
tree.resize(sz << 1);
fill(tree.begin(), tree.end(), inf);
lazy.resize(sz);
fill(lazy.begin(), lazy.end(), 0);
}
void Set(int i, int val) { tree[--i | sz] = val; }
void Init() { for (int i = sz - 1; i; i--) Pull(i); }
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... |