# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4008 | 2013-08-31T09:57:51 Z | GhostCode | Cactus? Not cactus? (kriii1_C) | C++ | 0 ms | 1740 KB |
#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=0; i<=n; i++) { if(indegree[i]>=2) { printf("Not cactus"); return 1; } } printf("Cactus"); return 0; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 1740 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |