Submission #1103496

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103496		trandangquang	Bitaro’s Party (JOI18_bitaro)	C++14	100 / 100	673 ms	143172 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

#define task "test"
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define bit(s, i) (((s) >> (i)) & 1)
#define ii pair <int, int>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll

void solve();

int32_t main() {
    if(fopen(task".inp", "r")) {
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}
	cin.tie(0)->sync_with_stdio(0);

    solve();
}

const int N=1e5+5;
const int B=100;
const int INF=1e9;

int n, m, q, ban[N], dp[N], res[N];
vector<int>adj[N];
vector<ii> largest[N];

void solve() {
    cin>>n>>m>>q;
    FOR(i,1,m){
        int a,b; cin>>a>>b;
        adj[b].eb(a);
    }

    vector<ii>tmp;
    FOR(i,1,n){
        tmp.clear();
        largest[i].eb(0, i);
        for(int j:adj[i]){
            for(ii k:largest[j]) {
                tmp.eb(k.fi+1, k.se);
                res[k.se]=max(res[k.se], k.fi + 1);
            }
        }
        for(ii j:tmp){
            if(res[j.se] == j.fi){
                largest[i].eb(j);
                res[j.se] = 0;
            }
        }
        sort(all(largest[i]), greater<ii>());
        while(sz(largest[i]) > B) largest[i].pop_back();
    }

    vector<int>c;
    FOR(i,1,q){
        int t,y; cin>>t>>y;

        c.clear();
        FOR(j,1,y){
            int x;cin>>x;
            c.eb(x);
            ban[x]=true;
        }

        if(y<B){
            int mx=-1;
            for(ii j:largest[t]){
                if(!ban[j.se]){
                    mx=max(mx,j.fi);
                }
            }
            cout<<mx;
        }
        else{
            FOR(j,1,t){
                if(ban[j]) dp[j]=-INF;
                else dp[j]=0;
                for(int k:adj[j]){
                    dp[j]=max(dp[j],dp[k]+1);
                }
            }
            cout<<max(dp[t],-1);
        }
        cout<<'\n';
        for(int j:c) ban[j]=false;
    }
}

Compilation message (stderr)

bitaro.cpp: In function 'int32_t main()':
bitaro.cpp:23:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:24:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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