結果
問題 | No.506 限られたジャパリまん |
ユーザー | Grenache |
提出日時 | 2017-04-21 23:45:06 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 484 ms / 2,000 ms |
コード長 | 5,346 bytes |
コンパイル時間 | 3,828 ms |
コンパイル使用メモリ | 75,384 KB |
実行使用メモリ | 56,084 KB |
最終ジャッジ日時 | 2023-09-10 12:52:48 |
合計ジャッジ時間 | 9,153 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,344 KB |
testcase_01 | AC | 47 ms
49,412 KB |
testcase_02 | AC | 47 ms
49,460 KB |
testcase_03 | AC | 45 ms
49,332 KB |
testcase_04 | AC | 455 ms
55,748 KB |
testcase_05 | AC | 458 ms
55,320 KB |
testcase_06 | AC | 44 ms
49,368 KB |
testcase_07 | AC | 50 ms
49,440 KB |
testcase_08 | AC | 192 ms
55,712 KB |
testcase_09 | AC | 155 ms
55,124 KB |
testcase_10 | AC | 68 ms
51,196 KB |
testcase_11 | AC | 288 ms
55,836 KB |
testcase_12 | AC | 209 ms
55,380 KB |
testcase_13 | AC | 45 ms
49,440 KB |
testcase_14 | AC | 74 ms
51,800 KB |
testcase_15 | AC | 44 ms
49,168 KB |
testcase_16 | AC | 180 ms
53,824 KB |
testcase_17 | AC | 144 ms
54,224 KB |
testcase_18 | AC | 249 ms
55,508 KB |
testcase_19 | AC | 76 ms
53,704 KB |
testcase_20 | AC | 300 ms
55,932 KB |
testcase_21 | AC | 294 ms
55,936 KB |
testcase_22 | AC | 484 ms
56,084 KB |
testcase_23 | AC | 208 ms
55,444 KB |
testcase_24 | AC | 54 ms
49,720 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder506 { private static Scanner sc; private static Printer pr; private static void solve() { int h = sc.nextInt(); int w = sc.nextInt(); int k = sc.nextInt(); int p = sc.nextInt(); int[] x = new int[k]; int[] y = new int[k]; String[] n = new String[k]; for (int i = 0; i < k; i++) { y[i] = sc.nextInt(); x[i] = sc.nextInt(); n[i] = sc.next(); } long ret = 0; int retm = 0; for (int mask = 0; mask < 0x1 << k; mask++) { if (Integer.bitCount(mask) > p) { continue; } long[][] maze = new long[h + 1][w + 1]; for (int i = 0; i < k; i++) { if ((mask & (0x1 << i)) == 0) { maze[y[i]][x[i]] = -1; } } long tmp = cnt(maze); if (tmp > ret) { ret = Math.max(ret, tmp); retm = mask; } } pr.println(ret % 1_000_000_007); for (int i = 0; i < k; i++) { if ((retm & (0x1 << i)) != 0) { pr.println(n[i]); } } } private static long cnt(long[][] maze) { if (maze[0][0] == -1) { return 0; } int[] dx = {1, 0}; int[] dy = {0, 1}; int h = maze.length; int w = maze[0].length; maze[0][0] = 1; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { if (maze[i][j] == -1) { continue; } for (int k = 0, size = dx.length; k < size; k++) { int nx = j + dx[k]; int ny = i + dy[k]; if (nx < 0 || nx >= w || ny < 0 || ny >= h) { continue; } if (maze[ny][nx] != -1) { maze[ny][nx] += maze[i][j]; } } } } if (maze[h - 1][w - 1] == -1) { return 0; } else { return maze[h - 1][w - 1]; } } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }