# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661279 | Alex_tz307 | Sprinkler (JOI22_sprinkler) | C++17 | 419 ms | 44496 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 kD = 40;
void multSelf(int &x, int y, int mod) {
x = (int64_t)x * y % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, l;
cin >> n >> l;
vector<int> par(1 + n + kD);
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
par[v] = u;
}
par[1] = n + 1;
for (int i = n + 1; i < n + kD; ++i) {
par[i] = i + 1;
}
vector<int> h(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
vector<vector<int>> coef(1 + n + kD, vector<int>(1 + kD, 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |