Submission #1158137

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158137		akzytr	Bitaro’s Party (JOI18_bitaro)	C++20	7 / 100	2097 ms	131792 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];
ve<int> restr[MXN];
int blck[MXN];
int ans[MXN];
ve<pair<int, int>> madst[MXN+1];
const int BLCK = 100;

ll ansgy(ll x, ll i){
    priority_queue<pair<int, int>> g;
    int 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 as = -1;
    for(int j = 0; j < MXN; j++){
        if(blck[j] != i){
            as = max(as, dst[j]);
        }
    }

    return as;
}

void populate(ll x){
    map<int, int> g;
    madst[x].pb({0, x});
    for(int i : adj[x]){
        for(auto [dst, y] : madst[i]){
            g[y] = max(g[y], dst+1);
        }
    }
    for(auto [y, dst] : g){
        madst[x].pb({dst, y});
    }
    sort(madst[x].rbegin(), madst[x].rend());
    while(madst[x].size() > BLCK){
        madst[x].pop_back();
    }
}

int main(){
    fill(ans, ans+MXN, -1);
    fill(blck, blck+MXN, -1);

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


    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
        adj[b].pb(a);
    }
    for(int i = 1; i <= n; i++){
        populate(i);
    }
    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].pb(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 = 0; i < q; i++){
        cout << ans[i] << endl;
    }
}

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