Create a gist now

Instantly share code, notes, and snippets.

What would you like to do?
B - Sports Festival
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.stream.IntStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.util.OptionalInt;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author tanzaku
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
MyInput in = new MyInput(inputStream);
PrintWriter out = new PrintWriter(outputStream);
TaskB solver = new TaskB();
solver.solve(1, in, out);
out.close();
}
static class TaskB {
public void solve(int testNumber, MyInput in, PrintWriter out) {
int n = in.nextInt();
int m = in.nextInt();
int[][] A = in.nextIntArray2D(n, m);
int[] cur = new int[n];
boolean[] removed = new boolean[m];
int ans = n;
for (int i = 0; i < m - 1; i++) {
int[] cnt = new int[m];
for (int j = 0; j < n; j++) {
cnt[A[j][cur[j]] - 1]++;
}
int max = Arrays.stream(cnt).max().getAsInt();
for (int j = 0; j < m; j++) {
if (max != cnt[j]) continue;
removed[j] = true;
for (int k = 0; k < n; k++) {
while (removed[A[k][cur[k]] - 1]) {
cur[k]++;
}
}
break;
}
ans = Math.min(ans, max);
}
out.println(ans);
}
}
static class MyInput {
private final BufferedReader in;
private static int pos;
private static int readLen;
private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500 * 8 * 2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static {
for (int i = 0; i < 10; i++) {
isDigit['0' + i] = true;
}
isDigit['-'] = true;
isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
isLineSep['\r'] = isLineSep['\n'] = true;
}
public MyInput(InputStream is) {
in = new BufferedReader(new InputStreamReader(is));
}
public int read() {
if (pos >= readLen) {
pos = 0;
try {
readLen = in.read(buffer);
} catch (IOException e) {
throw new RuntimeException();
}
if (readLen <= 0) {
throw new MyInput.EndOfFileRuntimeException();
}
}
return buffer[pos++];
}
public int nextInt() {
int len = 0;
str[len++] = nextChar();
len = reads(len, isSpace);
int i = 0;
int ret = 0;
if (str[0] == '-') {
i = 1;
}
for (; i < len; i++) ret = ret * 10 + str[i] - '0';
if (str[0] == '-') {
ret = -ret;
}
return ret;
}
public char nextChar() {
while (true) {
final int c = read();
if (!isSpace[c]) {
return (char) c;
}
}
}
int reads(int len, boolean[] accept) {
try {
while (true) {
final int c = read();
if (accept[c]) {
break;
}
if (str.length == len) {
char[] rep = new char[str.length * 3 / 2];
System.arraycopy(str, 0, rep, 0, str.length);
str = rep;
}
str[len++] = (char) c;
}
} catch (MyInput.EndOfFileRuntimeException e) {
}
return len;
}
public int[] nextIntArray(final int n) {
final int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[][] nextIntArray2D(final int n, final int k) {
final int[][] res = new int[n][];
for (int i = 0; i < n; i++) {
res[i] = nextIntArray(k);
}
return res;
}
static class EndOfFileRuntimeException extends RuntimeException {
}
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment