spfa SLF优化

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>

using namespace std;

typedef long long LL;

#define REP(i, a, b) for(register int i = (a), i##_end_ = (b); i <= i##_end_; ++ i)
#define EREP(i, a) for(register int i = (be[a]); i != -1; i = nxt[i])
#define mem(a, b) memset((a), b, sizeof(a))

template<typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

char buff[1 << 25], *buf = buff;

template <class T>
T read(T sum = 0, T fg = 0)
{
	while(*buf < '0' || *buf > '9') { fg |= *buf == '-'; buf++; }
	while(*buf >= '0' && *buf <= '9') { sum = sum * 10 + *buf - '0'; buf++; }
	return fg ? -sum : sum;
}

void write(int x)
{
	static char s[13]; int slen = 0;
	if(x < 0) { putchar('-'); x = -x; }
	do { s[++slen] = x % 10 + '0'; x /= 10; }while(x);
	while(slen) putchar(s[slen--]);
	putchar(' ');
}

const int inf = 0x3f3f3f3f;

const int maxn = 40010;

const int maxm = 120010;

int to[maxm], nxt[maxm], be[maxn], w[maxm], e;

void add(int x, int y, int z) { to[e] = y; nxt[e] = be[x]; be[x] = e; w[e] = z; e++; }

void init() { mem(be, -1); e = 0; }

int n, m;
int dis[maxn];
bool vis[maxn];

void spfa()
{
	deque <int> Q;
	fill(dis + 1, dis + n + 1, inf);
	Q.push_back(1);
	vis[1] = 1; dis[1] = 0;
	while(!Q.empty())
	{
		int x = Q.front(); Q.pop_front(); vis[x] = 0;
		EREP(i, x)
		{
			int y = to[i];
			if(chkmin(dis[y], dis[x] + w[i]))
			{
				if(!vis[y])
				{
					if(Q.empty() || dis[Q.front()] > dis[y]) Q.push_front(y);
					else Q.push_back(y);
				}
			}
		}
	}
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("jam.in", "r", stdin);
	freopen("jam.out", "w", stdout);
#endif
	fread(buff, 1, 1 << 25, stdin);
	init();
	n = read<int>(), m = read<int>();
	REP(i, 1, m)
	{
		int x = read<int>(), y = read<int>(), z = read<int>();
		add(x, y, z); add(y, x, z);
	}
	int q = read<int>();
	while(q--)
	{
		int c = read<int>(), d = read<int>();
		REP(i, 1, c)
		{
			int id = read<int>() - 1;
			w[id << 1]++; w[(id << 1) + 1]++;
		}
		spfa();
		REP(i, 1, d)
		{
			int x = read<int>();
			if(dis[x] == inf) write(-1);
			else write(dis[x]);
		}
		puts("");
	}
	return 0;
}