# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5713 | baneling100 | Cactus? Not cactus? (kriii1_C) | C++98 | 60 ms | 11760 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 <stdlib.h>
#include <vector>
using namespace std;
vector <int> A[100001];
int N, M, S[100001], top, check[100001], cycle[100001];
void input(void)
{
int i, x, y;
scanf("%d %d",&N,&M);
for(i=1 ; i<=M ; i++)
{
scanf("%d %d",&x,&y);
A[x].push_back(y);
A[y].push_back(x);
}
}
void process(int now, int prev)
{
int i, j, k;
j=A[now].size();
for(i=0 ; i<j ; i++)
if(A[now][i]!=prev)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |