Submission #16431

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
16431	2015-08-24 17:34:21	rhdmstjr	Cactus? Not cactus? (kriii1_C)	C++98	0 / 1	0 ms	1580 KiB

C

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int N,M;
int visited_cnt;
map<pair<int,int>, int> visited_edge;
void cnt_cycle(vector<vector<int> > &graph, int &cnt, vector<int> &visited, int pre, int now){
  //printf("cycle now == %d, pre == %d, visited_cnt = %d\n", now, pre, visited_cnt);
  if(visited_cnt > M) return ;
  visited_cnt++; // count edge
  visited_edge[pair<int,int>(min(pre,now), max(pre,now))] = 1;
  if(visited[now] != 0){
  //  printf("now == %d\n", now);
    cnt++;
    return;
  }
  visited[now] = 1;
  for(int i=0;i<graph[now].size();i++){
    int to = graph[now][i];
    if( pre != to && visited_edge[pair<int,int>(min(now, to), max(now, to))] == 0 )
      cnt_cycle(graph, cnt, visited, now, to);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 1