# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489651 | lucri | Shell (info1cup18_shell) | C++17 | 254 ms | 33876 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
using namespace std;
long long p,n,m,c[1000010],st[1000010],nr,mua[1000010],x,y;
vector<vector<long long>>a;
struct posibilitati{long long nr,lc;}pr[1000010];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m>>p;
for(long long i=1;i<=p;++i)
{
cin>>c[i];
pr[c[i]].lc=c[i];
}
if(c[1]!=1)
c[0]=1;
else
nr=1;
if(c[p]!=n)
c[++p]=n;
a.resize(n+5);
for(long long i=1;i<=m;++i)
{
cin>>x>>y;
a[x].push_back(y);
++mua[y];
}
for(long long i=1;i<=n;++i)
# | 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... |