Submission #854993

#	Time	Username	Problem	Language	Result	Execution time	Memory
854993		VMaksimoski008	Bitaro’s Party (JOI18_bitaro)	C++14	0 / 100	1 ms	348 KiB

bitaro

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n, m, q;
    cin >> n >> m >> q;

    vector<vector<int> > graph(n+1);

    for(int i=0; i<m; i++) {
        int a, b;
        cin >> a >> b;
        graph[b].push_back(a);
    }

    while(q--) {
        int t, y;
        cin >> t >> y;
        vector<bool> c(n+1);
        for(int i=0; i<y; i++) {
            int x;
            cin >> x;
            c[x] = 1;
        }

        int ans = -1;

        vector<bool> vis(n+1);
        vector<int> dist(n+1, 1e12);
        priority_queue<pii, vector<pii>, greater<pii> > pq;

        pq.push({ 0, t });
        dist[t] = 0;

        while(!pq.empty()) {
            int u = pq.top().second;
            pq.pop();

            if(vis[u]) continue;
            vis[u] = 1;

            for(int &v : graph[u]) {
                if(dist[v] > dist[u] - 1) {
                    dist[v] = dist[u] - 1;
                    pq.push({ dist[v], v });
                }
            }
        }

        for(int i=1; i<=n; i++) {
            if(dist[i] == 1e12) continue;
            if(c[i]) continue;
            ans = max(ans, abs(dist[i]));
        }

        cout << ans << '\n';
    }

    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86