# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249220 | 2020-07-14T13:43:01 Z | blacktulip | Shell (info1cup18_shell) | C++17 | 1000 ms | 12160 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define int long long #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t,dp[1505]; int cev; string s; vector<int> v[li]; inline int add(int x,int y){ if(x+y>=mod)return x+y-mod; return x+y; } inline void f(int sira,int gel){ //~ int cevv=0; int use=gel; if(a[use]==sira)use++; if(sira==n){ if(use>k)cev=add(cev,1); //~ return 0; } //~ if(~dp[sira])return dp[sira]; for(int i=0;i<(int)v[sira].size();i++){ int go=v[sira][i]; f(go,use); } //~ return dp[sira]=cevv; } inline int mul(int x,int y){ return (x%mod)*(y%mod)%mod; } main(void){ memset(dp,-1,sizeof(dp)); scanf("%lld %lld %lld",&n,&m,&k); for(int i=1;i<=k;i++){ scanf("%lld",&a[i]); } //~ sort(a+1,a+n+1); for(int i=1;i<=m;i++){ int x,y; //~ if(vis[x][y])continue; scanf("%lld %lld",&x,&y); v[x].pb(y); //~ v[y].pb(x); } f(1,1); printf("%lld\n",cev); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 12032 KB | Output is correct |
2 | Correct | 20 ms | 12032 KB | Output is correct |
3 | Correct | 7 ms | 12032 KB | Output is correct |
4 | Correct | 14 ms | 12032 KB | Output is correct |
5 | Correct | 51 ms | 12032 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 12032 KB | Output is correct |
2 | Correct | 20 ms | 12032 KB | Output is correct |
3 | Correct | 7 ms | 12032 KB | Output is correct |
4 | Correct | 14 ms | 12032 KB | Output is correct |
5 | Correct | 51 ms | 12032 KB | Output is correct |
6 | Execution timed out | 1090 ms | 12032 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1083 ms | 12160 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 12032 KB | Output is correct |
2 | Correct | 20 ms | 12032 KB | Output is correct |
3 | Correct | 7 ms | 12032 KB | Output is correct |
4 | Correct | 14 ms | 12032 KB | Output is correct |
5 | Correct | 51 ms | 12032 KB | Output is correct |
6 | Execution timed out | 1090 ms | 12032 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |