oj.uz

Submission #66979

# Submission time Handle Problem Language Result Execution time Memory
66979 2018-08-13T06:16:12 Z szawinis Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 1918 ms 525312 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+1, INF = 1e9+1;

int n, m, q, bsz = 300;
vector<int> g[N];
vector<pair<int,int> > dp[N];
bool blocked[N];
int f[N];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> q;
	for(int i = 0, s, e; i < m; i++) {
		cin >> s >> e;
		--s, --e;
		g[e].push_back(s);
	}
	dp[0].emplace_back(0, 0);
	for(int i = 1; i < n; i++) {
		dp[i].emplace_back(0, i);
		for(int j: g[i]) for(auto x: dp[j]) dp[i].emplace_back(x.first + 1, x.second);
		nth_element(dp[i].begin(), dp[i].begin() + min(bsz, (int) dp[i].size()), dp[i].end());
		dp[i].resize(min(bsz, (int) dp[i].size()));
	}
	while(q--) {
		int targ, Y;
		cin >> targ >> Y;
		--targ;
		vector<int> C(Y);
		for(int i = 0; i < Y; i++) {
			cin >> C[i];
			--C[i];
			blocked[C[i]] = true;
		}
		int res = -INF;
		if(Y < bsz) {
			for(auto p: dp[targ]) if(!blocked[p.second]) res = max(p.first, res);
		} else {
			fill(f, f+targ+1, 0);
			for(int i: C) f[i] = -INF;
			for(int i = 0; i <= targ; i++) {
				for(int j: g[i]) f[i] = max(f[j] + 1, f[i]);
				if(f[i] < 0) f[i] = -INF;
			}
			res = f[targ];
		}
		if(res == -INF) cout << -1;
		else cout << res;
		cout << '\n';
		for(int i = 0; i < Y; i++) blocked[C[i]] = false;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5236 KB Output is correct
3 Correct 7 ms 5236 KB Output is correct
4 Correct 6 ms 5236 KB Output is correct
5 Correct 21 ms 8592 KB Output is correct
6 Correct 17 ms 8592 KB Output is correct
7 Correct 18 ms 8592 KB Output is correct
8 Correct 32 ms 12076 KB Output is correct
9 Correct 31 ms 12204 KB Output is correct
10 Correct 32 ms 12204 KB Output is correct
11 Correct 28 ms 12204 KB Output is correct
12 Correct 20 ms 12204 KB Output is correct
13 Correct 36 ms 12204 KB Output is correct
14 Correct 21 ms 12204 KB Output is correct
15 Correct 13 ms 12204 KB Output is correct
16 Correct 19 ms 12204 KB Output is correct
17 Correct 24 ms 12204 KB Output is correct
18 Correct 15 ms 12204 KB Output is correct
19 Correct 24 ms 12204 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5236 KB Output is correct
3 Correct 7 ms 5236 KB Output is correct
4 Correct 6 ms 5236 KB Output is correct
5 Correct 21 ms 8592 KB Output is correct
6 Correct 17 ms 8592 KB Output is correct
7 Correct 18 ms 8592 KB Output is correct
8 Correct 32 ms 12076 KB Output is correct
9 Correct 31 ms 12204 KB Output is correct
10 Correct 32 ms 12204 KB Output is correct
11 Correct 28 ms 12204 KB Output is correct
12 Correct 20 ms 12204 KB Output is correct
13 Correct 36 ms 12204 KB Output is correct
14 Correct 21 ms 12204 KB Output is correct
15 Correct 13 ms 12204 KB Output is correct
16 Correct 19 ms 12204 KB Output is correct
17 Correct 24 ms 12204 KB Output is correct
18 Correct 15 ms 12204 KB Output is correct
19 Correct 24 ms 12204 KB Output is correct
20 Correct 1562 ms 471792 KB Output is correct
21 Correct 1547 ms 471792 KB Output is correct
22 Correct 1491 ms 471792 KB Output is correct
23 Correct 1524 ms 471792 KB Output is correct
24 Runtime error 1918 ms 525312 KB Execution killed with signal 9 (could be triggered by violating memory limits)
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5236 KB Output is correct
3 Correct 7 ms 5236 KB Output is correct
4 Correct 6 ms 5236 KB Output is correct
5 Correct 21 ms 8592 KB Output is correct
6 Correct 17 ms 8592 KB Output is correct
7 Correct 18 ms 8592 KB Output is correct
8 Correct 32 ms 12076 KB Output is correct
9 Correct 31 ms 12204 KB Output is correct
10 Correct 32 ms 12204 KB Output is correct
11 Correct 28 ms 12204 KB Output is correct
12 Correct 20 ms 12204 KB Output is correct
13 Correct 36 ms 12204 KB Output is correct
14 Correct 21 ms 12204 KB Output is correct
15 Correct 13 ms 12204 KB Output is correct
16 Correct 19 ms 12204 KB Output is correct
17 Correct 24 ms 12204 KB Output is correct
18 Correct 15 ms 12204 KB Output is correct
19 Correct 24 ms 12204 KB Output is correct
20 Correct 1562 ms 471792 KB Output is correct
21 Correct 1547 ms 471792 KB Output is correct
22 Correct 1491 ms 471792 KB Output is correct
23 Correct 1524 ms 471792 KB Output is correct
24 Runtime error 1918 ms 525312 KB Execution killed with signal 9 (could be triggered by violating memory limits)
25 Halted 0 ms 0 KB -