Submission #418932

#TimeUsernameProblemLanguageResultExecution timeMemory
418932codebuster_10Bitaro’s Party (JOI18_bitaro)C++17
14 / 100
793 ms263692 KiB
#include <bits/stdc++.h> using namespace std ; #define int int64_t //be careful about this #define endl "\n" #define f(i,a,b) for(int i=int(a);i<int(b);++i) #define pr pair #define ar array #define fr first #define sc second #define vt vector #define pb push_back #define eb emplace_back #define LB lower_bound #define UB upper_bound #define PQ priority_queue #define sz(x) ((int)(x).size()) #define all(a) (a).begin(),(a).end() #define allr(a) (a).rbegin(),(a).rend() #define mem(a,b) memset(a, b, sizeof(a)) template<class A> void rd(vt<A>& v); template<class T> void rd(T& x){ cin >> x; } template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;} template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;} template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template<typename T> void __p(T a) { cout<<a; } template<typename T, typename F> void __p(pair<T, F> a) { cout<<"{"; __p(a.first); cout<<","; __p(a.second); cout<<"}\n"; } template<typename T> void __p(std::vector<T> a) { cout<<"{"; for(auto it=a.begin(); it<a.end(); it++) __p(*it),cout<<",}\n"[it+1==a.end()]; } template<typename T, typename ...Arg> void __p(T a1, Arg ...a) { __p(a1); __p(a...); } template<typename Arg1> void __f(const char *name, Arg1 &&arg1) { cout<<name<<" : "; __p(arg1); cout<<endl; } template<typename Arg1, typename ... Args> void __f(const char *names, Arg1 &&arg1, Args &&... args) { int bracket=0,i=0; for(;; i++) if(names[i]==','&&bracket==0) break; else if(names[i]=='(') bracket++; else if(names[i]==')') bracket--; const char *comma=names+i; cout.write(names,comma-names)<<" : "; __p(arg1); cout<<" | "; __f(comma+1,args...); } void setIO(string s = "") { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin.exceptions(cin.failbit); cout.precision(15); cout << fixed; #ifdef ONLINE_JUDGE if(sz(s)){ freopen((s+".in").c_str(),"r",stdin); freopen((s+".out").c_str(),"w",stdout); } #define __f(...) 0 #endif } #undef int const int N = 100000, B = 317, inf = 1e9; pr<int,int> dis[N][B]; // 0 -> dis, 1 -> index pr<int,int> tmp[B]; bool rem[N], rem_nodes[N]; int out[N], dp[N]; signed main(){ setIO(); f(i,0,N) f(j,0,B) dis[i][j] = {-inf,-1}; mem(rem,false); int N,M,Q; rd(N,M,Q); vt<int> g[N], gt[N]; f(_,0,M){ int u,v; rd(u,v); --u,--v; g[v].pb(u); gt[u].pb(v); } f(i,0,N){ dis[i][0] = {0,i}; for(auto j : g[i]){ int x = 0, y = 0, z = 0; f(k,0,B) tmp[k] = {-inf,-1}; while(z < B){ if(dis[i][x].fr == -inf && dis[j][y].fr == -inf) break; if(dis[i][x].sc == dis[j][y].sc){ tmp[z].fr = max(dis[i][x].fr, dis[j][y].fr + 1); tmp[z].sc = dis[i][x].sc; ++z,++x,++y; }else if(dis[i][x].fr > dis[j][y].fr + 1){ tmp[z] = dis[i][x]; ++z,++x; }else{ tmp[z] = dis[j][y]; ++tmp[z].fr; ++z,++y; } } f(k,0,B) dis[i][k] = tmp[k]; } } f(_,0,Q){ int T,Y; rd(T,Y); --T; vt<int> C(Y); for(auto& i : C) cin >> i, --i; for(auto& i : C) rem[i] = true; if(Y < B){ bool done = false; f(i,0,B){ if(dis[T][i].sc != -1 && !rem[dis[T][i].sc]){ cout << dis[T][i].fr << endl; done = true; break; } } if(!done) cout << -1 << endl; }else{ mem(rem_nodes,false); mem(dp,0); queue<int> q; f(i,0,N){ out[i] = sz(g[i]); if(rem[i] && out[i] == 0){ q.push(i); } } while(sz(q)){ int j = q.front(); q.pop(); dp[j] = -inf; rem_nodes[j] = true; for(auto k : gt[j]){ --out[k]; if(rem[k] && out[k] == 0){ q.push(k); } } } f(i,0,T+1){ if(rem_nodes[i]) continue; for(auto j : g[i]) if(!rem_nodes[j]) ckmax(dp[i],dp[j]+1); } cout << max(int(-1),dp[T]) << endl; } for(auto& i : C) rem[i] = false; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...