Submission #1214427

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214427		MohamedFaresNebili	From Hacks to Snitches (BOI21_watchmen)	C++20	0 / 100	760 ms	589824 KiB

watchmen

#include <bits/stdc++.h>

        using namespace std;

        int N, M, K;
        vector<int> adj[250005];
        int _L, L[155];

        int32_t main() {
            ios_base::sync_with_stdio(0);
            cin.tie(0); cout.tie(0);
            cin >> N >> M;
            for(int l = 0; l < M; l++) {
                int U, V; cin >> U >> V;
                adj[U].push_back(V);
                adj[V].push_back(U);
            }
            cin >> K; cin >> _L;
            for(int l = 0; l < _L; l++) cin >> L[l];

            queue<array<int, 3>> Q;
            Q.push({1, 0, 0});
            while(!Q.empty()) {
                int U = Q.front()[0];
                int V = Q.front()[1];
                int W = L[V];
                int C = Q.front()[2]; Q.pop();
                if(U == W) continue;
                if(U == N) {
                    cout << C;
                    return 0;
                }
                V++; V %= _L;
                Q.push({U, V, C + 1});
                for(auto u : adj[U]) {
                    Q.push({u, V, C + 1});
                }
            }
            cout << -1;
            return 0;
        }

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20