#include <cstdio>
#include <cctype>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 491520+10;
const int maxn = 15;
struct node{
int s,x;
node(int s=0,int x=0):s(s),x(x){}
}q[N],act[N];
int vis[1<<maxn][maxn],n,m,s,t,fa[N],dist[N]; //491520
vector<int> G[maxn];
void print_ans(int front_){
if(fa[front_]==-1) return ;
print_ans(fa[front_]);
printf("%d %d\n",act[front_].s+1,a......
阅读全文