# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862188 | Raul_A | Shell (info1cup18_shell) | C++14 | 1012 ms | 63324 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 ll long long
using namespace std;
const int MAX=1e6;
const int mod=1e9+7;
int n,m,k,target;
ll ans=1,dp[MAX+5];
vector<int> v;
unordered_map<int,int> G[MAX+5];
void read()
{
cin>>n>>m>>k;
v.resize(k);
for(auto& x: v) cin>>x;
for(int i=1,x,y;i<=m;i++)
{
cin>>x>>y;
G[x][y]++;
}
}
void dfs(int node,int father)
{
if(node==target) return;
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... |