# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690981 | divad | Shell (info1cup18_shell) | C++14 | 64 ms | 31704 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>
#define MOD 1000000007
#define MAX 1000002
using namespace std;
int n,m,p,x,y,d[MAX],dp[MAX],c[MAX],vf[MAX];
vector<int> v[MAX];
vector<int> mrc;
void dfs(int nod){
vf[nod] = 1;
for(int vecin: v[nod]){
if(vf[vecin] == 0){
d[vecin] = 1+dp[nod];
dfs(vecin);
}
}
}
void dfs_dp(int nod, int src, int dest){
vf[nod] = 1;
for(int vecin: v[nod]){
if(vf[vecin] == 0 && d[vecin] >= d[nod] || (vecin == dest || c[vecin] == 0)){
dp[vecin] += dp[nod];
dp[vecin] %= MOD;
dfs_dp(vecin, src, dest);
}
}
}
int nr_drum(int src, int dest){
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... |