# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549757 | MilosMilutinovic | Crossing (JOI21_crossing) | C++14 | 305 ms | 14344 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;
const int N = 200005;
const int MD = 1e9 + 7;
const int BASE = 77777;
int mul(int x, int y) {
return (long long) x * y % MD;
}
int add(int x, int y) {
return x + y >= MD ? x + y - MD : x + y;
}
int sub(int x, int y) {
return x - y < 0 ? x - y + MD : x - y;
}
int st[4 * N], lzy[4 * N], pw[N], pref[N];
bool act[4 * N];
void build(int node, int l, int r, string& s) {
if (l == r) {
st[node] = mul((s[l] - '0'), pw[l]);
return;
}
int mid = l + r >> 1;
build(node + node, l, mid, s);
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... |