# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4809 | cki86201 | Biochips (IZhO12_biochips) | C++98 | 364 ms | 402884 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<stdio.h>
#include<algorithm>
using namespace std;
int N,M;
int dp[200020][505];
int me[200020],S[200020],D[200020],ord[200020],now = 1;
int st[200020],en[400040],next[400040],c_edge = 2,R;
bool chk[200020];
void addedge(int s,int d)
{
next[c_edge]=st[s];
st[s]=c_edge;
en[c_edge++]=d;
}
void dfs(int x)
{
chk[x]=1;
S[x] = now;
for(int i=st[x];i;i=next[i]){
if(!chk[en[i]])dfs(en[i]);
}
ord[D[x] = now++] = x;
}
int main(){
scanf("%d%d",&N,&M);
int i,j;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |