本题对我而言算难题了, 遇到的问题
1 被保护点与保护点的存储问题,
解决方法 bf[a].push_back(i); i为被保护点, a为保护点,这样可以再占领a点时,很容易把a点保护的点删去,
2 对优先队列中出队列的点的含义比清楚,含义 此点应该是距离起点距离最近的, 且此不会再如队列。
3 应该把出队列的点的所有保护的城市的保护数减1 , 更重要的是把他保护的城市的最晚保护时间更新, first[u] = max(first[u], dist[v]); u被保护城市,v保护城市。
4 此点所能到点的松弛。在什么时候进行。
5 松弛后, 应对目前不受保护的城市进行如队列,但如队列要在 dist[i] = max(dist[i], first[i]);执行后进行, 因为起点到当前点的距离,根最晚被保护时间有关, 再如队列前,一定要求两点中最大的, 做起点到此点的距离。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int MAX = 99999999;
const int M = 3005;
int dist[M];
int dis[M];
int num[M];
int vist[M];
int first[M];
int n , m, T;
struct node {
int to;
int l;
friend bool operator < (node a,node b)
{
return a.l>b.l;
}
};
vector<node> vt[M];
vector<int>bf[M];
int dij(int s) {
priority_queue<node>que;
memset(vist, 0, sizeof(vist));
memset(first, 0, sizeof(first));
fill(dist, dist + n +1, MAX);
dist[1] = 0;
node p;
p.l = 0;
p.to = s;
que.push(p);
while(!que.empty()) {
int d = que.top().l;
int v = que.top().to;
que.pop();
if(v == n)
return d;
if(vist[v]) // vist[i] == 1 表示此点一被遍历过来, 把此点删除,
continue;
vist[v] = 1;
//先把此点保护的点都释放;
for(int i = 0; i < bf[v].size(); i++) {
int u = bf[v][i];
if(vist[u])
continue;
num[u]--;
first[u] = max(first[u], dist[v]); //更新被保护点被保护的最长时间。
}
for(int i = 0; i < vt[v].size(); i++) {
int ll = vt[v][i].l; //照常松弛v 到个点的距离,
//这一点没有想到,
int u = vt[v][i].to;
if(dist[u] > ll + d) {
dist[u] = ll + d;
}
}
for(int i = 1; i <= n; i++) {
if(vist[i]) //找出个点 dist 和 最晚保护时间中最大的, 更新dist;
continue;
dist[i] = max(dist[i], first[i]);
if(num[i] == 0) {
p.l = dist[i];
p.to = i;
que.push(p);
}
}
}
return 0;
}
int main()
{
int a, b, d;
node p;
scanf("%d", &T);
while(T--) {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) {
vt[i].clear();
bf[i].clear();
}
for(int i = 1; i <= m; i++) {
scanf("%d%d%d", &a, &b, &d);
p.to = b;
p.l = d;
vt[a].push_back(p);
}
for(int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
for(int j = 0; j < num[i]; j++) {
scanf("%d", &a);
bf[a].push_back(i); //此种输入方法很好。
}
}
int ans = dij(1);
printf("%d\n", ans);
}
return 0;
}
第二次做
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int inf = 0x7fffffff;
const int M = 3005;
struct node {
int u;
int len;
};
int dis[M];
int vist[M];
int num[M];
int n,m;
node cur;
int t;
int pre[M];
vector<int>procity[M];
vector<node>road[M];
void init() {
for(int i = 1; i <= n; i++) {
num[i] = 0;
vist[i] = 0;
dis[i] = inf;
road[i].clear();
pre[i] = 0;
procity[i].clear();
}
}
void work() {
int index, minn = inf;
dis[1] = 0;
for(int k = 1; k <= n; k++) {
minn = inf;
for(int i = 1; i <= n; i++) {
if(!vist[i] && dis[i] < minn && !num[i]){
minn = dis[i];
index = i;
}
}
if(minn == inf)
break;
vist[index] = 1;
dis[index] = max(dis[index], pre[index]);
for(int i = 0; i < (int)procity[index].size(); i++) {
pre[procity[index][i]] = max(pre[procity[index][i]], dis[index]);
num[procity[index][i]]--;
}
for(int i = 0; i <(int)road[index].size(); i++) {
cur = road[index][i];
if(!vist[cur.u] && dis[cur.u] > dis[index] + cur.len)
dis[cur.u] = dis[index] + cur.len;
}
}
printf("%d\n", dis[n]);
}
int main()
{
int x;
scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &m);
init();
for(int i = 1; i <= m; i++){
scanf("%d%d%d", &x, &cur.u, &cur.len);
road[x].push_back(cur);
}
for(int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
for(int j = 0; j < num[i]; j++){
scanf("%d", &x);
procity[x].push_back(i);
}
}
work();
}
return 0;
}
#include <cstdio>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int inf = 0x7fffffff;
const int M = 3005;
struct node {
int u;
int len;
};
int dis[M];
int vist[M];
int num[M];
int n,m;
node cur;
int t;
int pre[M];
vector<int>procity[M];
vector<node>road[M];
void init() {
for(int i = 1; i <= n; i++) {
num[i] = 0;
vist[i] = 0;
dis[i] = inf;
road[i].clear();
pre[i] = 0;
procity[i].clear();
}
}
void work() {
int index, minn = inf;
dis[1] = 0;
for(int k = 1; k <= n; k++) {
minn = inf;
for(int i = 1; i <= n; i++) {
if(!vist[i] && dis[i] < minn && !num[i]){
minn = dis[i];
index = i;
}
}
if(minn == inf)
break;
vist[index] = 1;
dis[index] = max(dis[index], pre[index]);
for(int i = 0; i < (int)procity[index].size(); i++) {
pre[procity[index][i]] = max(pre[procity[index][i]], dis[index]);
num[procity[index][i]]--;
}
for(int i = 0; i <(int)road[index].size(); i++) {
cur = road[index][i];
if(!vist[cur.u] && dis[cur.u] > dis[index] + cur.len)
dis[cur.u] = dis[index] + cur.len;
}
}
printf("%d\n", dis[n]);
}
int main()
{
int x;
scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &m);
init();
for(int i = 1; i <= m; i++){
scanf("%d%d%d", &x, &cur.u, &cur.len);
road[x].push_back(cur);
}
for(int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
for(int j = 0; j < num[i]; j++){
scanf("%d", &x);
procity[x].push_back(i);
}
}
work();
}
return 0;
}