oj.uz

Submission #112518

# Submission time Handle Problem Language Result Execution time Memory
112518 2019-05-20T11:33:56 Z Kastanda Bitaro’s Party (JOI18_bitaro) C++11
100 / 100
 1497 ms 418972 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];
				while (ptr[i] < (int)best[u].size() && mark[best[u][ptr[i]].second] == v)
					ptr[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;
 
			mark[Mx.second] = v;
			ptr[id] ++;
			best[v].pb(Mx);
		}
	}
 
	memset(mark, 0, sizeof(mark));
	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:81: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:85: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 7808 KB Output is correct
2 Correct 9 ms 7808 KB Output is correct
3 Correct 7 ms 7808 KB Output is correct
4 Correct 7 ms 7808 KB Output is correct
5 Correct 10 ms 9088 KB Output is correct
6 Correct 11 ms 9088 KB Output is correct
7 Correct 11 ms 9088 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 16 ms 12032 KB Output is correct
10 Correct 16 ms 12032 KB Output is correct
11 Correct 16 ms 11648 KB Output is correct
12 Correct 13 ms 9984 KB Output is correct
13 Correct 15 ms 11392 KB Output is correct
14 Correct 15 ms 10624 KB Output is correct
15 Correct 13 ms 9600 KB Output is correct
16 Correct 14 ms 10624 KB Output is correct
17 Correct 16 ms 10880 KB Output is correct
18 Correct 13 ms 9856 KB Output is correct
19 Correct 16 ms 10880 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7808 KB Output is correct
2 Correct 9 ms 7808 KB Output is correct
3 Correct 7 ms 7808 KB Output is correct
4 Correct 7 ms 7808 KB Output is correct
5 Correct 10 ms 9088 KB Output is correct
6 Correct 11 ms 9088 KB Output is correct
7 Correct 11 ms 9088 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 16 ms 12032 KB Output is correct
10 Correct 16 ms 12032 KB Output is correct
11 Correct 16 ms 11648 KB Output is correct
12 Correct 13 ms 9984 KB Output is correct
13 Correct 15 ms 11392 KB Output is correct
14 Correct 15 ms 10624 KB Output is correct
15 Correct 13 ms 9600 KB Output is correct
16 Correct 14 ms 10624 KB Output is correct
17 Correct 16 ms 10880 KB Output is correct
18 Correct 13 ms 9856 KB Output is correct
19 Correct 16 ms 10880 KB Output is correct
20 Correct 446 ms 15260 KB Output is correct
21 Correct 429 ms 15352 KB Output is correct
22 Correct 477 ms 15352 KB Output is correct
23 Correct 477 ms 15412 KB Output is correct
24 Correct 934 ms 258252 KB Output is correct
25 Correct 1028 ms 269944 KB Output is correct
26 Correct 982 ms 268920 KB Output is correct
27 Correct 1099 ms 418680 KB Output is correct
28 Correct 1110 ms 418860 KB Output is correct
29 Correct 1106 ms 418972 KB Output is correct
30 Correct 1129 ms 417912 KB Output is correct
31 Correct 1057 ms 403292 KB Output is correct
32 Correct 1077 ms 417784 KB Output is correct
33 Correct 810 ms 261240 KB Output is correct
34 Correct 731 ms 214940 KB Output is correct
35 Correct 795 ms 259448 KB Output is correct
36 Correct 983 ms 339844 KB Output is correct
37 Correct 961 ms 308216 KB Output is correct
38 Correct 930 ms 340964 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7808 KB Output is correct
2 Correct 9 ms 7808 KB Output is correct
3 Correct 7 ms 7808 KB Output is correct
4 Correct 7 ms 7808 KB Output is correct
5 Correct 10 ms 9088 KB Output is correct
6 Correct 11 ms 9088 KB Output is correct
7 Correct 11 ms 9088 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 16 ms 12032 KB Output is correct
10 Correct 16 ms 12032 KB Output is correct
11 Correct 16 ms 11648 KB Output is correct
12 Correct 13 ms 9984 KB Output is correct
13 Correct 15 ms 11392 KB Output is correct
14 Correct 15 ms 10624 KB Output is correct
15 Correct 13 ms 9600 KB Output is correct
16 Correct 14 ms 10624 KB Output is correct
17 Correct 16 ms 10880 KB Output is correct
18 Correct 13 ms 9856 KB Output is correct
19 Correct 16 ms 10880 KB Output is correct
20 Correct 446 ms 15260 KB Output is correct
21 Correct 429 ms 15352 KB Output is correct
22 Correct 477 ms 15352 KB Output is correct
23 Correct 477 ms 15412 KB Output is correct
24 Correct 934 ms 258252 KB Output is correct
25 Correct 1028 ms 269944 KB Output is correct
26 Correct 982 ms 268920 KB Output is correct
27 Correct 1099 ms 418680 KB Output is correct
28 Correct 1110 ms 418860 KB Output is correct
29 Correct 1106 ms 418972 KB Output is correct
30 Correct 1129 ms 417912 KB Output is correct
31 Correct 1057 ms 403292 KB Output is correct
32 Correct 1077 ms 417784 KB Output is correct
33 Correct 810 ms 261240 KB Output is correct
34 Correct 731 ms 214940 KB Output is correct
35 Correct 795 ms 259448 KB Output is correct
36 Correct 983 ms 339844 KB Output is correct
37 Correct 961 ms 308216 KB Output is correct
38 Correct 930 ms 340964 KB Output is correct
39 Correct 1108 ms 260480 KB Output is correct
40 Correct 1031 ms 262900 KB Output is correct
41 Correct 1076 ms 265684 KB Output is correct
42 Correct 1249 ms 264440 KB Output is correct
43 Correct 1041 ms 263736 KB Output is correct
44 Correct 510 ms 14992 KB Output is correct
45 Correct 457 ms 14600 KB Output is correct
46 Correct 453 ms 14712 KB Output is correct
47 Correct 530 ms 15480 KB Output is correct
48 Correct 442 ms 15608 KB Output is correct
49 Correct 1245 ms 418040 KB Output is correct
50 Correct 1152 ms 417528 KB Output is correct
51 Correct 482 ms 14840 KB Output is correct
52 Correct 426 ms 14584 KB Output is correct
53 Correct 1152 ms 337324 KB Output is correct
54 Correct 1059 ms 307324 KB Output is correct
55 Correct 967 ms 337668 KB Output is correct
56 Correct 935 ms 307700 KB Output is correct
57 Correct 498 ms 14900 KB Output is correct
58 Correct 485 ms 14840 KB Output is correct
59 Correct 556 ms 14456 KB Output is correct
60 Correct 442 ms 14524 KB Output is correct
61 Correct 1222 ms 418432 KB Output is correct
62 Correct 1089 ms 339576 KB Output is correct
63 Correct 1016 ms 307232 KB Output is correct
64 Correct 1497 ms 418432 KB Output is correct
65 Correct 1314 ms 338048 KB Output is correct
66 Correct 1366 ms 308848 KB Output is correct
67 Correct 1087 ms 417384 KB Output is correct
68 Correct 924 ms 339032 KB Output is correct
69 Correct 911 ms 304260 KB Output is correct
70 Correct 1137 ms 418660 KB Output is correct
71 Correct 986 ms 339880 KB Output is correct
72 Correct 938 ms 308572 KB Output is correct
73 Correct 1133 ms 418616 KB Output is correct
74 Correct 1050 ms 339812 KB Output is correct
75 Correct 968 ms 308676 KB Output is correct
76 Correct 1256 ms 418272 KB Output is correct
77 Correct 1085 ms 417704 KB Output is correct
78 Correct 1108 ms 418720 KB Output is correct
79 Correct 536 ms 15224 KB Output is correct
80 Correct 476 ms 14740 KB Output is correct
81 Correct 429 ms 15552 KB Output is correct
82 Correct 1288 ms 417056 KB Output is correct
83 Correct 1270 ms 402624 KB Output is correct
84 Correct 1143 ms 416444 KB Output is correct
85 Correct 1091 ms 401668 KB Output is correct
86 Correct 1077 ms 417568 KB Output is correct
87 Correct 1099 ms 403448 KB Output is correct
88 Correct 505 ms 15224 KB Output is correct
89 Correct 522 ms 15224 KB Output is correct
90 Correct 473 ms 14676 KB Output is correct
91 Correct 455 ms 14756 KB Output is correct
92 Correct 455 ms 15532 KB Output is correct
93 Correct 460 ms 15648 KB Output is correct
94 Correct 952 ms 260472 KB Output is correct
95 Correct 804 ms 213016 KB Output is correct
96 Correct 802 ms 258892 KB Output is correct
97 Correct 768 ms 216696 KB Output is correct
98 Correct 807 ms 260600 KB Output is correct
99 Correct 732 ms 217080 KB Output is correct
100 Correct 541 ms 15140 KB Output is correct
101 Correct 597 ms 15188 KB Output is correct
102 Correct 476 ms 14812 KB Output is correct
103 Correct 482 ms 14744 KB Output is correct
104 Correct 464 ms 15736 KB Output is correct
105 Correct 495 ms 15704 KB Output is correct
106 Correct 1120 ms 337988 KB Output is correct
107 Correct 1175 ms 308088 KB Output is correct
108 Correct 964 ms 339832 KB Output is correct
109 Correct 954 ms 307064 KB Output is correct
110 Correct 1000 ms 340856 KB Output is correct
111 Correct 957 ms 309112 KB Output is correct
112 Correct 511 ms 15396 KB Output is correct
113 Correct 482 ms 15196 KB Output is correct
114 Correct 430 ms 14840 KB Output is correct
115 Correct 432 ms 14840 KB Output is correct
116 Correct 446 ms 15480 KB Output is correct
117 Correct 419 ms 15600 KB Output is correct
118 Correct 1084 ms 417784 KB Output is correct
119 Correct 964 ms 339704 KB Output is correct
120 Correct 969 ms 307056 KB Output is correct
121 Correct 1127 ms 417696 KB Output is correct
122 Correct 943 ms 338404 KB Output is correct
123 Correct 917 ms 307180 KB Output is correct
124 Correct 1066 ms 417728 KB Output is correct
125 Correct 931 ms 340128 KB Output is correct
126 Correct 882 ms 306040 KB Output is correct