oj.uz

Submission #100695

# Submission time Handle Problem Language Result Execution time Memory
100695 2019-03-13T12:01:07 Z JPN20 Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1385 ms 119652 KB 
#include <bits/stdc++.h>
using namespace std;

const int BACKET = 60;
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>> vec1;

pair<int, int> G[1 << 17][120], I[12000000]; int SZ[1 << 17];
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 < SZ[pos]; 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] = 0;
	for (int i = 0; i < (int)vec.size(); i++) dp[vec[i]] = -1000000;
	
	for (int i = 0; i < M; i++) {
		dp[B[i]] = max(dp[B[i]], dp[A[i]] + 1);
	}
	return max(-1, dp[pos]);
}

void init() {
	for (int i = 1; i <= N; i++) {
		int cntv = 0, cnts = 0;
		for (int pos : Y[i]) {
			for (int k = 0; k < SZ[pos]; k++) {
				I[cntv] = make_pair(G[pos][k].first + 1, G[pos][k].second); cntv++;
			}
		}
		I[cntv] = make_pair(0, i); cntv++;
		sort(I, I + cntv, greater<pair<int, int>>());
		
		for (int j = 0; j < cntv; j++) {
			if (used[I[j].second] == false) { used[I[j].second] = true; G[i][cnts] = I[j]; cnts++; }
			if (cnts >= BACKET) break;
		}
		SZ[i] = cnts;
		
		for (int j = 0; j < cntv; j++) used[I[j].second] = false;
	}
}

int main(){
	//FILE *in = freopen("in1.txt", "r", stdin);
	//FILE *out = freopen("out1.txt", "w", stdout);
	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]);
		vec1.push_back(make_pair(A[i], B[i]));
	}
	sort(vec1.begin(), vec1.end());
	for (int i = 0; i < M; i++) {
		A[i] = vec1[i].first;
		B[i] = vec1[i].second;
	}
	
	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: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[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:75: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:77: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 13 ms 12672 KB Output is correct
2 Correct 15 ms 12672 KB Output is correct
3 Correct 15 ms 12672 KB Output is correct
4 Correct 14 ms 12672 KB Output is correct
5 Correct 17 ms 13696 KB Output is correct
6 Correct 20 ms 13696 KB Output is correct
7 Correct 17 ms 13696 KB Output is correct
8 Correct 17 ms 13696 KB Output is correct
9 Correct 17 ms 13824 KB Output is correct
10 Correct 20 ms 13696 KB Output is correct
11 Correct 19 ms 13688 KB Output is correct
12 Correct 18 ms 13696 KB Output is correct
13 Correct 23 ms 13680 KB Output is correct
14 Correct 21 ms 13680 KB Output is correct
15 Correct 19 ms 13824 KB Output is correct
16 Correct 20 ms 13824 KB Output is correct
17 Correct 20 ms 13696 KB Output is correct
18 Correct 17 ms 13696 KB Output is correct
19 Correct 19 ms 13668 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12672 KB Output is correct
2 Correct 15 ms 12672 KB Output is correct
3 Correct 15 ms 12672 KB Output is correct
4 Correct 14 ms 12672 KB Output is correct
5 Correct 17 ms 13696 KB Output is correct
6 Correct 20 ms 13696 KB Output is correct
7 Correct 17 ms 13696 KB Output is correct
8 Correct 17 ms 13696 KB Output is correct
9 Correct 17 ms 13824 KB Output is correct
10 Correct 20 ms 13696 KB Output is correct
11 Correct 19 ms 13688 KB Output is correct
12 Correct 18 ms 13696 KB Output is correct
13 Correct 23 ms 13680 KB Output is correct
14 Correct 21 ms 13680 KB Output is correct
15 Correct 19 ms 13824 KB Output is correct
16 Correct 20 ms 13824 KB Output is correct
17 Correct 20 ms 13696 KB Output is correct
18 Correct 17 ms 13696 KB Output is correct
19 Correct 19 ms 13668 KB Output is correct
20 Correct 849 ms 19300 KB Output is correct
21 Correct 833 ms 19340 KB Output is correct
22 Correct 878 ms 19432 KB Output is correct
23 Correct 871 ms 19688 KB Output is correct
24 Correct 652 ms 116452 KB Output is correct
25 Correct 672 ms 116468 KB Output is correct
26 Correct 739 ms 116392 KB Output is correct
27 Correct 438 ms 117732 KB Output is correct
28 Correct 418 ms 117716 KB Output is correct
29 Correct 402 ms 117720 KB Output is correct
30 Correct 436 ms 117096 KB Output is correct
31 Correct 548 ms 116992 KB Output is correct
32 Correct 456 ms 117248 KB Output is correct
33 Correct 489 ms 117092 KB Output is correct
34 Correct 557 ms 117348 KB Output is correct
35 Correct 576 ms 117092 KB Output is correct
36 Correct 520 ms 117220 KB Output is correct
37 Correct 573 ms 117380 KB Output is correct
38 Correct 528 ms 117360 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12672 KB Output is correct
2 Correct 15 ms 12672 KB Output is correct
3 Correct 15 ms 12672 KB Output is correct
4 Correct 14 ms 12672 KB Output is correct
5 Correct 17 ms 13696 KB Output is correct
6 Correct 20 ms 13696 KB Output is correct
7 Correct 17 ms 13696 KB Output is correct
8 Correct 17 ms 13696 KB Output is correct
9 Correct 17 ms 13824 KB Output is correct
10 Correct 20 ms 13696 KB Output is correct
11 Correct 19 ms 13688 KB Output is correct
12 Correct 18 ms 13696 KB Output is correct
13 Correct 23 ms 13680 KB Output is correct
14 Correct 21 ms 13680 KB Output is correct
15 Correct 19 ms 13824 KB Output is correct
16 Correct 20 ms 13824 KB Output is correct
17 Correct 20 ms 13696 KB Output is correct
18 Correct 17 ms 13696 KB Output is correct
19 Correct 19 ms 13668 KB Output is correct
20 Correct 849 ms 19300 KB Output is correct
21 Correct 833 ms 19340 KB Output is correct
22 Correct 878 ms 19432 KB Output is correct
23 Correct 871 ms 19688 KB Output is correct
24 Correct 652 ms 116452 KB Output is correct
25 Correct 672 ms 116468 KB Output is correct
26 Correct 739 ms 116392 KB Output is correct
27 Correct 438 ms 117732 KB Output is correct
28 Correct 418 ms 117716 KB Output is correct
29 Correct 402 ms 117720 KB Output is correct
30 Correct 436 ms 117096 KB Output is correct
31 Correct 548 ms 116992 KB Output is correct
32 Correct 456 ms 117248 KB Output is correct
33 Correct 489 ms 117092 KB Output is correct
34 Correct 557 ms 117348 KB Output is correct
35 Correct 576 ms 117092 KB Output is correct
36 Correct 520 ms 117220 KB Output is correct
37 Correct 573 ms 117380 KB Output is correct
38 Correct 528 ms 117360 KB Output is correct
39 Correct 740 ms 115784 KB Output is correct
40 Correct 701 ms 115428 KB Output is correct
41 Correct 1385 ms 115828 KB Output is correct
42 Correct 698 ms 118116 KB Output is correct
43 Correct 624 ms 117940 KB Output is correct
44 Correct 886 ms 21748 KB Output is correct
45 Correct 842 ms 21220 KB Output is correct
46 Correct 1091 ms 21220 KB Output is correct
47 Correct 889 ms 20968 KB Output is correct
48 Correct 874 ms 20988 KB Output is correct
49 Correct 504 ms 119508 KB Output is correct
50 Correct 1010 ms 119384 KB Output is correct
51 Correct 904 ms 21816 KB Output is correct
52 Correct 1087 ms 21200 KB Output is correct
53 Correct 569 ms 118884 KB Output is correct
54 Correct 668 ms 118884 KB Output is correct
55 Correct 956 ms 118912 KB Output is correct
56 Correct 1036 ms 118852 KB Output is correct
57 Correct 887 ms 21736 KB Output is correct
58 Correct 904 ms 22064 KB Output is correct
59 Correct 1070 ms 21220 KB Output is correct
60 Correct 1080 ms 21228 KB Output is correct
61 Correct 454 ms 119388 KB Output is correct
62 Correct 544 ms 118756 KB Output is correct
63 Correct 551 ms 118948 KB Output is correct
64 Correct 609 ms 119396 KB Output is correct
65 Correct 600 ms 118724 KB Output is correct
66 Correct 692 ms 118984 KB Output is correct
67 Correct 659 ms 119268 KB Output is correct
68 Correct 790 ms 118884 KB Output is correct
69 Correct 842 ms 118888 KB Output is correct
70 Correct 483 ms 119400 KB Output is correct
71 Correct 529 ms 118888 KB Output is correct
72 Correct 599 ms 119176 KB Output is correct
73 Correct 443 ms 119428 KB Output is correct
74 Correct 530 ms 118904 KB Output is correct
75 Correct 578 ms 119176 KB Output is correct
76 Correct 501 ms 119652 KB Output is correct
77 Correct 820 ms 119268 KB Output is correct
78 Correct 453 ms 119508 KB Output is correct
79 Correct 911 ms 21832 KB Output is correct
80 Correct 1036 ms 21348 KB Output is correct
81 Correct 909 ms 20836 KB Output is correct
82 Correct 545 ms 118876 KB Output is correct
83 Correct 796 ms 118596 KB Output is correct
84 Correct 916 ms 118760 KB Output is correct
85 Correct 950 ms 118744 KB Output is correct
86 Correct 484 ms 118824 KB Output is correct
87 Correct 508 ms 118856 KB Output is correct
88 Correct 917 ms 21872 KB Output is correct
89 Correct 944 ms 21864 KB Output is correct
90 Correct 1073 ms 21204 KB Output is correct
91 Correct 1055 ms 21220 KB Output is correct
92 Correct 851 ms 20752 KB Output is correct
93 Correct 870 ms 20964 KB Output is correct
94 Correct 676 ms 118880 KB Output is correct
95 Correct 552 ms 118772 KB Output is correct
96 Correct 870 ms 118756 KB Output is correct
97 Correct 873 ms 118756 KB Output is correct
98 Correct 532 ms 118884 KB Output is correct
99 Correct 478 ms 119056 KB Output is correct
100 Correct 846 ms 21884 KB Output is correct
101 Correct 873 ms 21908 KB Output is correct
102 Correct 1050 ms 21440 KB Output is correct
103 Correct 1054 ms 21460 KB Output is correct
104 Correct 805 ms 21064 KB Output is correct
105 Correct 855 ms 21200 KB Output is correct
106 Correct 554 ms 118884 KB Output is correct
107 Correct 628 ms 119240 KB Output is correct
108 Correct 865 ms 119028 KB Output is correct
109 Correct 888 ms 119140 KB Output is correct
110 Correct 542 ms 118984 KB Output is correct
111 Correct 689 ms 119344 KB Output is correct
112 Correct 1135 ms 21864 KB Output is correct
113 Correct 900 ms 22068 KB Output is correct
114 Correct 1018 ms 21344 KB Output is correct
115 Correct 1010 ms 21424 KB Output is correct
116 Correct 807 ms 20956 KB Output is correct
117 Correct 876 ms 21128 KB Output is correct
118 Correct 435 ms 119140 KB Output is correct
119 Correct 570 ms 118288 KB Output is correct
120 Correct 622 ms 118244 KB Output is correct
121 Correct 451 ms 118888 KB Output is correct
122 Correct 530 ms 118204 KB Output is correct
123 Correct 580 ms 118244 KB Output is correct
124 Correct 511 ms 119112 KB Output is correct
125 Correct 669 ms 118628 KB Output is correct
126 Correct 679 ms 118680 KB Output is correct