# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95345 | dalgerok | Shell (info1cup18_shell) | C++14 | 350 ms | 47844 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 = 1e6 + 5, MOD = 1e9 + 7;
int n, m, p, a[N], dp[N], ans[N];
vector < int > g[N];
void dfs(int v){
if(v == n){
dp[v] = ans[v] = 1;
}
else{
for(int to : g[v]){
if(dp[to] == 0){
dfs(to);
}
if(dp[to] > dp[v]){
dp[v] = dp[to];
ans[v] = ans[to];
}
else if(dp[to] == dp[v]){
ans[v] += ans[to];
if(ans[v] >= MOD){
ans[v] -= 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... |