oj.uz

Submission #100689

# Submission time Handle Problem Language Result Execution time Memory
100689 2019-03-13T11:31:21 Z JPN20 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 129952 KB 
#include <bits/stdc++.h>
using namespace std;

const int BACKET = 100;
int N, M, Q, A[1 << 18], B[1 << 18], dp[1 << 18];
vector<int>X[1 << 18], Y[1 << 18];
vector<pair<int, int>> G[1 << 18];
bool used[1 << 18];

int melee_solve(int pos, vector<int>vec) {
	for (int i = 0; i < (int)vec.size(); i++) used[vec[i]] = true;
	
	int maxn = -1;
	for (int i = 0; i < (int)G[pos].size(); i++) {
		if (used[G[pos][i].second] == false) { maxn = max(maxn, G[pos][i].first); break; }
	}
	for (int i = 0; i < (int)vec.size(); i++) used[vec[i]] = false;
	return maxn;
}
int ranged_solve(int pos, vector<int>vec) {
	for (int i = 1; i <= N; i++) dp[i] = -1;
	for (int i = 0; i < (int)vec.size(); i++) used[vec[i]] = true;
	
	for (int i = 1; i <= N; i++) {
		if (used[i] == false) dp[i] = 0;
		for (int j = 0; j < (int)Y[i].size(); j++) {
			if (dp[Y[i][j]] == -1) continue;
			dp[i] = max(dp[i], dp[Y[i][j]] + 1);
		}
	}
	for (int i = 0; i < (int)vec.size(); i++) used[vec[i]] = false;
	return dp[pos];
}

void init() {
	for (int i = 1; i <= N; i++) {
		vector<pair<int, int>>Z;
		for (int j = 0; j < (int)Y[i].size(); j++) {
			for (int k = 0; k < (int)G[Y[i][j]].size(); k++) {
				Z.push_back(make_pair(G[Y[i][j]][k].first + 1, G[Y[i][j]][k].second));
			}
		}
		Z.push_back(make_pair(0, i));
		sort(Z.begin(), Z.end(), greater<pair<int, int>>());
		
		for (int j = 0; j < (int)Z.size(); j++) {
			if (used[Z[j].second] == false) { used[Z[j].second] = true; G[i].push_back(Z[j]); }
			if (G[i].size() >= BACKET) break;
		}
		
		for (int j = 0; j < (int)Z.size(); j++) used[Z[j].second] = false;
	}
}

int main(){
	scanf("%d%d%d", &N, &M, &Q);
	for (int i = 0; i < M; i++) {
		scanf("%d%d", &A[i], &B[i]);
		X[A[i]].push_back(B[i]);
		Y[B[i]].push_back(A[i]);
	}
	
	init();
	
	for (int i = 1; i <= Q; i++) {
		int P, S, C; vector<int>vec1;
		scanf("%d%d", &P, &S);
		for (int j = 0; j < S; j++) {
			scanf("%d", &C); vec1.push_back(C);
		}
		
		int ans = 0;
		if (S < BACKET) ans = melee_solve(P, vec1);
		else ans = ranged_solve(P, vec1);
		
		printf("%d\n", ans);
	}
	return 0;
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:56: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:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:67:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &P, &S);
   ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:69:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &C); vec1.push_back(C);
    ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 18816 KB Output is correct
2 Correct 16 ms 18816 KB Output is correct
3 Correct 17 ms 18816 KB Output is correct
4 Correct 17 ms 18816 KB Output is correct
5 Correct 22 ms 19328 KB Output is correct
6 Correct 24 ms 19328 KB Output is correct
7 Correct 24 ms 19300 KB Output is correct
8 Correct 25 ms 19968 KB Output is correct
9 Correct 26 ms 19960 KB Output is correct
10 Correct 26 ms 19840 KB Output is correct
11 Correct 34 ms 19836 KB Output is correct
12 Correct 26 ms 19584 KB Output is correct
13 Correct 29 ms 19832 KB Output is correct
14 Correct 31 ms 19456 KB Output is correct
15 Correct 24 ms 19456 KB Output is correct
16 Correct 30 ms 19584 KB Output is correct
17 Correct 23 ms 19584 KB Output is correct
18 Correct 32 ms 19456 KB Output is correct
19 Correct 29 ms 19584 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 18816 KB Output is correct
2 Correct 16 ms 18816 KB Output is correct
3 Correct 17 ms 18816 KB Output is correct
4 Correct 17 ms 18816 KB Output is correct
5 Correct 22 ms 19328 KB Output is correct
6 Correct 24 ms 19328 KB Output is correct
7 Correct 24 ms 19300 KB Output is correct
8 Correct 25 ms 19968 KB Output is correct
9 Correct 26 ms 19960 KB Output is correct
10 Correct 26 ms 19840 KB Output is correct
11 Correct 34 ms 19836 KB Output is correct
12 Correct 26 ms 19584 KB Output is correct
13 Correct 29 ms 19832 KB Output is correct
14 Correct 31 ms 19456 KB Output is correct
15 Correct 24 ms 19456 KB Output is correct
16 Correct 30 ms 19584 KB Output is correct
17 Correct 23 ms 19584 KB Output is correct
18 Correct 32 ms 19456 KB Output is correct
19 Correct 29 ms 19584 KB Output is correct
20 Correct 1687 ms 24360 KB Output is correct
21 Correct 1677 ms 24256 KB Output is correct
22 Correct 1684 ms 24508 KB Output is correct
23 Correct 1724 ms 25484 KB Output is correct
24 Correct 1284 ms 104304 KB Output is correct
25 Correct 1136 ms 105540 KB Output is correct
26 Correct 1166 ms 105720 KB Output is correct
27 Correct 941 ms 129952 KB Output is correct
28 Correct 992 ms 129824 KB Output is correct
29 Correct 1050 ms 129940 KB Output is correct
30 Correct 1078 ms 129244 KB Output is correct
31 Correct 1187 ms 127092 KB Output is correct
32 Correct 1091 ms 129268 KB Output is correct
33 Correct 947 ms 91560 KB Output is correct
34 Correct 848 ms 84208 KB Output is correct
35 Correct 883 ms 91144 KB Output is correct
36 Correct 1028 ms 110452 KB Output is correct
37 Correct 1083 ms 105748 KB Output is correct
38 Correct 1060 ms 110620 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 18816 KB Output is correct
2 Correct 16 ms 18816 KB Output is correct
3 Correct 17 ms 18816 KB Output is correct
4 Correct 17 ms 18816 KB Output is correct
5 Correct 22 ms 19328 KB Output is correct
6 Correct 24 ms 19328 KB Output is correct
7 Correct 24 ms 19300 KB Output is correct
8 Correct 25 ms 19968 KB Output is correct
9 Correct 26 ms 19960 KB Output is correct
10 Correct 26 ms 19840 KB Output is correct
11 Correct 34 ms 19836 KB Output is correct
12 Correct 26 ms 19584 KB Output is correct
13 Correct 29 ms 19832 KB Output is correct
14 Correct 31 ms 19456 KB Output is correct
15 Correct 24 ms 19456 KB Output is correct
16 Correct 30 ms 19584 KB Output is correct
17 Correct 23 ms 19584 KB Output is correct
18 Correct 32 ms 19456 KB Output is correct
19 Correct 29 ms 19584 KB Output is correct
20 Correct 1687 ms 24360 KB Output is correct
21 Correct 1677 ms 24256 KB Output is correct
22 Correct 1684 ms 24508 KB Output is correct
23 Correct 1724 ms 25484 KB Output is correct
24 Correct 1284 ms 104304 KB Output is correct
25 Correct 1136 ms 105540 KB Output is correct
26 Correct 1166 ms 105720 KB Output is correct
27 Correct 941 ms 129952 KB Output is correct
28 Correct 992 ms 129824 KB Output is correct
29 Correct 1050 ms 129940 KB Output is correct
30 Correct 1078 ms 129244 KB Output is correct
31 Correct 1187 ms 127092 KB Output is correct
32 Correct 1091 ms 129268 KB Output is correct
33 Correct 947 ms 91560 KB Output is correct
34 Correct 848 ms 84208 KB Output is correct
35 Correct 883 ms 91144 KB Output is correct
36 Correct 1028 ms 110452 KB Output is correct
37 Correct 1083 ms 105748 KB Output is correct
38 Correct 1060 ms 110620 KB Output is correct
39 Correct 1216 ms 104196 KB Output is correct
40 Correct 1184 ms 104436 KB Output is correct
41 Execution timed out 2061 ms 104912 KB Time limit exceeded
42 Halted 0 ms 0 KB -