void dij() {
	for(int i=1;i<=n;i++) {
		dis[i]=-2147483647;
	}
	dis[1]=0;
	q.push(p(0,1));
	while(!q.empty()) {
		long long u=q.top().second;
		q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(long long e=head[u];e;e=nxt[e])
		if(dis[to[e]]<dis[u]+val[e]) {
			dis[to[e]]=dis[u]+val[e];
			q.push(p(dis[to[e]],to[e]));
		}
	}
	return;
}

54pts

然而

//		if(vis[u]) continue;
//		vis[u]=1;
		

AC

？（迷惑