oj.uz

Submission #114933

# Submission time Handle Problem Language Result Execution time Memory
114933 2019-06-04T04:23:18 Z PeppaPig Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 1004 ms 524288 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1e5+5;
const int B = 320;

int n, m, q;
int dp[N], chk[N];
vector<int> g[N];

void solve(vector<int> &v) {
	fill_n(dp, N, -1e9);
	memset(chk, 0, sizeof chk);
	for(int i : v) chk[i] = true;
	for(int u = 1; u <= n; u++) {
		if(!chk[u]) dp[u] = max(dp[u], 0);
		if(dp[u] == -1e9) continue;
		for(int v : g[u]) dp[v] = max(dp[v], dp[u] + 1);
	}
}

vector<pii> merge(vector<pii> a, vector<pii> b) {
	vector<pii> ret;
	int l = 0, r = 0;
	while(l < B && r < B) {
		if(a[l] > b[r]) ret.emplace_back(a[l++]);
		else ret.emplace_back(b[r++]);
	}
	while(l < B) ret.emplace_back(a[l++]);
	while(r < B) ret.emplace_back(b[r++]);
	ret.resize(B);
	return ret;
}

vector<pii> pre[N];

void preprocess() {
	for(int i = 1; i <= n; i++) {
		pre[i] = vector<pii>(B, pii(-1, -1));
		pre[i][0] = pii(0, i);
	}
	for(int u = 1; u <= n; u++) for(int v : g[u]) {
		vector<pii> now(B, pii(-1, -1));
		for(int i = 0; i < B; i++) if(pre[u][i].x != -1) 
			now[i] = pii(pre[u][i].x + 1, pre[u][i].y);
		pre[v] = merge(now, pre[v]);
	}
}

bitset<N> tchk;

int main() {
	scanf("%d %d %d", &n, &m, &q);
	for(int i = 1, a, b; i <= m; i++) {
		scanf("%d %d", &a, &b);
		if(a > b) swap(a, b);
		g[a].emplace_back(b);
	}
	preprocess();
	for(int i = 1, t, y; i <= q; i++) {
		scanf("%d %d", &t, &y);
		vector<int> block;
		for(int i = 1, a; i <= y; i++) {
			scanf("%d", &a);
			block.emplace_back(a);
		}
		if(y >= B) {
			solve(block);
			if(dp[t] != -1e9) printf("%d\n", dp[t]);
			else printf("-1\n");
		} else {
			bool valid = false;
			for(int i : block) tchk[i] = true;
			for(int i = 0; i < B; i++) if(pre[t][i] != pii(-1, -1) && !tchk[pre[t][i].y]) {
				valid = true;
				printf("%d\n", pre[t][i].x);
				break;
			}
			if(!valid) printf("-1\n");
			for(int i : block) tchk[i] = false;
		}
	}

	return 0;
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:58: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:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t, &y);
   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:69:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
    ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 27 ms 13816 KB Output is correct
6 Correct 27 ms 13688 KB Output is correct
7 Correct 24 ms 13812 KB Output is correct
8 Correct 23 ms 14072 KB Output is correct
9 Correct 24 ms 14080 KB Output is correct
10 Correct 23 ms 14180 KB Output is correct
11 Correct 23 ms 14200 KB Output is correct
12 Correct 24 ms 14336 KB Output is correct
13 Correct 26 ms 14200 KB Output is correct
14 Correct 24 ms 13560 KB Output is correct
15 Correct 24 ms 13560 KB Output is correct
16 Correct 23 ms 13560 KB Output is correct
17 Correct 23 ms 13824 KB Output is correct
18 Correct 24 ms 13796 KB Output is correct
19 Correct 22 ms 13816 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 27 ms 13816 KB Output is correct
6 Correct 27 ms 13688 KB Output is correct
7 Correct 24 ms 13812 KB Output is correct
8 Correct 23 ms 14072 KB Output is correct
9 Correct 24 ms 14080 KB Output is correct
10 Correct 23 ms 14180 KB Output is correct
11 Correct 23 ms 14200 KB Output is correct
12 Correct 24 ms 14336 KB Output is correct
13 Correct 26 ms 14200 KB Output is correct
14 Correct 24 ms 13560 KB Output is correct
15 Correct 24 ms 13560 KB Output is correct
16 Correct 23 ms 13560 KB Output is correct
17 Correct 23 ms 13824 KB Output is correct
18 Correct 24 ms 13796 KB Output is correct
19 Correct 22 ms 13816 KB Output is correct
20 Correct 1004 ms 15236 KB Output is correct
21 Correct 950 ms 15352 KB Output is correct
22 Correct 960 ms 15352 KB Output is correct
23 Correct 940 ms 15484 KB Output is correct
24 Runtime error 776 ms 524288 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 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 27 ms 13816 KB Output is correct
6 Correct 27 ms 13688 KB Output is correct
7 Correct 24 ms 13812 KB Output is correct
8 Correct 23 ms 14072 KB Output is correct
9 Correct 24 ms 14080 KB Output is correct
10 Correct 23 ms 14180 KB Output is correct
11 Correct 23 ms 14200 KB Output is correct
12 Correct 24 ms 14336 KB Output is correct
13 Correct 26 ms 14200 KB Output is correct
14 Correct 24 ms 13560 KB Output is correct
15 Correct 24 ms 13560 KB Output is correct
16 Correct 23 ms 13560 KB Output is correct
17 Correct 23 ms 13824 KB Output is correct
18 Correct 24 ms 13796 KB Output is correct
19 Correct 22 ms 13816 KB Output is correct
20 Correct 1004 ms 15236 KB Output is correct
21 Correct 950 ms 15352 KB Output is correct
22 Correct 960 ms 15352 KB Output is correct
23 Correct 940 ms 15484 KB Output is correct
24 Runtime error 776 ms 524288 KB Execution killed with signal 9 (could be triggered by violating memory limits)
25 Halted 0 ms 0 KB -