# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1134211 | bpptidp | Shell (info1cup18_shell) | C++20 | 863 ms | 25412 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
#define pb push_back
const int N=1.5e3+2,mod=1e9+7;
vector<int>g[N],rg[N];
int tin[N],tout[N];
int memo[N],vrx[N];
int n,m,p,ti;
int get(int u,int v){
if(u==v)return memo[v]=1;
if(memo[v]!=-1)return memo[v];
int sm=0;
for(int j:rg[v])
sm=(sm+get(u,j))%mod;
return memo[v]=sm;
}
void dfs(int u){
tin[u]=++ti;
for(int v:g[u])if(!tin[v])dfs(v);
tout[u]=++ti;
}
bool iznad(int a,int b){
return tin[a]<=tin[b]&&tout[a]>=tout[b];
}
# | 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... |