| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1032771 | juicy | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 215 ms | 18876 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 2e5 + 5, inf = 1e9;
int n, k;
int s[4 * N], sum[4 * N], lst[N];
bool flip[N];
void upd(int i, int x, int id = 1, int l = 1, int r = k) {
if (l == r) {
s[id] = x;
sum[id] = x != inf;
return;
}
int md = (l + r) / 2;
if (i <= md) {
upd(i, x, id * 2, l, md);
} else {
upd(i, x, id * 2 + 1, md + 1, r);
}
s[id] = min(s[id * 2], s[id * 2 + 1]);
sum[id] = sum[id * 2] + sum[id * 2 + 1];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
