제출 #1158122

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158122		akzytr	Bitaro’s Party (JOI18_bitaro)	C++20	7 / 100	2107 ms	489388 KiB

bitaro

#include <bits/stdc++.h>
#define ve vector
#define ar array 
#define pb push_back
#define ins insert

#define endl '\n'
#define ll long long
using namespace std;

const int MXN = 1e5+1;
ve<int> adj[MXN];
set<int> restr[MXN];
bool blck[MXN];

ll ansgy(ll x, ll i){
    priority_queue<pair<int, int>> g;
    ll dst[MXN];
    fill(dst, dst+MXN, -1);
    g.push({0, x});
    while(!g.empty()){
        auto top = g.top();
        g.pop();
        if(top.first > dst[top.second]){
            dst[top.second] = top.first;
            for(int i : adj[top.second]){
                g.push({1+top.first, i});
            }
        }
    }
    int ans = -1;
    for(int j : restr[i]){
        dst[j] = -1;
    }
    for(int j : dst){
        ans = max(ans, j);
    }
    return ans;
}

const int BLCK = 100;
int main(){
    int n, m, q;
    cin >> n >> m >> q;
    fill(blck, blck+MXN, -1);

    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
        adj[b].pb(a);
    }
    int ans[q];
    
    fill(ans, ans+q, -1);
    set<pair<int, int>> madst[n+1];
    for(int i = 1; i <= n; i++){
        madst[i].insert({0, i});
        for(int j : adj[i]){
            for(auto k : madst[j]){
                madst[i].insert({k.first+1, k.second});
                while(madst[i].size() > BLCK){
                    madst[i].erase(madst[i].begin());
                }
            }
        }
    }

    for(int i = 0; i < q; i++){
        int t; cin >> t;
        int sz; cin >> sz;
        for(int j = 0; j < sz; j++){
            int y;
            cin >> y;
            restr[i].insert(y);
            blck[y] = i;
        }
        if(sz >= BLCK){
            ans[i] = ansgy(t, i);
        }
        else{
            for(auto [u,v]: madst[t]){
                if(blck[v] != i){
                    ans[i] = max(ans[i], u);
                }
            }
        }
    }
    for(int i : ans){
        cout << i << endl;
    }
}

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