K Segment Routing

K Segment Routing

题意：

给定T组询问，每组询问给定一个n和m，接下来n行每行给定一个cnt然后输入cnt个点，表示当前行和输入的u之间有一条边，然后接下来的m行每行输入一个u 和 cnt 表示从u这个点开始走cnt次，每一次输入一个v，表示从u这个点能到的第v个点，如果不存在这个就输出"Packet Loss"，否则u就走到这个点，最后输出能到的哪个点

题解：

开一个vector来存当前这个点能到的所有的点即可，然后按照题意模拟即可。

Code

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <set>
#include <queue>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath> 
#include <stack>
#include <iomanip>
#include <deque> 
#include <sstream>
#define x first
#define y second
using namespace std;
typedef long double ld;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ULL;
const int N = 1e5 + 10, M = 2 * N, INF = 0x3f3f3f3f, mod = 1e9 + 7;
const double eps = 1e-8;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int h[N], e[M], ne[M], w[M], idx;
void add(int a, int b, int v = 0) {
    e[idx] = b, w[idx] = v, ne[idx] = h[a], h[a] = idx ++;
}
int n, m, k;
int a[N];
vector<int> p[N];
int main() {
    int T;
    cin >> T;
    for (int k = 1; k <= T; k ++ ) {
        cin >> n >> m;
        for (int i = 1; i <= n; i ++ ) {
            p[i].clear();
            int cnt, v;
            cin >> cnt;
            for (int j = 1; j <= cnt; j ++ ) {
                cin >> v;
                p[i].push_back(v);
            }
        }
        printf("Case #%d: \n", k);
        for (int i = 1; i <= m; i ++ ) {
            bool ok = false;
            int u, v, cnt, vis;
            cin >> u >> cnt;
            vis = u;            
            for (int j = 1; j <= cnt; j ++ ) {
                cin >> v;
                if (v > p[vis].size() || !v) ok = true;
                if (ok) continue;
                vis = p[vis][v - 1];
            }
            if (ok) cout << "Packet Loss" << endl;
            else    cout << vis << endl;
        }
    }
    return 0;
}