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 <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
#define maxn 105
int A[maxn],dist[maxn][maxn],L[maxn];
vector<int> lays[maxn],vec;
int isleaf[maxn],par[maxn];
int n,m,k;
void solve(){
    for(int i=n-1;i>0;i--){
        for(int b=0;b<lays[i].size();b++){
            int cur = lays[i][b];
            if( par[cur]!=-1 )continue;
            int c = i-1;
            for(int j=0;j<lays[c].size();j++){
                int id = lays[c][j];
                if( isleaf[id] == 0 ){
                    par[cur] = id;
                    isleaf[id] = 1;
                    for(int z=1;z<=n;z++){
                        if(dist[cur][z]==2 && par[z]==-1){
                            par[z] = id;
                        }
                    }
                    for(int z=1;z<=n;z++){
                        dist[id][z] = dist[cur][z]-1;
                        dist[id][z] = max(-1,dist[id][z]);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX