oj.uz

Submission #95084

# Submission time Handle Problem Language Result Execution time Memory
95084 2019-01-27T07:56:29 Z Mahdi_Jfri Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 411400 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);
	}

	memset(mx , -1 , sizeof mx);
	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;
		for(int _ = 0; _ < sz; _++)
		{
			int x;
			cin >> x;
			x--;
			tmp.pb(x);
			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 6 ms 5496 KB Output is correct
2 Correct 6 ms 5496 KB Output is correct
3 Correct 6 ms 5496 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 9 ms 5880 KB Output is correct
6 Correct 9 ms 5880 KB Output is correct
7 Correct 9 ms 5880 KB Output is correct
8 Correct 17 ms 8824 KB Output is correct
9 Correct 17 ms 8744 KB Output is correct
10 Correct 17 ms 8824 KB Output is correct
11 Correct 17 ms 8440 KB Output is correct
12 Correct 13 ms 6776 KB Output is correct
13 Correct 17 ms 8184 KB Output is correct
14 Correct 16 ms 7416 KB Output is correct
15 Correct 13 ms 6520 KB Output is correct
16 Correct 15 ms 7416 KB Output is correct
17 Correct 17 ms 7656 KB Output is correct
18 Correct 13 ms 6648 KB Output is correct
19 Correct 17 ms 7672 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5496 KB Output is correct
2 Correct 6 ms 5496 KB Output is correct
3 Correct 6 ms 5496 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 9 ms 5880 KB Output is correct
6 Correct 9 ms 5880 KB Output is correct
7 Correct 9 ms 5880 KB Output is correct
8 Correct 17 ms 8824 KB Output is correct
9 Correct 17 ms 8744 KB Output is correct
10 Correct 17 ms 8824 KB Output is correct
11 Correct 17 ms 8440 KB Output is correct
12 Correct 13 ms 6776 KB Output is correct
13 Correct 17 ms 8184 KB Output is correct
14 Correct 16 ms 7416 KB Output is correct
15 Correct 13 ms 6520 KB Output is correct
16 Correct 15 ms 7416 KB Output is correct
17 Correct 17 ms 7656 KB Output is correct
18 Correct 13 ms 6648 KB Output is correct
19 Correct 17 ms 7672 KB Output is correct
20 Correct 139 ms 10228 KB Output is correct
21 Correct 142 ms 10340 KB Output is correct
22 Correct 147 ms 10160 KB Output is correct
23 Correct 166 ms 10232 KB Output is correct
24 Correct 1781 ms 263356 KB Output is correct
25 Correct 1936 ms 272076 KB Output is correct
26 Correct 1693 ms 270012 KB Output is correct
27 Correct 1220 ms 411072 KB Output is correct
28 Correct 1197 ms 411132 KB Output is correct
29 Correct 1341 ms 411400 KB Output is correct
30 Correct 1313 ms 410528 KB Output is correct
31 Correct 1837 ms 402120 KB Output is correct
32 Correct 1357 ms 410420 KB Output is correct
33 Correct 1225 ms 252904 KB Output is correct
34 Correct 1602 ms 278792 KB Output is correct
35 Correct 1258 ms 251376 KB Output is correct
36 Correct 1414 ms 331964 KB Output is correct
37 Correct 1855 ms 308336 KB Output is correct
38 Correct 1382 ms 332800 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5496 KB Output is correct
2 Correct 6 ms 5496 KB Output is correct
3 Correct 6 ms 5496 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 9 ms 5880 KB Output is correct
6 Correct 9 ms 5880 KB Output is correct
7 Correct 9 ms 5880 KB Output is correct
8 Correct 17 ms 8824 KB Output is correct
9 Correct 17 ms 8744 KB Output is correct
10 Correct 17 ms 8824 KB Output is correct
11 Correct 17 ms 8440 KB Output is correct
12 Correct 13 ms 6776 KB Output is correct
13 Correct 17 ms 8184 KB Output is correct
14 Correct 16 ms 7416 KB Output is correct
15 Correct 13 ms 6520 KB Output is correct
16 Correct 15 ms 7416 KB Output is correct
17 Correct 17 ms 7656 KB Output is correct
18 Correct 13 ms 6648 KB Output is correct
19 Correct 17 ms 7672 KB Output is correct
20 Correct 139 ms 10228 KB Output is correct
21 Correct 142 ms 10340 KB Output is correct
22 Correct 147 ms 10160 KB Output is correct
23 Correct 166 ms 10232 KB Output is correct
24 Correct 1781 ms 263356 KB Output is correct
25 Correct 1936 ms 272076 KB Output is correct
26 Correct 1693 ms 270012 KB Output is correct
27 Correct 1220 ms 411072 KB Output is correct
28 Correct 1197 ms 411132 KB Output is correct
29 Correct 1341 ms 411400 KB Output is correct
30 Correct 1313 ms 410528 KB Output is correct
31 Correct 1837 ms 402120 KB Output is correct
32 Correct 1357 ms 410420 KB Output is correct
33 Correct 1225 ms 252904 KB Output is correct
34 Correct 1602 ms 278792 KB Output is correct
35 Correct 1258 ms 251376 KB Output is correct
36 Correct 1414 ms 331964 KB Output is correct
37 Correct 1855 ms 308336 KB Output is correct
38 Correct 1382 ms 332800 KB Output is correct
39 Correct 1913 ms 267080 KB Output is correct
40 Correct 1889 ms 267056 KB Output is correct
41 Correct 1831 ms 268124 KB Output is correct
42 Correct 1952 ms 267368 KB Output is correct
43 Correct 1962 ms 268220 KB Output is correct
44 Correct 315 ms 10616 KB Output is correct
45 Correct 173 ms 10444 KB Output is correct
46 Correct 151 ms 10256 KB Output is correct
47 Correct 163 ms 10260 KB Output is correct
48 Correct 155 ms 10160 KB Output is correct
49 Correct 1662 ms 411084 KB Output is correct
50 Correct 1425 ms 410944 KB Output is correct
51 Correct 300 ms 11172 KB Output is correct
52 Correct 154 ms 10620 KB Output is correct
53 Correct 1651 ms 330828 KB Output is correct
54 Execution timed out 2043 ms 310748 KB Time limit exceeded
55 Halted 0 ms 0 KB -