oj.uz

Submission #383415

# Submission time Handle Problem Language Result Execution time Memory
383415 2021-03-29T21:02:25 Z luciocf Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1843 ms 426728 KB 
#include <bits/stdc++.h>

#define ff first
#define ss second

using namespace std;

typedef pair<int, int> pii;

const int maxn = 2e5+10;
const int inf = 1e9+10;

int n, m, q;
int dp[maxn];

int visto[maxn];

bool mark[maxn], block[maxn];

int ptr[maxn];

vector<pii> dist[maxn];

vector<int> grafo[2][maxn], ord;

void dfs(int u)
{
	mark[u] = 1;

	for (auto v: grafo[0][u])
		if (!mark[v])
			dfs(v);

	ord.push_back(u);
}

void solve(int t)
{
	for (int i = 1; i <= n; i++)
		dp[i] = -inf;

	dp[t] = 0;
	
	for (int i = ord.size()-1; i >= 0; i--)
	{
		int u = ord[i];

		for (auto v: grafo[1][u])
			dp[u] = max(dp[u], 1 + dp[v]);
	}

}

int main(void)
{
	scanf("%d %d %d", &n, &m, &q);

	for (int i = 1; i <= m; i++)
	{
		int u, v;
		scanf("%d %d", &u, &v);

		grafo[0][v].push_back(u);
		grafo[1][u].push_back(v);
	}

	for (int i = 1; i <= n; i++)
		if (!mark[i])
			dfs(i);

	for (auto u: ord)
	{
		for (auto v: grafo[0][u])
			ptr[v] = 0;

		for (int t = 1; t <= 321; t++)
		{	
			pii pp = {-1, -1};

			for (auto v: grafo[0][u])
			{
				while (dist[u].size() && ptr[v] < dist[v].size() && visto[dist[v][ptr[v]].ss])
					ptr[v]++;

				if (ptr[v] < dist[v].size())
					pp = max(pp, {dist[v][ptr[v]].ff+1, dist[v][ptr[v]].ss});
			}

			if (pp.ff == -1)
			{
				dist[u].push_back({0, u});
				break;
			}
			else
			{
				dist[u].push_back(pp);
				visto[pp.ss] = 1;

				for (auto v: grafo[0][u])
				{
					if (ptr[v] < dist[v].size() && pp == make_pair(dist[v][ptr[v]].ff+1, dist[v][ptr[v]].ss))
					{
						ptr[v]++;
						break;
					}
				}
			}
		}

		for (auto pp: dist[u])
			visto[pp.ss] = 0;
	}

	while (q--)
	{
		int t, y;
		scanf("%d %d", &t, &y);

		vector<int> lista;

		for (int i = 1; i <= y; i++)
		{
			int u;
			scanf("%d", &u);

			lista.push_back(u);
			block[u] = 1;
		}

		int ans = -inf;

		if (y > 320)
		{
			solve(t);

			for (int i = 1; i <= n; i++)
				if (!block[i])
					ans = max(ans, dp[i]);
		}
		else
		{
			for (auto pp: dist[t])
			{
				if (!block[pp.ss])
				{
					ans = pp.ff;
					break;
				}
			}
		}

		if (ans < 0) printf("-1\n");
		else printf("%d\n", ans);

		for (auto u: lista)
			block[u] = 0;
	}
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:82:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     while (dist[u].size() && ptr[v] < dist[v].size() && visto[dist[v][ptr[v]].ss])
      |                              ~~~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:85:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     if (ptr[v] < dist[v].size())
      |         ~~~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:101:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |      if (ptr[v] < dist[v].size() && pp == make_pair(dist[v][ptr[v]].ff+1, dist[v][ptr[v]].ss))
      |          ~~~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |  scanf("%d %d %d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:61:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:117:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  117 |   scanf("%d %d", &t, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:124:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  124 |    scanf("%d", &u);
      |    ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14444 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 11 ms 14444 KB Output is correct
5 Correct 14 ms 14956 KB Output is correct
6 Correct 14 ms 14976 KB Output is correct
7 Correct 14 ms 14956 KB Output is correct
8 Correct 22 ms 17900 KB Output is correct
9 Correct 21 ms 17900 KB Output is correct
10 Correct 21 ms 17900 KB Output is correct
11 Correct 20 ms 17516 KB Output is correct
12 Correct 16 ms 15852 KB Output is correct
13 Correct 20 ms 17260 KB Output is correct
14 Correct 19 ms 16492 KB Output is correct
15 Correct 16 ms 15468 KB Output is correct
16 Correct 21 ms 16364 KB Output is correct
17 Correct 19 ms 16768 KB Output is correct
18 Correct 16 ms 15596 KB Output is correct
19 Correct 19 ms 16748 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14444 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 11 ms 14444 KB Output is correct
5 Correct 14 ms 14956 KB Output is correct
6 Correct 14 ms 14976 KB Output is correct
7 Correct 14 ms 14956 KB Output is correct
8 Correct 22 ms 17900 KB Output is correct
9 Correct 21 ms 17900 KB Output is correct
10 Correct 21 ms 17900 KB Output is correct
11 Correct 20 ms 17516 KB Output is correct
12 Correct 16 ms 15852 KB Output is correct
13 Correct 20 ms 17260 KB Output is correct
14 Correct 19 ms 16492 KB Output is correct
15 Correct 16 ms 15468 KB Output is correct
16 Correct 21 ms 16364 KB Output is correct
17 Correct 19 ms 16768 KB Output is correct
18 Correct 16 ms 15596 KB Output is correct
19 Correct 19 ms 16748 KB Output is correct
20 Correct 697 ms 20264 KB Output is correct
21 Correct 602 ms 20208 KB Output is correct
22 Correct 705 ms 20332 KB Output is correct
23 Correct 727 ms 20332 KB Output is correct
24 Correct 1110 ms 264976 KB Output is correct
25 Correct 1136 ms 276196 KB Output is correct
26 Correct 1161 ms 275428 KB Output is correct
27 Correct 1372 ms 424800 KB Output is correct
28 Correct 1344 ms 424676 KB Output is correct
29 Correct 1353 ms 424752 KB Output is correct
30 Correct 1351 ms 423396 KB Output is correct
31 Correct 1355 ms 408940 KB Output is correct
32 Correct 1335 ms 423396 KB Output is correct
33 Correct 992 ms 266728 KB Output is correct
34 Correct 866 ms 220520 KB Output is correct
35 Correct 963 ms 264780 KB Output is correct
36 Correct 1159 ms 345700 KB Output is correct
37 Correct 1158 ms 313964 KB Output is correct
38 Correct 1188 ms 346724 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14444 KB Output is correct
2 Correct 11 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 11 ms 14444 KB Output is correct
5 Correct 14 ms 14956 KB Output is correct
6 Correct 14 ms 14976 KB Output is correct
7 Correct 14 ms 14956 KB Output is correct
8 Correct 22 ms 17900 KB Output is correct
9 Correct 21 ms 17900 KB Output is correct
10 Correct 21 ms 17900 KB Output is correct
11 Correct 20 ms 17516 KB Output is correct
12 Correct 16 ms 15852 KB Output is correct
13 Correct 20 ms 17260 KB Output is correct
14 Correct 19 ms 16492 KB Output is correct
15 Correct 16 ms 15468 KB Output is correct
16 Correct 21 ms 16364 KB Output is correct
17 Correct 19 ms 16768 KB Output is correct
18 Correct 16 ms 15596 KB Output is correct
19 Correct 19 ms 16748 KB Output is correct
20 Correct 697 ms 20264 KB Output is correct
21 Correct 602 ms 20208 KB Output is correct
22 Correct 705 ms 20332 KB Output is correct
23 Correct 727 ms 20332 KB Output is correct
24 Correct 1110 ms 264976 KB Output is correct
25 Correct 1136 ms 276196 KB Output is correct
26 Correct 1161 ms 275428 KB Output is correct
27 Correct 1372 ms 424800 KB Output is correct
28 Correct 1344 ms 424676 KB Output is correct
29 Correct 1353 ms 424752 KB Output is correct
30 Correct 1351 ms 423396 KB Output is correct
31 Correct 1355 ms 408940 KB Output is correct
32 Correct 1335 ms 423396 KB Output is correct
33 Correct 992 ms 266728 KB Output is correct
34 Correct 866 ms 220520 KB Output is correct
35 Correct 963 ms 264780 KB Output is correct
36 Correct 1159 ms 345700 KB Output is correct
37 Correct 1158 ms 313964 KB Output is correct
38 Correct 1188 ms 346724 KB Output is correct
39 Correct 1187 ms 267380 KB Output is correct
40 Correct 1166 ms 269668 KB Output is correct
41 Correct 1129 ms 272484 KB Output is correct
42 Correct 1429 ms 270820 KB Output is correct
43 Correct 1168 ms 270196 KB Output is correct
44 Correct 751 ms 20716 KB Output is correct
45 Correct 709 ms 20420 KB Output is correct
46 Correct 702 ms 20332 KB Output is correct
47 Correct 723 ms 20264 KB Output is correct
48 Correct 699 ms 20396 KB Output is correct
49 Correct 1423 ms 424472 KB Output is correct
50 Correct 1358 ms 423652 KB Output is correct
51 Correct 658 ms 20716 KB Output is correct
52 Correct 610 ms 20256 KB Output is correct
53 Correct 1230 ms 343780 KB Output is correct
54 Correct 1204 ms 313708 KB Output is correct
55 Correct 1183 ms 343732 KB Output is correct
56 Correct 1172 ms 314732 KB Output is correct
57 Correct 721 ms 21356 KB Output is correct
58 Correct 733 ms 21228 KB Output is correct
59 Correct 697 ms 20348 KB Output is correct
60 Correct 693 ms 20440 KB Output is correct
61 Correct 1599 ms 424164 KB Output is correct
62 Correct 1459 ms 346468 KB Output is correct
63 Correct 1430 ms 314216 KB Output is correct
64 Correct 1843 ms 425004 KB Output is correct
65 Correct 1655 ms 344932 KB Output is correct
66 Correct 1730 ms 315884 KB Output is correct
67 Correct 1350 ms 424708 KB Output is correct
68 Correct 1170 ms 346084 KB Output is correct
69 Correct 1176 ms 311616 KB Output is correct
70 Correct 1394 ms 425644 KB Output is correct
71 Correct 1224 ms 346980 KB Output is correct
72 Correct 1201 ms 315660 KB Output is correct
73 Correct 1445 ms 425628 KB Output is correct
74 Correct 1258 ms 347052 KB Output is correct
75 Correct 1243 ms 315812 KB Output is correct
76 Correct 1439 ms 426728 KB Output is correct
77 Correct 1373 ms 425700 KB Output is correct
78 Correct 1379 ms 426048 KB Output is correct
79 Correct 645 ms 21996 KB Output is correct
80 Correct 605 ms 20972 KB Output is correct
81 Correct 652 ms 20588 KB Output is correct
82 Correct 1405 ms 425700 KB Output is correct
83 Correct 1461 ms 411372 KB Output is correct
84 Correct 1345 ms 424344 KB Output is correct
85 Correct 1363 ms 409740 KB Output is correct
86 Correct 1361 ms 425188 KB Output is correct
87 Correct 1424 ms 411348 KB Output is correct
88 Correct 743 ms 22156 KB Output is correct
89 Correct 749 ms 22380 KB Output is correct
90 Correct 689 ms 21228 KB Output is correct
91 Correct 703 ms 21228 KB Output is correct
92 Correct 665 ms 21252 KB Output is correct
93 Correct 695 ms 20952 KB Output is correct
94 Correct 1042 ms 269148 KB Output is correct
95 Correct 973 ms 221804 KB Output is correct
96 Correct 1010 ms 266980 KB Output is correct
97 Correct 926 ms 224704 KB Output is correct
98 Correct 1000 ms 268004 KB Output is correct
99 Correct 932 ms 224608 KB Output is correct
100 Correct 768 ms 22380 KB Output is correct
101 Correct 807 ms 22252 KB Output is correct
102 Correct 736 ms 21260 KB Output is correct
103 Correct 747 ms 21356 KB Output is correct
104 Correct 721 ms 20972 KB Output is correct
105 Correct 754 ms 20972 KB Output is correct
106 Correct 1245 ms 347108 KB Output is correct
107 Correct 1271 ms 317160 KB Output is correct
108 Correct 1187 ms 348460 KB Output is correct
109 Correct 1162 ms 315752 KB Output is correct
110 Correct 1204 ms 349156 KB Output is correct
111 Correct 1222 ms 317420 KB Output is correct
112 Correct 710 ms 22892 KB Output is correct
113 Correct 743 ms 22848 KB Output is correct
114 Correct 676 ms 21740 KB Output is correct
115 Correct 700 ms 21740 KB Output is correct
116 Correct 671 ms 21356 KB Output is correct
117 Correct 726 ms 21564 KB Output is correct
118 Correct 1351 ms 426200 KB Output is correct
119 Correct 1178 ms 348132 KB Output is correct
120 Correct 1160 ms 315632 KB Output is correct
121 Correct 1333 ms 426340 KB Output is correct
122 Correct 1210 ms 346892 KB Output is correct
123 Correct 1155 ms 315884 KB Output is correct
124 Correct 1380 ms 426340 KB Output is correct
125 Correct 1176 ms 348552 KB Output is correct
126 Correct 1158 ms 314756 KB Output is correct