結果
問題 | No.709 優勝可能性 |
ユーザー |
![]() |
提出日時 | 2018-06-29 23:43:01 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,007 ms / 3,500 ms |
コード長 | 3,188 bytes |
コンパイル時間 | 2,491 ms |
コンパイル使用メモリ | 88,520 KB |
実行使用メモリ | 78,884 KB |
最終ジャッジ日時 | 2024-07-01 00:24:41 |
合計ジャッジ時間 | 14,284 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
public class Main { private static void solve() { int n = ni(); int m = ni(); int[][] r = ntable(n, m); int[] max = new int[m]; int[] cnt = new int[1 << m]; int ret = 0; for (int i = 0; i < n; i ++) { int b = 0; int c = 0; for (int j = 0; j < m; j ++) { if (r[i][j] == max[j]) { c |= 1 << j; } else if (r[i][j] > max[j]) { b |= 1 << j; max[j] = r[i][j]; } } if (b > 0) { for (int j = 0; j < (1 << m); j ++) { if ((j & b) == 0) continue; if ((j & (~b)) == 0) { ret -= cnt[j]; } cnt[j & (~b)] += cnt[j]; cnt[j] = 0; } } cnt[c | b] ++; if ((c | b) > 0) { ret ++; } System.out.println(ret); } } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }