oj.uz

Submission #94446

# Submission time Handle Problem Language Result Execution time Memory
94446 2019-01-18T15:08:38 Z aminra Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 973 ms 320504 KB 
//Smaug never desolated!!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = (int)100007;
const int block = 400;
const int infint = (int)1e8 + 3;
const int MOD = (int)1e9 + 7;
const ll inf = (ll)1e18;
int n, m, q, bad[MAXN], dp[MAXN], input[MAXN];
pair<int, int> DP[MAXN][block], tmp[block];
vector<int> in[MAXN];
bool cmp(pair<int, int> a, pair<int, int> b)
{
	return a.second > b.second;
}
inline void merge(int a, int b)
{
	for (int i = 0; i < block; i++)
		tmp[i] = {-1, -1};
	int ptr1 = 0, ptr2 = 0;
	while(ptr1 + ptr2 < block)
	{
		pair<int, int> B = DP[b][ptr2];
		if(B.second != -1)
			B.second++;
		if(cmp(DP[a][ptr1], B))
			tmp[ptr1 + ptr2] = DP[a][ptr1], ptr1++;
		else
			tmp[ptr1 + ptr2] = B, ptr2++;
	}
	for (int i = 0; i < block; i++)
		DP[a][i] = tmp[i];
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m >> q;
	for (int i = 0; i < m; i++)
	{
		int u, v;
		cin >> u >> v;
		in[v].push_back(u);
	}
	for (int i = 1; i <= n; i++)
		for (int j = 0; j < block; j++)
			DP[i][j] = {-1, -1};
	DP[1][0] = {1, 0};
	for (int i = 2; i <= n; i++)
	{
		DP[i][0] = {i, 0};
		for (auto u : in[i])
			merge(i, u);
	}
	for (int i = 0; i < q; i++)
	{
		int v, t;
		cin >> v >> t;
		for (int i = 0; i < t; i++)
		{
			cin >> input[i];
			bad[input[i]] = 1;
		}
		//answer query.
		if(t >= block)
		{
			memset(dp, -1, sizeof dp);
			dp[v] = 0;
			for (int i = v; i >= 1; i--)
				if(dp[i] != -1)
					for (auto u : in[i])
						dp[u] = max(dp[u], dp[i] + 1);
			int ans = -1;
			for (int i = v; i >= 1; i--)
				if(!bad[i])
					ans = max(ans, dp[i]);
			cout << ans << "\n";
		}
		else
		{
			int ans = -1;
			for (int i = block - 1; i >= 0; i--)
				if(DP[v][i].first != -1 && !bad[DP[v][i].first])
					ans = DP[v][i].second;
			cout << ans << "\n";
		}
		//
		for (int i = 0; i < t; i++)
			bad[input[i]] = 0;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2676 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 10 ms 6264 KB Output is correct
6 Correct 10 ms 6264 KB Output is correct
7 Correct 10 ms 6264 KB Output is correct
8 Correct 10 ms 6264 KB Output is correct
9 Correct 10 ms 6264 KB Output is correct
10 Correct 10 ms 6264 KB Output is correct
11 Correct 10 ms 6264 KB Output is correct
12 Correct 10 ms 6268 KB Output is correct
13 Correct 10 ms 6264 KB Output is correct
14 Correct 10 ms 6264 KB Output is correct
15 Correct 11 ms 6264 KB Output is correct
16 Correct 10 ms 6264 KB Output is correct
17 Correct 9 ms 6264 KB Output is correct
18 Correct 9 ms 6264 KB Output is correct
19 Correct 10 ms 6264 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2676 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 10 ms 6264 KB Output is correct
6 Correct 10 ms 6264 KB Output is correct
7 Correct 10 ms 6264 KB Output is correct
8 Correct 10 ms 6264 KB Output is correct
9 Correct 10 ms 6264 KB Output is correct
10 Correct 10 ms 6264 KB Output is correct
11 Correct 10 ms 6264 KB Output is correct
12 Correct 10 ms 6268 KB Output is correct
13 Correct 10 ms 6264 KB Output is correct
14 Correct 10 ms 6264 KB Output is correct
15 Correct 11 ms 6264 KB Output is correct
16 Correct 10 ms 6264 KB Output is correct
17 Correct 9 ms 6264 KB Output is correct
18 Correct 9 ms 6264 KB Output is correct
19 Correct 10 ms 6264 KB Output is correct
20 Correct 321 ms 7644 KB Output is correct
21 Correct 306 ms 7660 KB Output is correct
22 Correct 313 ms 7672 KB Output is correct
23 Correct 311 ms 7572 KB Output is correct
24 Correct 699 ms 320016 KB Output is correct
25 Correct 645 ms 320016 KB Output is correct
26 Correct 689 ms 319792 KB Output is correct
27 Correct 620 ms 320504 KB Output is correct
28 Correct 596 ms 320476 KB Output is correct
29 Correct 592 ms 320120 KB Output is correct
30 Correct 595 ms 320304 KB Output is correct
31 Correct 712 ms 320288 KB Output is correct
32 Correct 594 ms 320120 KB Output is correct
33 Correct 611 ms 319992 KB Output is correct
34 Correct 663 ms 319724 KB Output is correct
35 Correct 667 ms 319732 KB Output is correct
36 Correct 675 ms 319964 KB Output is correct
37 Correct 663 ms 319864 KB Output is correct
38 Correct 685 ms 319636 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2676 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 10 ms 6264 KB Output is correct
6 Correct 10 ms 6264 KB Output is correct
7 Correct 10 ms 6264 KB Output is correct
8 Correct 10 ms 6264 KB Output is correct
9 Correct 10 ms 6264 KB Output is correct
10 Correct 10 ms 6264 KB Output is correct
11 Correct 10 ms 6264 KB Output is correct
12 Correct 10 ms 6268 KB Output is correct
13 Correct 10 ms 6264 KB Output is correct
14 Correct 10 ms 6264 KB Output is correct
15 Correct 11 ms 6264 KB Output is correct
16 Correct 10 ms 6264 KB Output is correct
17 Correct 9 ms 6264 KB Output is correct
18 Correct 9 ms 6264 KB Output is correct
19 Correct 10 ms 6264 KB Output is correct
20 Correct 321 ms 7644 KB Output is correct
21 Correct 306 ms 7660 KB Output is correct
22 Correct 313 ms 7672 KB Output is correct
23 Correct 311 ms 7572 KB Output is correct
24 Correct 699 ms 320016 KB Output is correct
25 Correct 645 ms 320016 KB Output is correct
26 Correct 689 ms 319792 KB Output is correct
27 Correct 620 ms 320504 KB Output is correct
28 Correct 596 ms 320476 KB Output is correct
29 Correct 592 ms 320120 KB Output is correct
30 Correct 595 ms 320304 KB Output is correct
31 Correct 712 ms 320288 KB Output is correct
32 Correct 594 ms 320120 KB Output is correct
33 Correct 611 ms 319992 KB Output is correct
34 Correct 663 ms 319724 KB Output is correct
35 Correct 667 ms 319732 KB Output is correct
36 Correct 675 ms 319964 KB Output is correct
37 Correct 663 ms 319864 KB Output is correct
38 Correct 685 ms 319636 KB Output is correct
39 Correct 973 ms 319860 KB Output is correct
40 Correct 731 ms 319372 KB Output is correct
41 Correct 771 ms 319316 KB Output is correct
42 Correct 671 ms 319608 KB Output is correct
43 Correct 648 ms 319736 KB Output is correct
44 Incorrect 377 ms 7800 KB Output isn't correct
45 Halted 0 ms 0 KB -