Submission #1248700

#	Time	Username	Problem	Language	Result	Execution time	Memory
1248700		ender_shayan	Bitaro’s Party (JOI18_bitaro)	C++20	0 / 100	1 ms	2628 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=1e5+10,L=21,bs=701,sq=151;
int A[N],B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],dist[N],vis[N],lst[N];
vector<int>g[N];
pii mn[N][sq];

int main(){
    fast_io
    cin>>n>>m>>q;
    for1(m){
        int u,v;cin>>u>>v;
        g[v].pb(u);
    }
    for1(n){
        for(int u:g[i])lst[u]=sq-1;
        for(int j=sq-1;j>=0;j--){
            pii mx={0,0};
            for(int u:g[i])mx=max(mx,{mn[u][lst[u]].F,u});
            int u=mx.S;
            mn[i][j]={mx.F,mn[u][lst[u]].S};vis[mn[u][lst[u]].S]=1;lst[u]--;
            while(lst[u]>=0){
                if(mn[u][lst[u]].S==0 || vis[mn[u][lst[u]].S]==0)break;
                lst[u]--;
            }
        }
        for(int j=sq-1;j>=0;j--){
            if(mn[i][j].S==0){
                mn[i][j].S=i;
                break;
            }
            else
                mn[i][j].F++;
        }
        for(int j=0;j<sq;j++)vis[mn[i][j].S]=0;
    }
    while(q--){
        int v,t;cin>>v>>t;
        for1(t){
            cin>>A[i];vis[A[i]]=1;
        }
        if(t<sq){
            for(int j=sq-1;j>=0;j--)if(vis[mn[v][j].S]==0){
                cout<<mn[v][j].F<<endl;
                break;
            }
        }
        else{
            for1(v)dp[i]=-mod;
            int mx=0;
            dp[v]=0;
            for(int i=v;i>=1;i--){
                if(vis[i]==0)mx=max(mx,dp[i]);
                for(int u:g[i])
                    dp[u]=max(dp[u],dp[i]+1);
            }
            cout<<mx<<endl;
        }
        for1(n)vis[A[i]]=0;
    }



}

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