Submission #71830216

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int N = 110;

#define int long long

int n, m, k, a[N][N], b[N];
bool st[N];

signed main() {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; ++ i )
		for (int j = 1; j <= m; ++ j ) cin >> a[i][j];
	for (int i = 1; i <= k; ++ i ) cin >> b[i], st[b[i]] = true;
	
	int res = 0;
	for (int i = 1; i <= n; ++ i ) {
		int cnt = 0;
		for (int j = 1; j <= m; ++ j ) cnt += st[a[i][j]];
		res = max(res, cnt);
	}
	cout << res;
	
	return 0;
}

Submission Info

Submission Time
Task B - Tombola
User huk2
Language C++23 (GCC 15.2.0)
Score 200
Code Size 510 Byte
Status AC
Exec Time 2 ms
Memory 3652 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 20
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 2 ms 3576 KiB
00-sample-02.txt AC 1 ms 3552 KiB
00-sample-03.txt AC 1 ms 3360 KiB
01-01.txt AC 1 ms 3480 KiB
01-02.txt AC 1 ms 3592 KiB
01-03.txt AC 1 ms 3652 KiB
01-04.txt AC 1 ms 3584 KiB
01-05.txt AC 1 ms 3500 KiB
01-06.txt AC 1 ms 3356 KiB
01-07.txt AC 1 ms 3500 KiB
01-08.txt AC 1 ms 3360 KiB
01-09.txt AC 1 ms 3652 KiB
01-10.txt AC 1 ms 3420 KiB
01-11.txt AC 1 ms 3472 KiB
01-12.txt AC 1 ms 3548 KiB
01-13.txt AC 1 ms 3500 KiB
01-14.txt AC 1 ms 3360 KiB
01-15.txt AC 1 ms 3592 KiB
01-16.txt AC 1 ms 3612 KiB
01-17.txt AC 1 ms 3612 KiB