Submission #5123

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
51232014-02-10 04:14:55aintaCactus? Not cactus? (kriii1_C)C++98
1 / 1
68 ms10092 KiB
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>E[100001];
int n,m,p[100001],C[100001];
bool v[100001];
void DFS(int a){
v[a]=true;
int i,j;
for(i=0;i<E[a].size();i++){
if(v[E[a][i]] && E[a][i]!=p[a]){
j=a;
C[j]++;
while(j!=E[a][i]){
C[p[j]]++;
j=p[j];
}
}
}
for(i=0;i<E[a].size();i++){
if(!v[E[a][i]]){
p[E[a][i]]=a;
DFS(E[a][i]);
}
}
}
int main()
{
int a,b,i;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...