Submission #4891005


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please

const int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
	if (ci - cn == cm) { fread(cn, 1, cm, stdin); ci = cn; }
	return *ci++;
}
inline int getint() {
	int A = 0;
	if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
	else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
	return A;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N = getint(), M = getint();
	int A[300][300];
	int R[300][300];
	rep(i, N) rep(j, M) {
		A[i][j] = getint();
		A[i][j]--;
		R[i][A[i][j]] = j;
	}

	bool C[300][310] = {};
	int doko[300] = {};
	int kotae = 1e9;
	rep(j, M) {
		int B[300] = {};
		rep(i, N) B[A[i][doko[i]]]++;
		auto saidaip = max_element(B, B + M);
		kotae = min(kotae, *saidaip);
		int kesu = saidaip - B;
		rep(i, N) {
			C[i][R[i][kesu]] = true;
			while (C[i][doko[i]]) doko[i]++;
		}
	}

	co(kotae);

	Would you please return 0;
}

Submission Info

Submission Time
Task B - Sports Festival
User uzzy
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1345 Byte
Status AC
Exec Time 3 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘char getcha()’:
./Main.cpp:19:46: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  if (ci - cn == cm) { fread(cn, 1, cm, stdin); ci = cn; }
                                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 24
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 AC 1 ms 384 KB
sample_02.txt AC 1 ms 384 KB
sample_03.txt AC 1 ms 384 KB
subtask_1_01.txt AC 1 ms 384 KB
subtask_1_02.txt AC 1 ms 640 KB
subtask_1_03.txt AC 1 ms 512 KB
subtask_1_04.txt AC 1 ms 640 KB
subtask_1_05.txt AC 1 ms 640 KB
subtask_1_06.txt AC 2 ms 1152 KB
subtask_1_07.txt AC 2 ms 1152 KB
subtask_1_08.txt AC 2 ms 1024 KB
subtask_1_09.txt AC 2 ms 1024 KB
subtask_1_10.txt AC 1 ms 512 KB
subtask_1_11.txt AC 2 ms 512 KB
subtask_1_12.txt AC 1 ms 384 KB
subtask_1_13.txt AC 2 ms 640 KB
subtask_1_14.txt AC 3 ms 1152 KB
subtask_1_15.txt AC 3 ms 1152 KB
subtask_1_16.txt AC 3 ms 1152 KB
subtask_1_17.txt AC 3 ms 1152 KB
subtask_1_18.txt AC 3 ms 1152 KB