Submission #201435

#	Time	Username	Problem	Language	Result	Execution time	Memory
201435		egekabas	Bitaro’s Party (JOI18_bitaro)	C++14	7 / 100	2095 ms	101600 KiB

bitaro

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
int n, m, q;
int sq = 200;
vector<int> inc[200009];
vector<pii> far[200009];
int dist[200009];
int check(vector<int> & v, int x){
    auto it = lower_bound(v.begin(), v.end(), x);
    if(it == v.end() || *it != x)
        return 1;
    return 0;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n >> m >> q;
    while(m--){
        int x, y;
        cin >> x >> y;
        inc[y].pb(x);
    }
    for(int i = 1; i <= n; ++i){
        far[i].pb({0, i});
        map<int, int> mpp;
        for(auto u1 : inc[i])
            for(auto u2 : far[u1])
                mpp[u2.ss] = u2.ff+1;
        for(auto u : mpp)
            far[i].pb({u.ss, u.ff});
        sort(far[i].begin(), far[i].end(), greater<pll>());
        while((int)far[i].size() > sq)
            far[i].pop_back();
    }
    while(q--){
        int root, k;
        cin >> root >> k;
        vector<int> busy(k);
        for(int i = 0; i < k; ++i)
            cin >> busy[i];
        if(k < sq){
            int neg = 1;
            for(auto u : far[root])
                if(check(busy, u.ss)){
                    neg = 0;
                    cout << u.ff << "\n";
                    break;
                }
            if(neg)
                cout << "-1\n";
        }
        else{
            for(int i = 1; i < root; ++i)
                dist[i] = -1;
            dist[root] = 0;
            int ans = -1;
            for(int i = root; i >= 1; --i){
                if(dist[i] == -1)
                    continue;
                if(dist[i] > ans && check(busy, i))
                    ans = dist[i];
                for(auto u : inc[i])
                    dist[u] = max(dist[u], dist[i]+1);
            }
            cout << ans << "\n";
        }
    }
}

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