제출 #1279063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1279063		thelegendary08	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	63 ms	25980 KiB

bitaro

#include<bits/stdc++.h>
// #include<atcoder/modint>
#define pb push_back
#define mp make_pair
#define rs resize
#define ft front()
#define bk back()
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define r0f(i,n) for(int i = n-1; i >= 0; i--)
#define R0F(i,k,n) for(int i = n-1; i >= k; i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
#define p2(x) (1LL << (x))
#define pct(x) (__builtin_popcountll(x))
#define ist(x,y) ((x >> y) & 1)
template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; } 
template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; } 
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
// using namespace atcoder; 
// using mint = modint998244353;
const int mxn = 1e5 + 5, B = 300; 
vi adj[mxn]; set<pii> f[mxn]; 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,q); f0r(i,m){in2(a,b); a--; b--; adj[a].pb(b);}
	f0r(i,n){
		f[i].insert(mp(0, i)); while(f[i].size() > B)f[i].erase(--f[i].end()); 
		for(auto v : adj[i]){
			for(auto [a,b] : f[i])f[v].insert(mp(a-1, b));
		}
	}
	
	// f0r(i, n){
		// for(auto u : f[i])pout(u); 
		// cout<<'\n';
	// }
	
	f0r(tt, q){
		in2(s, t); set<int>w; s--; f0r(i, t){in(x); x--; w.insert(x);} int ans = -1;
		for(auto &u : f[s]){
			if(!w.count(u.second)){ans = -u.first; break;}
		}
		if(ans != -1){out(ans); continue;}
		if(ans == -1 && f[s].size() < B){out(ans); continue;}
		vi dst(s+1, -4e18); f0r(i, s+1){
			if(!w.count(i))ckmax(dst[i], 0);
			for(auto u : adj[i])if(u <= s)ckmax(dst[u], dst[i]);
		} 
		if(dst[s] < 0)out(-1);
		else out(dst[s]);
	}
}

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