Submission #1446753


Source Code Expand

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair < int, int > pii;

inline int Read()
{
	int x = 0, f = 1, c = getchar();
	for (; !isdigit(c); c = getchar())
		if (c == '-')
			f = -1;
	for (;  isdigit(c); c = getchar())
		x = x * 10 + c - '0';
	return x * f;
}

const int MAXN = 305;

int n, m, a[MAXN][MAXN], ans, chs[MAXN];
bool v[MAXN];

inline void Solve()
{
	pii ret = mp(0, 0);
	for (int i = 1; i <= m; i ++)
		chs[i] = 0;
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= m; j ++)
			if (v[a[i][j]])
			{
				chs[a[i][j]] ++;
				break;
			}
	for (int i = 1; i <= m; i ++)
		ret = max(ret, mp(chs[i], i));
	ans = min(ans, ret.xx);
	v[ret.yy] = 0;
}

int main()
{
#ifdef wxh010910
	freopen("data.in", "r", stdin);
#endif
	ans = n = Read(), m = Read();
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= m; j ++)
			a[i][j] = Read();
	for (int i = 1; i <= n; i ++)
		v[i] = 1;
	for (int i = m; i >= 1; i --)
		Solve();
	return printf("%d\n", ans), 0;
}

Submission Info

Submission Time
Task B - Sports Festival
User wxh010910
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1221 Byte
Status WA
Exec Time 15 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 1
WA × 2
AC × 15
WA × 9
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt
Case Name Status Exec Time Memory
sample_01.txt WA 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 384 KB
subtask_1_03.txt WA 2 ms 256 KB
subtask_1_04.txt AC 2 ms 384 KB
subtask_1_05.txt AC 1 ms 384 KB
subtask_1_06.txt AC 2 ms 640 KB
subtask_1_07.txt AC 3 ms 640 KB
subtask_1_08.txt AC 2 ms 640 KB
subtask_1_09.txt AC 1 ms 640 KB
subtask_1_10.txt WA 3 ms 256 KB
subtask_1_11.txt WA 5 ms 256 KB
subtask_1_12.txt WA 2 ms 256 KB
subtask_1_13.txt WA 7 ms 384 KB
subtask_1_14.txt AC 5 ms 640 KB
subtask_1_15.txt AC 13 ms 640 KB
subtask_1_16.txt AC 6 ms 640 KB
subtask_1_17.txt AC 8 ms 640 KB
subtask_1_18.txt AC 15 ms 640 KB