Submission #471301

#	Time	Username	Problem	Language	Result	Execution time	Memory
471301		NhatMinh0208	Bitaro’s Party (JOI18_bitaro)	C++14	100 / 100	1226 ms	268544 KiB

bitaro

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 200
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,q,i,j,k,t,t1,u,v,a,b;
int qt,qy;
int qc[100001];
int dis[100001];
vector<pii(int)> lowest[100001];
vector<int> gt[100001];
vector<int> gt2[100001];
int main()
{
	fio;
    cin>>n>>m>>q;
    for (i=1;i<=m;i++) {
        cin>>u>>v;
        gt[u].push_back(v);
        gt2[v].push_back(u);
    }
    for (i=1;i<=n;i++) dis[i]=-1e9;

    for (i=1;i<=n;i++) {
        vec.clear();
        for (auto g : gt2[i])
        for (auto gg : lowest[g]) {
            if (dis[gg.se]==-1e9) vec.push_back(gg.se);
            dis[gg.se]=max(dis[gg.se],gg.fi); 
        }
        for (auto g : vec) {lowest[i].push_back({dis[g],g}); dis[g]=-1e9;} 
        lowest[i].push_back({-1,i});
        if (lowest[i].size()>mag) {
            nth_element(lowest[i].begin(),lowest[i].end()-mag,lowest[i].end());
            reverse(lowest[i].begin(),lowest[i].end());
            while(lowest[i].size()>mag) lowest[i].pop_back();
        }
        for (auto& g : lowest[i]) g.fi++;
    }
    for (t=1;t<=q;t++) {
        vec.clear();
        cin>>qt>>qy;
        for (j=0;j<qy;j++) {
            cin>>u;
            vec.push_back(u);
            qc[u]=1;
        }
        if (qy>=mag) {
            for (i=1;i<=n;i++) dis[i]=-1e9;
            dis[qt]=0;
            for (i=qt-1;i>=1;i--) for (auto g: gt[i]) dis[i]=max(dis[i],dis[g]+1);
            u=-1e9;
            for (i=1;i<=qt;i++) if (!qc[i]) u=max(u,dis[i]);
        } else {
            u=-1e9;
            for (auto g : lowest[qt]) if (!qc[g.se]) {
                u=max(u,g.fi);
            } 
        }
        if (u<0) cout<<-1<<endl;
        else cout<<u<<endl;
        for (j=0;j<qy;j++) {
            qc[vec[j]]=0;
        }
    }
}
// Normie28;

Compilation message (stderr)

bitaro.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

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