Submission #936126

#	Time	Username	Problem	Language	Result	Execution time	Memory
936126		Baizho	Bitaro’s Party (JOI18_bitaro)	C++14	14 / 100	76 ms	19676 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;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, m, q, dis[N];
vector<int> g[N], gr[N];
vector<int> del;

void calc(int r) {
	int p = 0;
	for(int i = 1; i <= r; i ++) {
		dis[i] = 0;
		for(auto to : gr[i]) {
			dis[i] = max(dis[to] + 1, dis[i]);
		}
		if(p < del.size() && i == del[p]) {
			if(dis[i] == 0) dis[i] = -1;
			p ++;
		}  
	}
}

void Baizho() {
	cin>>n>>m>>q;
	int block = 316;
	for(int i = 1; i <= m; i ++) {
		int u, v; cin>>u>>v;
		// always u < v so like people can go to party where town_people <= town_party
		g[u].pb(v);
		// reverse need so we can have ideas of reverse like max distance from party to people where town_party >= town_people
		gr[v].pb(u);
	} 
	for(int i = 1; i <= q; i ++) {
		int t, y; cin>>t>>y;
		for(int j = 0; j < y; j ++) {
			int c; cin>>c;
			del.pb(c);
		}
		if(y >= block || q == 1) {
			calc(t);
			cout<<dis[t]<<"\n";
			return;
		}
	}
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

bitaro.cpp: In function 'void calc(int)':
bitaro.cpp:48:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   if(p < del.size() && i == del[p]) {
      |      ~~^~~~~~~~~~~~
bitaro.cpp: In function 'void Freopen(std::string)':
bitaro.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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