oj.uz

Submission #95063

# Submission time Handle Problem Language Result Execution time Memory
95063 2019-01-27T07:34:43 Z ckodser Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1140 ms 420004 KB 
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
using namespace std;
const int N = 100745, SQ = 300;
int n, m, q, dp[N], M[N], mark[N];
vector < int > in[N], out[N];
vector < pair < int , int > > best[N];
inline int Brute(int v, vector < int > vec)
{
	memset(M, 0, sizeof(M));
	memset(dp, -63, sizeof(dp));
	dp[v] = 0;
	for (int i = v - 1; i; i--)
		for (int &u : out[i])
			if (u <= v)
				dp[i] = max(dp[i], dp[u] + 1);
	for (int u : vec)
		M[u] = 1;
	int Mx = -1;
	for (int i = 1; i <= v; i++)
		if (M[i] == 0)
			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);

		while ((int)best[v].size() < SQ)
		{
			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 - 10)
		{
			printf("%d\n", Brute(v, vec));
			continue;
		}

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

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:29: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:33: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:76: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:80: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 7 ms 7396 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 7 ms 7388 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 13 ms 10744 KB Output is correct
6 Correct 14 ms 10332 KB Output is correct
7 Correct 14 ms 10360 KB Output is correct
8 Correct 16 ms 12280 KB Output is correct
9 Correct 15 ms 12280 KB Output is correct
10 Correct 14 ms 12280 KB Output is correct
11 Correct 15 ms 12024 KB Output is correct
12 Correct 12 ms 11000 KB Output is correct
13 Correct 14 ms 12152 KB Output is correct
14 Correct 12 ms 10360 KB Output is correct
15 Correct 11 ms 9336 KB Output is correct
16 Correct 13 ms 10232 KB Output is correct
17 Correct 15 ms 11256 KB Output is correct
18 Correct 13 ms 9976 KB Output is correct
19 Correct 15 ms 11256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7396 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 7 ms 7388 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 13 ms 10744 KB Output is correct
6 Correct 14 ms 10332 KB Output is correct
7 Correct 14 ms 10360 KB Output is correct
8 Correct 16 ms 12280 KB Output is correct
9 Correct 15 ms 12280 KB Output is correct
10 Correct 14 ms 12280 KB Output is correct
11 Correct 15 ms 12024 KB Output is correct
12 Correct 12 ms 11000 KB Output is correct
13 Correct 14 ms 12152 KB Output is correct
14 Correct 12 ms 10360 KB Output is correct
15 Correct 11 ms 9336 KB Output is correct
16 Correct 13 ms 10232 KB Output is correct
17 Correct 15 ms 11256 KB Output is correct
18 Correct 13 ms 9976 KB Output is correct
19 Correct 15 ms 11256 KB Output is correct
20 Correct 172 ms 14616 KB Output is correct
21 Correct 167 ms 14676 KB Output is correct
22 Correct 172 ms 14584 KB Output is correct
23 Correct 191 ms 14584 KB Output is correct
24 Correct 924 ms 329256 KB Output is correct
25 Correct 896 ms 329336 KB Output is correct
26 Correct 827 ms 329352 KB Output is correct
27 Correct 917 ms 419356 KB Output is correct
28 Correct 918 ms 420004 KB Output is correct
29 Correct 902 ms 419832 KB Output is correct
30 Correct 901 ms 419016 KB Output is correct
31 Correct 898 ms 408952 KB Output is correct
32 Correct 902 ms 418940 KB Output is correct
33 Correct 660 ms 261676 KB Output is correct
34 Correct 603 ms 215416 KB Output is correct
35 Correct 676 ms 259596 KB Output is correct
36 Correct 851 ms 343288 KB Output is correct
37 Correct 861 ms 315680 KB Output is correct
38 Correct 806 ms 343540 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7396 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 7 ms 7388 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 13 ms 10744 KB Output is correct
6 Correct 14 ms 10332 KB Output is correct
7 Correct 14 ms 10360 KB Output is correct
8 Correct 16 ms 12280 KB Output is correct
9 Correct 15 ms 12280 KB Output is correct
10 Correct 14 ms 12280 KB Output is correct
11 Correct 15 ms 12024 KB Output is correct
12 Correct 12 ms 11000 KB Output is correct
13 Correct 14 ms 12152 KB Output is correct
14 Correct 12 ms 10360 KB Output is correct
15 Correct 11 ms 9336 KB Output is correct
16 Correct 13 ms 10232 KB Output is correct
17 Correct 15 ms 11256 KB Output is correct
18 Correct 13 ms 9976 KB Output is correct
19 Correct 15 ms 11256 KB Output is correct
20 Correct 172 ms 14616 KB Output is correct
21 Correct 167 ms 14676 KB Output is correct
22 Correct 172 ms 14584 KB Output is correct
23 Correct 191 ms 14584 KB Output is correct
24 Correct 924 ms 329256 KB Output is correct
25 Correct 896 ms 329336 KB Output is correct
26 Correct 827 ms 329352 KB Output is correct
27 Correct 917 ms 419356 KB Output is correct
28 Correct 918 ms 420004 KB Output is correct
29 Correct 902 ms 419832 KB Output is correct
30 Correct 901 ms 419016 KB Output is correct
31 Correct 898 ms 408952 KB Output is correct
32 Correct 902 ms 418940 KB Output is correct
33 Correct 660 ms 261676 KB Output is correct
34 Correct 603 ms 215416 KB Output is correct
35 Correct 676 ms 259596 KB Output is correct
36 Correct 851 ms 343288 KB Output is correct
37 Correct 861 ms 315680 KB Output is correct
38 Correct 806 ms 343540 KB Output is correct
39 Correct 1140 ms 323288 KB Output is correct
40 Correct 870 ms 327032 KB Output is correct
41 Correct 862 ms 326860 KB Output is correct
42 Correct 1000 ms 327812 KB Output is correct
43 Correct 957 ms 326272 KB Output is correct
44 Incorrect 254 ms 15352 KB Output isn't correct
45 Halted 0 ms 0 KB -