oj.uz

Submission #94450

# Submission time Handle Problem Language Result Execution time Memory
94450 2019-01-18T15:58:18 Z aminra Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1151 ms 257528 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 = 320;
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], prv[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)
{
	int sz = 0;
	vector<int> used;
	for (int i = 0; i < block; i++)
		tmp[i] = {-1, -1};
	int ptr1 = 0, ptr2 = 0;
	while(sz < block)
	{
		while(ptr1 < 0 && DP[a][ptr1].first != -1 && prv[DP[a][ptr1].first])
			ptr1++;
		while(ptr2 < 0 && DP[b][ptr2].first != -1 && prv[DP[b][ptr2].first])
			ptr2++;
		pair<int, int> B = {-1, -1};
		if(ptr2 != block && DP[b][ptr2].first != -1)
			B = DP[b][ptr2], B.second++;
		if(cmp(DP[a][ptr1], B))
		{
			tmp[sz] = DP[a][ptr1], ptr1++, sz++;
			int idx = DP[a][ptr1].first;
			if(idx != -1)
				prv[idx] = 1, used.push_back(idx);
		}
		else
		{
			tmp[sz] = B, ptr2++, sz++;
			int idx = B.first;
			if(idx != -1)
				prv[idx] = 1, used.push_back(idx);
		}
	}
	for (int i = 0; i < block; i++)
		DP[a][i] = tmp[i];
	for (auto u : used)
		prv[u] = 0;
}
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;
		}
		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;
	}
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:27:31: warning: array subscript is below array bounds [-Warray-bounds]
   while(ptr1 < 0 && DP[a][ptr1].first != -1 && prv[DP[a][ptr1].first])
                     ~~~~~~~~~~^
bitaro.cpp:29:31: warning: array subscript is below array bounds [-Warray-bounds]
   while(ptr2 < 0 && DP[b][ptr2].first != -1 && prv[DP[b][ptr2].first])
                     ~~~~~~~~~~^

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2680 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2680 KB Output is correct
4 Correct 3 ms 2680 KB Output is correct
5 Correct 11 ms 5596 KB Output is correct
6 Correct 11 ms 5624 KB Output is correct
7 Correct 11 ms 5624 KB Output is correct
8 Correct 11 ms 5624 KB Output is correct
9 Correct 12 ms 5668 KB Output is correct
10 Correct 12 ms 5624 KB Output is correct
11 Correct 13 ms 5624 KB Output is correct
12 Correct 13 ms 5624 KB Output is correct
13 Correct 12 ms 5596 KB Output is correct
14 Correct 12 ms 5628 KB Output is correct
15 Correct 13 ms 5624 KB Output is correct
16 Correct 12 ms 5624 KB Output is correct
17 Correct 12 ms 5624 KB Output is correct
18 Correct 12 ms 5624 KB Output is correct
19 Correct 12 ms 5624 KB Output is correct
20 Correct 642 ms 6868 KB Output is correct
21 Correct 623 ms 6864 KB Output is correct
22 Correct 621 ms 6916 KB Output is correct
23 Correct 635 ms 6776 KB Output is correct
24 Correct 934 ms 257400 KB Output is correct
25 Correct 1002 ms 257388 KB Output is correct
26 Correct 1010 ms 257272 KB Output is correct
27 Correct 953 ms 257400 KB Output is correct
28 Correct 948 ms 257436 KB Output is correct
29 Correct 993 ms 257236 KB Output is correct
30 Correct 960 ms 257528 KB Output is correct
31 Correct 1018 ms 257484 KB Output is correct
32 Correct 985 ms 257268 KB Output is correct
33 Correct 867 ms 257480 KB Output is correct
34 Correct 868 ms 257272 KB Output is correct
35 Correct 852 ms 257272 KB Output is correct
36 Correct 868 ms 257400 KB Output is correct
37 Correct 863 ms 257528 KB Output is correct
38 Correct 890 ms 257396 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2680 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2680 KB Output is correct
4 Correct 3 ms 2680 KB Output is correct
5 Correct 11 ms 5596 KB Output is correct
6 Correct 11 ms 5624 KB Output is correct
7 Correct 11 ms 5624 KB Output is correct
8 Correct 11 ms 5624 KB Output is correct
9 Correct 12 ms 5668 KB Output is correct
10 Correct 12 ms 5624 KB Output is correct
11 Correct 13 ms 5624 KB Output is correct
12 Correct 13 ms 5624 KB Output is correct
13 Correct 12 ms 5596 KB Output is correct
14 Correct 12 ms 5628 KB Output is correct
15 Correct 13 ms 5624 KB Output is correct
16 Correct 12 ms 5624 KB Output is correct
17 Correct 12 ms 5624 KB Output is correct
18 Correct 12 ms 5624 KB Output is correct
19 Correct 12 ms 5624 KB Output is correct
20 Correct 642 ms 6868 KB Output is correct
21 Correct 623 ms 6864 KB Output is correct
22 Correct 621 ms 6916 KB Output is correct
23 Correct 635 ms 6776 KB Output is correct
24 Correct 934 ms 257400 KB Output is correct
25 Correct 1002 ms 257388 KB Output is correct
26 Correct 1010 ms 257272 KB Output is correct
27 Correct 953 ms 257400 KB Output is correct
28 Correct 948 ms 257436 KB Output is correct
29 Correct 993 ms 257236 KB Output is correct
30 Correct 960 ms 257528 KB Output is correct
31 Correct 1018 ms 257484 KB Output is correct
32 Correct 985 ms 257268 KB Output is correct
33 Correct 867 ms 257480 KB Output is correct
34 Correct 868 ms 257272 KB Output is correct
35 Correct 852 ms 257272 KB Output is correct
36 Correct 868 ms 257400 KB Output is correct
37 Correct 863 ms 257528 KB Output is correct
38 Correct 890 ms 257396 KB Output is correct
39 Correct 1151 ms 257400 KB Output is correct
40 Correct 1044 ms 257096 KB Output is correct
41 Correct 1075 ms 257016 KB Output is correct
42 Correct 1033 ms 257268 KB Output is correct
43 Correct 999 ms 257400 KB Output is correct
44 Incorrect 682 ms 6904 KB Output isn't correct
45 Halted 0 ms 0 KB -