oj.uz

Submission #564888

# Submission time Handle Problem Language Result Execution time Memory
564888 2022-05-19T22:49:48 Z Bungmint Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1845 ms 446256 KB 
// Copyright © 2022 Youngmin Park. All rights reserved.
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define all(v) (v).begin(), (v).end()
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound

constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
const ld PI = acos((ld)-1.0);
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
constexpr bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
constexpr bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
	return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
	os << '{';
	string sep;
	for (const T &x : v)
		os << sep << x, sep = ", ";
	return os << '}';
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &v) {
	os << vector<T>(all(v));
	return os;
}
template <typename T, typename S, typename C>
ostream &operator<<(ostream &os, priority_queue<T, S, C> pq) {
	vector<T> v;
	while (sz(pq)) {
		v.pb(pq.top());
		pq.pop();
	}
	os << v;
	return os;
}
void dbg_out()
{
	cerr << "\033[0m" << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
	cerr << ' ' << H;
	dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "\033[1;35m(" << #__VA_ARGS__ << "):\033[33m", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

inline namespace RecursiveLambda
{
	template <typename Fun>
	struct y_combinator_result
	{
		Fun fun_;
		template <typename T>
		explicit y_combinator_result(T &&fun) : fun_(forward<T>(fun)) {}
		template <typename... Args>
		decltype(auto) operator()(Args &&...args)
		{
			return fun_(ref(*this), forward<Args>(args)...);
		}
	};
	template <typename Fun>
	decltype(auto) y_combinator(Fun &&fun)
	{
		return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
	}
};

inline namespace Range {
	class ForwardRange {
		int src, dst;

	  public:
	  	explicit constexpr ForwardRange(const int l, const int r) : src(l), dst(r) {}
		explicit constexpr ForwardRange(const int n) : src(0), dst(n) {}
		constexpr ForwardRange begin() const { return *this; }
		constexpr monostate end() const { return {}; }
		constexpr bool operator!=(monostate) const { return src < dst; }
		constexpr void operator++() const {}
		constexpr int operator*() { return src++; }
	};
	class BackwardRange {
		int src, dst;

	  public:
	  	explicit constexpr BackwardRange(const int l, const int r) : src(r), dst(l) {}
		explicit constexpr BackwardRange(const int n) : src(n), dst(0) {}
		constexpr BackwardRange begin() const { return *this; }
		constexpr monostate end() const { return {}; }
		constexpr bool operator!=(monostate) const { return src > dst; }
		constexpr void operator++() const {}
		constexpr int operator*() { return --src; }
	};
	using rep = ForwardRange;
	using per = BackwardRange;
};

constexpr int N = 1e5 + 10;
constexpr int SQ = 320;
int n, m, q;
vi adj[N], radj[N], queries[N];
bitset<N> busy, used;
int t[N], DP[N];
vpi dp[N];

void solve()
{
	cin >> n >> m >> q;
	for (int i : rep(m)) {
		int u, v;
		cin >> u >> v, u--, v--;
		adj[u].pb(v), radj[v].pb(u);
	}
	for (int i : rep(n)) {
		vpi tmp = {{i, -1}};
		for (int j : radj[i]) {
			tmp.insert(tmp.end(), all(dp[j]));
		}
		sort(all(tmp), [&](auto x, auto y) {
			return x.se > y.se;
		});
		dbg(i, tmp);
		for (auto j : rep(sz(tmp))) {
			auto [v, d] = tmp[j];
			if (sz(dp[i]) >= SQ) {
				break;
			}
			if (!used[v]) {
				used[v] = 1;
				dp[i].pb({v, d + 1});
			}
		}
		for (auto [v, d] : dp[i]) used[v] = 0;
	}
	auto naiveDP = [&](int t, vi& C) -> int {
		for (int i : rep(n)) DP[i] = 0;
		for (int i : C) DP[i] = -1;
		for (int i : rep(t + 1)) {
			for (int j : radj[i]) {
				if (DP[j] >= 0) ckmax(DP[i], DP[j] + 1);
			}
		}
		return DP[t];
	};
	for (int i : rep(q)) {
		cin >> t[i];
		t[i]--;
		int x;
		cin >> x;
		queries[i].resize(x);
		for (auto &e : queries[i]) cin >> e, e--, busy[e] = 1;
		if (x >= SQ) {
			cout << naiveDP(t[i], queries[i]) << '\n';
		}else{
			int ans = -1;
			for (auto &[v, d] : dp[t[i]]) {
				if (!busy[v]) ckmax(ans, d);
			}
			cout << ans << '\n';
		}
		for (auto &e : queries[i]) busy[e] = 0;
	}
}

int main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int testcase = 1;
	// cin >> testcase;
	while (testcase--)
	{
		solve();
	}
#ifdef LOCAL
	cerr << "Time elapsed: " << 1.0 * (double)clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}

Compilation message

bitaro.cpp: In function 'void solve()':
bitaro.cpp:144:11: warning: unused variable 'i' [-Wunused-variable]
  144 |  for (int i : rep(m)) {
      |           ^
bitaro.cpp:80:18: warning: statement has no effect [-Wunused-value]
   80 | #define dbg(...) 42
      |                  ^~
bitaro.cpp:157:3: note: in expansion of macro 'dbg'
  157 |   dbg(i, tmp);
      |   ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9732 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 9 ms 10268 KB Output is correct
6 Correct 9 ms 10196 KB Output is correct
7 Correct 8 ms 10196 KB Output is correct
8 Correct 24 ms 13396 KB Output is correct
9 Correct 21 ms 13396 KB Output is correct
10 Correct 21 ms 13396 KB Output is correct
11 Correct 19 ms 12944 KB Output is correct
12 Correct 12 ms 11092 KB Output is correct
13 Correct 20 ms 12780 KB Output is correct
14 Correct 17 ms 11876 KB Output is correct
15 Correct 11 ms 10964 KB Output is correct
16 Correct 16 ms 11860 KB Output is correct
17 Correct 16 ms 12084 KB Output is correct
18 Correct 12 ms 11092 KB Output is correct
19 Correct 16 ms 12128 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9732 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 9 ms 10268 KB Output is correct
6 Correct 9 ms 10196 KB Output is correct
7 Correct 8 ms 10196 KB Output is correct
8 Correct 24 ms 13396 KB Output is correct
9 Correct 21 ms 13396 KB Output is correct
10 Correct 21 ms 13396 KB Output is correct
11 Correct 19 ms 12944 KB Output is correct
12 Correct 12 ms 11092 KB Output is correct
13 Correct 20 ms 12780 KB Output is correct
14 Correct 17 ms 11876 KB Output is correct
15 Correct 11 ms 10964 KB Output is correct
16 Correct 16 ms 11860 KB Output is correct
17 Correct 16 ms 12084 KB Output is correct
18 Correct 12 ms 11092 KB Output is correct
19 Correct 16 ms 12128 KB Output is correct
20 Correct 1503 ms 17512 KB Output is correct
21 Correct 1540 ms 17360 KB Output is correct
22 Correct 1473 ms 17772 KB Output is correct
23 Correct 1460 ms 20192 KB Output is correct
24 Correct 1146 ms 264672 KB Output is correct
25 Correct 1198 ms 279960 KB Output is correct
26 Correct 1210 ms 279764 KB Output is correct
27 Correct 1732 ms 444956 KB Output is correct
28 Correct 1664 ms 445156 KB Output is correct
29 Correct 1740 ms 444844 KB Output is correct
30 Correct 1812 ms 443696 KB Output is correct
31 Correct 1572 ms 428220 KB Output is correct
32 Correct 1796 ms 443644 KB Output is correct
33 Correct 1336 ms 274304 KB Output is correct
34 Correct 977 ms 224256 KB Output is correct
35 Correct 1227 ms 272440 KB Output is correct
36 Correct 1580 ms 360304 KB Output is correct
37 Correct 1234 ms 325276 KB Output is correct
38 Correct 1509 ms 361636 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9732 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 9 ms 10268 KB Output is correct
6 Correct 9 ms 10196 KB Output is correct
7 Correct 8 ms 10196 KB Output is correct
8 Correct 24 ms 13396 KB Output is correct
9 Correct 21 ms 13396 KB Output is correct
10 Correct 21 ms 13396 KB Output is correct
11 Correct 19 ms 12944 KB Output is correct
12 Correct 12 ms 11092 KB Output is correct
13 Correct 20 ms 12780 KB Output is correct
14 Correct 17 ms 11876 KB Output is correct
15 Correct 11 ms 10964 KB Output is correct
16 Correct 16 ms 11860 KB Output is correct
17 Correct 16 ms 12084 KB Output is correct
18 Correct 12 ms 11092 KB Output is correct
19 Correct 16 ms 12128 KB Output is correct
20 Correct 1503 ms 17512 KB Output is correct
21 Correct 1540 ms 17360 KB Output is correct
22 Correct 1473 ms 17772 KB Output is correct
23 Correct 1460 ms 20192 KB Output is correct
24 Correct 1146 ms 264672 KB Output is correct
25 Correct 1198 ms 279960 KB Output is correct
26 Correct 1210 ms 279764 KB Output is correct
27 Correct 1732 ms 444956 KB Output is correct
28 Correct 1664 ms 445156 KB Output is correct
29 Correct 1740 ms 444844 KB Output is correct
30 Correct 1812 ms 443696 KB Output is correct
31 Correct 1572 ms 428220 KB Output is correct
32 Correct 1796 ms 443644 KB Output is correct
33 Correct 1336 ms 274304 KB Output is correct
34 Correct 977 ms 224256 KB Output is correct
35 Correct 1227 ms 272440 KB Output is correct
36 Correct 1580 ms 360304 KB Output is correct
37 Correct 1234 ms 325276 KB Output is correct
38 Correct 1509 ms 361636 KB Output is correct
39 Correct 1218 ms 272060 KB Output is correct
40 Correct 1171 ms 272996 KB Output is correct
41 Correct 1150 ms 275728 KB Output is correct
42 Correct 1218 ms 275200 KB Output is correct
43 Correct 1144 ms 274328 KB Output is correct
44 Correct 1562 ms 20608 KB Output is correct
45 Correct 1451 ms 19264 KB Output is correct
46 Correct 1432 ms 19348 KB Output is correct
47 Correct 1449 ms 19344 KB Output is correct
48 Correct 1411 ms 19008 KB Output is correct
49 Correct 1706 ms 446048 KB Output is correct
50 Correct 1644 ms 444120 KB Output is correct
51 Correct 1597 ms 20316 KB Output is correct
52 Correct 1503 ms 18924 KB Output is correct
53 Correct 1623 ms 359632 KB Output is correct
54 Correct 1307 ms 326056 KB Output is correct
55 Correct 1550 ms 358664 KB Output is correct
56 Correct 1272 ms 326544 KB Output is correct
57 Correct 1558 ms 20460 KB Output is correct
58 Correct 1491 ms 21572 KB Output is correct
59 Correct 1473 ms 19060 KB Output is correct
60 Correct 1454 ms 20212 KB Output is correct
61 Correct 1584 ms 445236 KB Output is correct
62 Correct 1670 ms 360880 KB Output is correct
63 Correct 1345 ms 324808 KB Output is correct
64 Correct 1717 ms 444968 KB Output is correct
65 Correct 1785 ms 359260 KB Output is correct
66 Correct 1497 ms 327276 KB Output is correct
67 Correct 1652 ms 444232 KB Output is correct
68 Correct 1506 ms 360116 KB Output is correct
69 Correct 1215 ms 322228 KB Output is correct
70 Correct 1547 ms 445088 KB Output is correct
71 Correct 1593 ms 361076 KB Output is correct
72 Correct 1256 ms 326292 KB Output is correct
73 Correct 1567 ms 445312 KB Output is correct
74 Correct 1589 ms 361072 KB Output is correct
75 Correct 1271 ms 325988 KB Output is correct
76 Correct 1710 ms 446256 KB Output is correct
77 Correct 1693 ms 444620 KB Output is correct
78 Correct 1555 ms 445484 KB Output is correct
79 Correct 1573 ms 20532 KB Output is correct
80 Correct 1472 ms 19288 KB Output is correct
81 Correct 1485 ms 19120 KB Output is correct
82 Correct 1845 ms 444996 KB Output is correct
83 Correct 1648 ms 429508 KB Output is correct
84 Correct 1663 ms 443432 KB Output is correct
85 Correct 1597 ms 427544 KB Output is correct
86 Correct 1631 ms 443880 KB Output is correct
87 Correct 1402 ms 429348 KB Output is correct
88 Correct 1533 ms 20532 KB Output is correct
89 Correct 1537 ms 20436 KB Output is correct
90 Correct 1478 ms 19272 KB Output is correct
91 Correct 1424 ms 19364 KB Output is correct
92 Correct 1434 ms 19108 KB Output is correct
93 Correct 1443 ms 19048 KB Output is correct
94 Correct 1332 ms 275672 KB Output is correct
95 Correct 1056 ms 223664 KB Output is correct
96 Correct 1260 ms 272568 KB Output is correct
97 Correct 957 ms 227460 KB Output is correct
98 Correct 1255 ms 274392 KB Output is correct
99 Correct 903 ms 226816 KB Output is correct
100 Correct 1533 ms 22252 KB Output is correct
101 Correct 1449 ms 22228 KB Output is correct
102 Correct 1438 ms 21708 KB Output is correct
103 Correct 1391 ms 22444 KB Output is correct
104 Correct 1481 ms 21624 KB Output is correct
105 Correct 1383 ms 22272 KB Output is correct
106 Correct 1541 ms 360424 KB Output is correct
107 Correct 1264 ms 326308 KB Output is correct
108 Correct 1473 ms 361484 KB Output is correct
109 Correct 1228 ms 325248 KB Output is correct
110 Correct 1520 ms 361960 KB Output is correct
111 Correct 1211 ms 326844 KB Output is correct
112 Correct 1436 ms 20440 KB Output is correct
113 Correct 1406 ms 20560 KB Output is correct
114 Correct 1418 ms 19180 KB Output is correct
115 Correct 1358 ms 20380 KB Output is correct
116 Correct 1352 ms 18928 KB Output is correct
117 Correct 1353 ms 20332 KB Output is correct
118 Correct 1592 ms 444196 KB Output is correct
119 Correct 1471 ms 361164 KB Output is correct
120 Correct 1155 ms 325500 KB Output is correct
121 Correct 1580 ms 444412 KB Output is correct
122 Correct 1567 ms 359384 KB Output is correct
123 Correct 1193 ms 325472 KB Output is correct
124 Correct 1567 ms 444396 KB Output is correct
125 Correct 1459 ms 361072 KB Output is correct
126 Correct 1177 ms 324076 KB Output is correct