제출 #349490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349490		Return_0	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	908 ms	173292 KiB

bitaro

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
// #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx,avx2,fma")
 
using namespace std;
using namespace __gnu_pbds;
 
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
 
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1);
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
 
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
 
template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
	return out << '(' << a.first << ", " << a.second << ')';    }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	if(!a.size())return cout<<"[]";cout<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) cout<< ", " << a[i];cout<< ']';  }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
 
cl N = 1e5 + 7, SQ = 200;
 
ll dis [N], n, m, q, ans;
vector <ll> adj [N], jda [N], vec;
vector <pll> dp [N];
bool mark [N];

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
 
	cin>> n >> m >> q;
	for (ll i = 0, v, u; i < m; i++) cin>> v >> u, adj[u].push_back(v), jda[v].push_back(u);
 
	for (ll i = 1; i <= n; i++) {
		dp[i] = {{0, i}};
		for (auto u : adj[i]) {
			vector <pll> tmp = dp[u], res; res.clear();
			for (auto &x : tmp) x.fr++;
			merge(All(dp[i]), All(tmp), back_inserter(res), greater<pll>());
			res.resize(unique(All(res)) - res.begin());
			if (SZ(res) > SQ)	res.resize(SQ);
			dp[i] = res;
		}
	}
 
	for (ll v, t, i; q--;) {
		ans = -1;
		cin>> v >> t;
		vec.resize(t); for (auto &x : vec)	cin>> x, mark[x] = 1;
		if (t < SQ - 1) {
			for (auto &x : dp[v])	if (!mark[x.sc])	ans = max(ans, x.fr);
			cout<< ans << '\n';
		} else {
			memset(dis, -61, sizeof dis);
			for (auto &u : vec) mark[u] = true;
			dis[v] = 0;
			for (ll x = v; x >= 1; x--) {
				for (auto &u : jda[x])	dis[x] = max(dis[x], dis[u] + 1);
				if (!mark[x])	ans = max(ans, dis[x]);
			}
			cout<< ans << '\n';
		}
		for (auto &x : vec)	mark[x] = 0;
	}
 
	return 0;
}
/*
4 5 1
1 2
1 3
2 3
2 4
3 4
3 1 4

*/

컴파일 시 표준 에러 (stderr) 메시지

bitaro.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
bitaro.cpp:43:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   43 |  if(!a.size())return cout<<"[]";cout<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) cout<< ", " << a[i];cout<< ']';  }
      |  ^~
bitaro.cpp:43:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   43 |  if(!a.size())return cout<<"[]";cout<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) cout<< ", " << a[i];cout<< ']';  }
      |                                 ^~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:72:16: warning: unused variable 'i' [-Wunused-variable]
   72 |  for (ll v, t, i; q--;) {
      |                ^

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