# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359019 | jesus_coconut | Fancy Fence (CEOI20_fancyfence) | C++17 | 30 ms | 6988 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 ll = long long;
int const MOD = 1e9 + 7;
int n;
vector<ll> h, w;
void read() {
cin >> n;
h.resize(n);
w.resize(n);
for (auto &a : h) cin >> a;
for (auto &a : w) cin >> a;
}
ll modsub(ll a, ll b) {
ll ret = (a - b) % MOD;
if (ret < 0) ret += MOD;
return ret;
}
ll pot(ll a, int k) {
ll ret = 1;
while (k) {
if (k % 2) {
ret *= a;
ret %= MOD;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |