传送门:http://acm.nyist.edu.cn/JudgeOnline/problem.php?pid=1238
比赛的时候题目都没有看,以为是校赛的那道题(一直没有处理),赛后看了原来不是那道题,这个应该是可以想出来的。
思路:给出m条公交车线路,用字符串处理一下,存边。然后权值为1,d[n] - 1就是答案。
不过字符串处理是有点坑的。。。(可能是多位数。。。)
AC代码:
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define FO freopen("in.txt", "r", stdin);
#define lowbit(x) (x&-x)
#define mem(a,b) memset(a, b, sizeof(a));
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
const int inf = 0x3f3f3f3f;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
//head
const int maxn = 500 + 7;
int d[maxn];
bool vis[maxn];
int _, n, m;
char ss[100 * maxn];//注意范围
struct node{
int v;
int dis;
node(){}
node(int _v, int _dis):v(_v), dis(_dis){}
};
vector<node> G[maxn];
void dijkstra(int st) {//基操
fill(d, d+maxn, inf);
mem(vis, false);
d[st] = 0;
rep(i, 1, n+1) {
int minn = inf, u = -1;
rep(j, 1, n+1) {
if(d[j] < minn && !vis[j]) {
minn = d[j];
u = j;
}
}
if(u == -1) return;
vis[u] = true;
rep(j, 0, SZ(G[u])) {
int v = G[u][j].v;
if(d[u] + G[u][j].dis < d[v] && !vis[v]) {
d[v] = d[u] + G[u][j].dis;
}
}
}
}
int main() {
for(scanf("%d", &_);_;_--) {
scanf("%d%d", &m, &n);
mem(G, 0);
getchar();
while(m--) {
gets(ss);
int len = strlen(ss);
VI temp;
int zhi = 0;
rep(i, 0, len) {//把数据放入temp
if(ss[i] == ' ' || i == len - 1) {
if(i == len - 1)
zhi = zhi * 10 + ss[i] - '0';
temp.pb(zhi);
zhi = 0;
} else zhi = zhi * 10 + ss[i] - '0';
}
rep(i, 0, SZ(temp)) {//存边
rep(j, i+1, SZ(temp)) {
G[temp[i]].pb(node(temp[j], 1));
}
}
}
dijkstra(1);
if(d[n] == inf)
printf("NO\n");
else
printf("%d\n", d[n]-1);
}
}