先上题目链接点击打开链接
这题网上的题解略少,百度就只有一题。那老哥的head数组用的太妙了,想不到,然后我们哥几个就用链表写了一的,没想到A了。
大体思路是A<B时加一个B到A的有向边,A=B时加两条边,然后做两次DFS看1和n是否相连,用二分找到对应的值。
代码如下:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, from, to,le, ri, mid,ans;
char op[2];
struct node {
int to, index;
node(int t, int in) :to(t), index(in) {}
};
bool used[maxn];
vector<node> g[maxn];
bool dfs(int u,int mi) {
if (u == mi) return 1;
used[u] = 1;
for (int i = 0; i < g[u].size(); ++i) {
node e = g[u][i];
if (e.index > mid||used[e.to]) continue;
if (dfs(e.to,mi)) return 1;
}
return 0;
}
int main() {
scanf("%d%d ", &n, &m);
for (int i = 1; i <= m; ++i) {
getchar();
scanf("%d ", &from);
scanf("%s ", op);
getchar();
scanf("%d ", &to);
if (from == to) continue;
if ('<' == op[0]) {
g[from].push_back(node(to, i));
}
else if ('=' == op[0]) {
g[from].push_back(node(to, i));
g[to].push_back(node(from, i));
}
}
if (n == 1) {
printf("0\n");
return 0;
}
le = 0, ri = m,ans = -1;
while (le + 1 < ri) {
mid = (le + ri) >> 1;
memset(used, 0, sizeof(used));
bool ok = dfs(n,1);
if (!ok){
memset(used, 0, sizeof(used));
ok=dfs(1,n);
}
if (ok) { ans = mid; ri = mid; }
else { le = mid; }
}
printf("%d\n", ans);
return 0;
}