# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670220 | blue | Crossing (JOI21_crossing) | C++17 | 347 ms | 38460 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;
using vi = vector<int>;
using ll = long long;
const ll mod = 1'000'000'007LL;
const int mx = 200'000;
ll pr[1 + mx];
ll basehash[3][1 + mx];
ll mul(ll a, ll b)
{
return (a * b) % mod;
}
ll ad(ll a, ll b)
{
return (a + b) % mod;
}
int N;
vi A, B, C;
vi AB, BC, CA;
vi ABC, BCA, CAB;
# | 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... |