# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4002 | GhostCode | Cactus? Not cactus? (kriii1_C) | C++98 | 0 ms | 1744 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>
#define MAX 100001
int con_y[MAX]={0};
int main()
{
int n=0;
int m=0;
int temp=0;
int indegree[MAX]={0};
scanf("%d", &n);
scanf("%d", &m);
for(int i=0; i<m; i++)
{
scanf("%d", &temp);
scanf("%d", &con_y[i]);
indegree[con_y[i]]++;
}
for(int i=1; i<=n; i++)
{
if(indegree[i]>=2)
{
printf("Not cactus");
return 0;
}
}
printf("Cactus");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |