oj.uz

Submission #95051

# Submission time Handle Problem Language Result Execution time Memory
95051 2019-01-27T07:19:30 Z ckodser Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 422740 KB 
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
using namespace std;
const int N = 100745, SQ = 379;
int n, m, q, dp[N], M[N], mark[N];
vector < int > in[N], out[N];
vector < pair < int , int > > best[N];
void DFS(int v)
{
	M[v] = 1;
	for (int &u : out[v])
	{
		if (!M[u])
			DFS(u);
		dp[v] = max(dp[v], dp[u] + 1);
	}
}
inline int Brute(int v, vector < int > vec)
{
	memset(M, 0, sizeof(M));
	memset(dp, -63, sizeof(dp));
	M[v] = 1; dp[v] = 0;
	for (int i = 1; i < v; i++)
		if (!M[i]) DFS(i);

	for (int &u : vec)
		M[u] = 2;

	int Mx = -1;
	for (int i = 1; i <= v; i++)
		if (M[i] != 2)
			Mx = max(Mx, dp[i]);
	return (Mx);
}
int main()
{
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= m; i++)
	{
		int v, u;
		scanf("%d%d", &v, &u);
		out[v].pb(u);
		in[u].pb(v);
	}

	for (int v = 1; v <= n; v++)
	{
		in[v].pb(0);
		best[0] = {{-1, v}};

		int d = (int)in[v].size();

		vector < int > ptr(d, 0);

		for (int j = 0; j < SQ; j++)
		{
			int id = -1;
			pair < int , int > Mx = {-1, -1};
			for (int i = 0; i < d; i++)
			{
				int &u = in[v][i];
				if (ptr[i] == (int)best[u].size())
					continue;

				if (Mx.first < best[u][ptr[i]].first + 1)
				{
					Mx = best[u][ptr[i]];
					Mx.first ++;
					id = i;
				}
			}
			if (id == -1)
				break;

			ptr[id] ++;
			best[v].pb(Mx);
		}
	}

	for (int ts = 1; ts <= q; ts ++)
	{
		int v, len;
		vector < int > vec;
		scanf("%d%d", &v, &len);
		vec.resize(len);
		for (int i = 0; i < len; i++)
		{
			scanf("%d", &vec[i]);
			mark[vec[i]] = ts;
		}

		if (vec.size() >= SQ - 2)
		{
			printf("%d\n", Brute(v, vec));
			continue;
		}

		int Mx = -1;
		for (auto X : best[v])
		{
			if (mark[X.second] < ts)
			{
				Mx = X.first;
				break;
			}
		}
		printf("%d\n", Mx);
	}
	return 0;
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &m, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &v, &u);
   ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &v, &len);
   ~~~~~^~~~~~~~~~~~~~~~~~
bitaro.cpp:90:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &vec[i]);
    ~~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 15 ms 10744 KB Output is correct
6 Correct 13 ms 10360 KB Output is correct
7 Correct 13 ms 10360 KB Output is correct
8 Correct 17 ms 12280 KB Output is correct
9 Correct 18 ms 12280 KB Output is correct
10 Correct 17 ms 12280 KB Output is correct
11 Correct 16 ms 12024 KB Output is correct
12 Correct 15 ms 11000 KB Output is correct
13 Correct 17 ms 12152 KB Output is correct
14 Correct 14 ms 10232 KB Output is correct
15 Correct 12 ms 9336 KB Output is correct
16 Correct 14 ms 10232 KB Output is correct
17 Correct 16 ms 11256 KB Output is correct
18 Correct 14 ms 9976 KB Output is correct
19 Correct 16 ms 11256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 15 ms 10744 KB Output is correct
6 Correct 13 ms 10360 KB Output is correct
7 Correct 13 ms 10360 KB Output is correct
8 Correct 17 ms 12280 KB Output is correct
9 Correct 18 ms 12280 KB Output is correct
10 Correct 17 ms 12280 KB Output is correct
11 Correct 16 ms 12024 KB Output is correct
12 Correct 15 ms 11000 KB Output is correct
13 Correct 17 ms 12152 KB Output is correct
14 Correct 14 ms 10232 KB Output is correct
15 Correct 12 ms 9336 KB Output is correct
16 Correct 14 ms 10232 KB Output is correct
17 Correct 16 ms 11256 KB Output is correct
18 Correct 14 ms 9976 KB Output is correct
19 Correct 16 ms 11256 KB Output is correct
20 Correct 210 ms 14596 KB Output is correct
21 Correct 205 ms 14788 KB Output is correct
22 Correct 209 ms 14684 KB Output is correct
23 Correct 219 ms 14712 KB Output is correct
24 Correct 1018 ms 329336 KB Output is correct
25 Correct 1006 ms 329780 KB Output is correct
26 Correct 916 ms 329932 KB Output is correct
27 Correct 886 ms 422412 KB Output is correct
28 Correct 968 ms 422740 KB Output is correct
29 Correct 991 ms 422648 KB Output is correct
30 Correct 978 ms 419008 KB Output is correct
31 Correct 914 ms 408824 KB Output is correct
32 Correct 972 ms 418680 KB Output is correct
33 Correct 712 ms 261752 KB Output is correct
34 Correct 612 ms 215160 KB Output is correct
35 Correct 650 ms 259816 KB Output is correct
36 Correct 850 ms 343544 KB Output is correct
37 Correct 817 ms 315512 KB Output is correct
38 Correct 834 ms 343840 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 15 ms 10744 KB Output is correct
6 Correct 13 ms 10360 KB Output is correct
7 Correct 13 ms 10360 KB Output is correct
8 Correct 17 ms 12280 KB Output is correct
9 Correct 18 ms 12280 KB Output is correct
10 Correct 17 ms 12280 KB Output is correct
11 Correct 16 ms 12024 KB Output is correct
12 Correct 15 ms 11000 KB Output is correct
13 Correct 17 ms 12152 KB Output is correct
14 Correct 14 ms 10232 KB Output is correct
15 Correct 12 ms 9336 KB Output is correct
16 Correct 14 ms 10232 KB Output is correct
17 Correct 16 ms 11256 KB Output is correct
18 Correct 14 ms 9976 KB Output is correct
19 Correct 16 ms 11256 KB Output is correct
20 Correct 210 ms 14596 KB Output is correct
21 Correct 205 ms 14788 KB Output is correct
22 Correct 209 ms 14684 KB Output is correct
23 Correct 219 ms 14712 KB Output is correct
24 Correct 1018 ms 329336 KB Output is correct
25 Correct 1006 ms 329780 KB Output is correct
26 Correct 916 ms 329932 KB Output is correct
27 Correct 886 ms 422412 KB Output is correct
28 Correct 968 ms 422740 KB Output is correct
29 Correct 991 ms 422648 KB Output is correct
30 Correct 978 ms 419008 KB Output is correct
31 Correct 914 ms 408824 KB Output is correct
32 Correct 972 ms 418680 KB Output is correct
33 Correct 712 ms 261752 KB Output is correct
34 Correct 612 ms 215160 KB Output is correct
35 Correct 650 ms 259816 KB Output is correct
36 Correct 850 ms 343544 KB Output is correct
37 Correct 817 ms 315512 KB Output is correct
38 Correct 834 ms 343840 KB Output is correct
39 Correct 1076 ms 322780 KB Output is correct
40 Correct 1000 ms 326648 KB Output is correct
41 Correct 940 ms 326468 KB Output is correct
42 Execution timed out 2073 ms 327300 KB Time limit exceeded
43 Halted 0 ms 0 KB -