oj.uz

Submission #95046

# Submission time Handle Problem Language Result Execution time Memory
95046 2019-01-27T07:09:21 Z Mahdi_Jfri Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 411736 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
typedef vector<pair<int,int>> vii;

const int maxn = 1e5 + 20;
const int sq = 320;

vector<int> in[maxn];
vii path[maxn];

int dp[maxn] , mx[maxn] , all[maxn];

bool is[maxn];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n , m , q;
	cin >> n >> m >> q;

	for(int i = 0; i < m; i++)
	{
		int a , b;
		cin >> a >> b;
		a-- , b--;
		in[b].pb(a);
	}

	for(int v = 0; v < n; v++)
	{
		int t = 0;
		all[t++] = v , mx[v] = 0;
		for(auto u : in[v])
			for(auto w : path[u])
			{
				mx[w.second] = max(mx[w.second] , w.first + 1);
				all[t++] = w.second;
			}

		for(int i = 0; i < t; i++)
			if(mx[all[i]] != -1)
				path[v].pb({mx[all[i]] , all[i]}) , mx[all[i]] = -1;
		sort(path[v].begin() , path[v].end());
		reverse(path[v].begin() , path[v].end());
		while(path[v].size() > sq)
			path[v].pop_back();
	}

	while(q--)
	{
		int v , sz;
		cin >> v >> sz;
		v--;

		vector<int> tmp(sz);
		for(auto &x : tmp)
			cin >> x , x--;

		for(auto x : tmp)
			is[x] = 1;

		if(sz > sq)
		{
			for(int i = 0; i <= v; i++)
			{
				dp[i] = -1e9;
				if(!is[i])
					dp[i] = 0;
				for(auto u : in[i])
					dp[i] = max(dp[i] , dp[u] + 1);
			}

			dp[v] = max(dp[v] , -1);
			cout << dp[v] << endl;
		}
		else
		{
			bool f = 0;
			for(auto x : path[v])
				if(!is[x.second])
				{
					cout << x.first << endl;
					f = 1;
					break;
				}

			if(!f)
				cout << -1 << endl;
		}

		for(auto x : tmp)
			is[x] = 0;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 8 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 15 ms 8440 KB Output is correct
9 Correct 15 ms 8440 KB Output is correct
10 Correct 15 ms 8440 KB Output is correct
11 Correct 16 ms 8056 KB Output is correct
12 Correct 13 ms 6392 KB Output is correct
13 Correct 15 ms 7800 KB Output is correct
14 Correct 15 ms 7032 KB Output is correct
15 Correct 12 ms 6264 KB Output is correct
16 Correct 14 ms 7032 KB Output is correct
17 Correct 15 ms 7288 KB Output is correct
18 Correct 12 ms 6264 KB Output is correct
19 Correct 16 ms 7288 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 8 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 15 ms 8440 KB Output is correct
9 Correct 15 ms 8440 KB Output is correct
10 Correct 15 ms 8440 KB Output is correct
11 Correct 16 ms 8056 KB Output is correct
12 Correct 13 ms 6392 KB Output is correct
13 Correct 15 ms 7800 KB Output is correct
14 Correct 15 ms 7032 KB Output is correct
15 Correct 12 ms 6264 KB Output is correct
16 Correct 14 ms 7032 KB Output is correct
17 Correct 15 ms 7288 KB Output is correct
18 Correct 12 ms 6264 KB Output is correct
19 Correct 16 ms 7288 KB Output is correct
20 Correct 145 ms 11256 KB Output is correct
21 Correct 146 ms 11256 KB Output is correct
22 Correct 145 ms 11384 KB Output is correct
23 Correct 162 ms 11740 KB Output is correct
24 Correct 1758 ms 264312 KB Output is correct
25 Correct 1759 ms 272816 KB Output is correct
26 Correct 1799 ms 270768 KB Output is correct
27 Correct 1259 ms 411460 KB Output is correct
28 Correct 1212 ms 411736 KB Output is correct
29 Correct 1327 ms 411688 KB Output is correct
30 Correct 1298 ms 411164 KB Output is correct
31 Correct 1678 ms 402624 KB Output is correct
32 Correct 1232 ms 410620 KB Output is correct
33 Correct 1156 ms 253276 KB Output is correct
34 Correct 1542 ms 279004 KB Output is correct
35 Correct 1185 ms 251456 KB Output is correct
36 Correct 1268 ms 332164 KB Output is correct
37 Correct 1835 ms 308668 KB Output is correct
38 Correct 1369 ms 333100 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 8 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 15 ms 8440 KB Output is correct
9 Correct 15 ms 8440 KB Output is correct
10 Correct 15 ms 8440 KB Output is correct
11 Correct 16 ms 8056 KB Output is correct
12 Correct 13 ms 6392 KB Output is correct
13 Correct 15 ms 7800 KB Output is correct
14 Correct 15 ms 7032 KB Output is correct
15 Correct 12 ms 6264 KB Output is correct
16 Correct 14 ms 7032 KB Output is correct
17 Correct 15 ms 7288 KB Output is correct
18 Correct 12 ms 6264 KB Output is correct
19 Correct 16 ms 7288 KB Output is correct
20 Correct 145 ms 11256 KB Output is correct
21 Correct 146 ms 11256 KB Output is correct
22 Correct 145 ms 11384 KB Output is correct
23 Correct 162 ms 11740 KB Output is correct
24 Correct 1758 ms 264312 KB Output is correct
25 Correct 1759 ms 272816 KB Output is correct
26 Correct 1799 ms 270768 KB Output is correct
27 Correct 1259 ms 411460 KB Output is correct
28 Correct 1212 ms 411736 KB Output is correct
29 Correct 1327 ms 411688 KB Output is correct
30 Correct 1298 ms 411164 KB Output is correct
31 Correct 1678 ms 402624 KB Output is correct
32 Correct 1232 ms 410620 KB Output is correct
33 Correct 1156 ms 253276 KB Output is correct
34 Correct 1542 ms 279004 KB Output is correct
35 Correct 1185 ms 251456 KB Output is correct
36 Correct 1268 ms 332164 KB Output is correct
37 Correct 1835 ms 308668 KB Output is correct
38 Correct 1369 ms 333100 KB Output is correct
39 Execution timed out 2053 ms 267656 KB Time limit exceeded
40 Halted 0 ms 0 KB -