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
31
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<sstream>
#include<iomanip>
#include<stdlib.h>
using namespace std;
#define INF 2000000000
vector<int> ansPoint;
vector<pair<int,int> > ansEdge;
int N,M;
vector<int> G[20010];
int used[20010];
int dfs[20010];
int low[20010];
int pointFloor[20010];
int dfsNumber;
int rootPoint;
void DFS(int n,int floor)
{
    used[n]=1;
    dfs[n]=dfsNumber;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX