結果
問題 | No.1354 Sambo's Treasure |
ユーザー | uwi |
提出日時 | 2021-01-17 14:03:21 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 13,409 bytes |
コンパイル時間 | 5,024 ms |
コンパイル使用メモリ | 92,260 KB |
実行使用メモリ | 63,988 KB |
最終ジャッジ日時 | 2024-11-29 15:17:00 |
合計ジャッジ時間 | 21,875 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
53,492 KB |
testcase_01 | AC | 110 ms
53,444 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 110 ms
53,416 KB |
testcase_08 | WA | - |
testcase_09 | AC | 111 ms
53,588 KB |
testcase_10 | WA | - |
testcase_11 | AC | 111 ms
53,644 KB |
testcase_12 | AC | 111 ms
53,248 KB |
testcase_13 | AC | 110 ms
53,492 KB |
testcase_14 | AC | 112 ms
53,696 KB |
testcase_15 | WA | - |
testcase_16 | AC | 112 ms
53,764 KB |
testcase_17 | AC | 110 ms
53,264 KB |
testcase_18 | AC | 110 ms
53,304 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 111 ms
53,624 KB |
testcase_22 | AC | 111 ms
53,588 KB |
testcase_23 | AC | 269 ms
62,812 KB |
testcase_24 | AC | 269 ms
63,432 KB |
testcase_25 | AC | 482 ms
63,548 KB |
testcase_26 | AC | 452 ms
62,764 KB |
testcase_27 | AC | 411 ms
62,800 KB |
testcase_28 | AC | 242 ms
61,900 KB |
testcase_29 | AC | 427 ms
63,408 KB |
testcase_30 | AC | 453 ms
63,908 KB |
testcase_31 | AC | 398 ms
62,772 KB |
testcase_32 | AC | 457 ms
63,988 KB |
testcase_33 | AC | 260 ms
62,692 KB |
testcase_34 | AC | 417 ms
62,628 KB |
testcase_35 | AC | 259 ms
63,048 KB |
testcase_36 | AC | 450 ms
63,584 KB |
testcase_37 | AC | 270 ms
62,860 KB |
testcase_38 | AC | 443 ms
62,736 KB |
testcase_39 | AC | 462 ms
63,624 KB |
testcase_40 | AC | 468 ms
63,496 KB |
testcase_41 | AC | 244 ms
62,056 KB |
testcase_42 | AC | 505 ms
63,784 KB |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | AC | 177 ms
56,224 KB |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | AC | 175 ms
56,392 KB |
testcase_57 | AC | 200 ms
56,304 KB |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | AC | 174 ms
55,988 KB |
testcase_62 | WA | - |
testcase_63 | AC | 432 ms
62,848 KB |
ソースコード
package nada2021d2; import java.io.*; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; // 最後のサンプルあわない public class E { InputStream is; FastWriter out; String INPUT = ""; static final int mod = 998244353; int[][] fif = enumFIF(400000, mod); public static int[][] enumFIF(int n, int mod) { int[] f = new int[n + 1]; int[] invf = new int[n + 1]; f[0] = 1; for (int i = 1; i <= n; i++) { f[i] = (int) ((long) f[i - 1] * i % mod); } long a = f[n]; long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } invf[n] = (int) (p < 0 ? p + mod : p); for (int i = n - 1; i >= 0; i--) { invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod); } return new int[][]{f, invf}; } public void solve() { int n = ni(), m = ni(), L = ni(), K = Math.min(L, ni()); int[] xc = new int[m+2]; int[] yc = new int[m+2]; for(int i = 0;i < m;i++){ xc[i+1] = ni(); yc[i+1] = ni(); } xc[m+1] = yc[m+1] = n; int[][] xt = new int[L][]; for(int i = 0;i < L;i++){ xt[i] = new int[]{ni(), ni()}; } Arrays.sort(xt, (x, y) -> { if (x[0] != y[0]) return x[0] - y[0]; return (x[1] - y[1]); }); long[] dp = new long[1]; dp[0] = 1; int p = 0; for(int i = 1;i < m+2;i++){ int op = p; while(p < L && (xt[p][0] < xc[i] || xt[p][0] == xc[i] && xt[p][1] <= yc[i])){ p++; } int[][] cos = new int[p-op+2][]; cos[0] = new int[]{xc[i-1], yc[i-1]}; cos[p-op+1] = new int[]{xc[i], yc[i]}; for(int j = op;j < p;j++){ cos[j-op+1] = xt[j]; } long[] made = make(cos); tr(made, cos); dp = mulnaive(dp, made, K+1); tr(dp); } long ans = 0; for(int i = 0;i < dp.length;i++){ ans += dp[i]; } out.println(ans%mod); } public static long C(int n, int r, int mod, int[][] fif) { if (n < 0 || r < 0 || r > n) return 0; return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod; } long[] make(int[][] cos) { int n = cos.length; long[][] dp = new long[n][n]; dp[0][0] = 1; for(int j = 1;j < n;j++){ for(int k = n-2;k >= 0;k--){ for(int l = 0;l < j;l++){ int[] F = cos[l], T = cos[j]; dp[j][k+1] += dp[l][k] * C(T[0]-F[0]+T[1]-F[1], T[0]-F[0], mod, fif); dp[j][k+1] %= mod; } } } for(int i = 1;i < n;i++){ dp[n-1][i-1] -= dp[n-1][i]; if(dp[n-1][i-1] < 0)dp[n-1][i-1] += mod; } return Arrays.copyOfRange(dp[n-1], 1, n); } public static final long big = (Long.MAX_VALUE/mod/mod-1)*mod*mod; public static long[] mulnaive(long[] a, long[] b) { long[] c = new long[a.length+b.length-1]; for(int i = 0;i < a.length;i++){ for(int j = 0;j < b.length;j++){ c[i+j] += a[i]*b[j]; if(c[i+j] >= big)c[i+j] -= big; } } for(int i = 0;i < c.length;i++)c[i] %= mod; return c; } public static long[] mulnaive(long[] a, long[] b, int lim) { long[] c = new long[lim]; for(int i = 0;i < a.length;i++){ for(int j = 0;j < b.length && i+j < lim;j++){ c[i+j] += a[i]*b[j]; if(c[i+j] >= big)c[i+j] -= big; } } for(int i = 0;i < c.length;i++)c[i] %= mod; return c; } public static void main(String[] args) { new E().run(); } public void run() { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new FastWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } private boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private final byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } // private boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } public static class FastWriter { private static final int BUF_SIZE = 1<<13; private final byte[] buf = new byte[BUF_SIZE]; private final OutputStream out; private int ptr = 0; private FastWriter(){out = null;} public FastWriter(OutputStream os) { this.out = os; } public FastWriter(String path) { try { this.out = new FileOutputStream(path); } catch (FileNotFoundException e) { throw new RuntimeException("FastWriter"); } } public FastWriter write(byte b) { buf[ptr++] = b; if(ptr == BUF_SIZE)innerflush(); return this; } public FastWriter write(char c) { return write((byte)c); } public FastWriter write(char[] s) { for(char c : s){ buf[ptr++] = (byte)c; if(ptr == BUF_SIZE)innerflush(); } return this; } public FastWriter write(String s) { s.chars().forEach(c -> { buf[ptr++] = (byte)c; if(ptr == BUF_SIZE)innerflush(); }); return this; } private static int countDigits(int l) { if (l >= 1000000000) return 10; if (l >= 100000000) return 9; if (l >= 10000000) return 8; if (l >= 1000000) return 7; if (l >= 100000) return 6; if (l >= 10000) return 5; if (l >= 1000) return 4; if (l >= 100) return 3; if (l >= 10) return 2; return 1; } public FastWriter write(int x) { if(x == Integer.MIN_VALUE){ return write((long)x); } if(ptr + 12 >= BUF_SIZE)innerflush(); if(x < 0){ write((byte)'-'); x = -x; } int d = countDigits(x); for(int i = ptr + d - 1;i >= ptr;i--){ buf[i] = (byte)('0'+x%10); x /= 10; } ptr += d; return this; } private static int countDigits(long l) { if (l >= 1000000000000000000L) return 19; if (l >= 100000000000000000L) return 18; if (l >= 10000000000000000L) return 17; if (l >= 1000000000000000L) return 16; if (l >= 100000000000000L) return 15; if (l >= 10000000000000L) return 14; if (l >= 1000000000000L) return 13; if (l >= 100000000000L) return 12; if (l >= 10000000000L) return 11; if (l >= 1000000000L) return 10; if (l >= 100000000L) return 9; if (l >= 10000000L) return 8; if (l >= 1000000L) return 7; if (l >= 100000L) return 6; if (l >= 10000L) return 5; if (l >= 1000L) return 4; if (l >= 100L) return 3; if (l >= 10L) return 2; return 1; } public FastWriter write(long x) { if(x == Long.MIN_VALUE){ return write("" + x); } if(ptr + 21 >= BUF_SIZE)innerflush(); if(x < 0){ write((byte)'-'); x = -x; } int d = countDigits(x); for(int i = ptr + d - 1;i >= ptr;i--){ buf[i] = (byte)('0'+x%10); x /= 10; } ptr += d; return this; } public FastWriter write(double x, int precision) { if(x < 0){ write('-'); x = -x; } x += Math.pow(10, -precision)/2; // if(x < 0){ x = 0; } write((long)x).write("."); x -= (long)x; for(int i = 0;i < precision;i++){ x *= 10; write((char)('0'+(int)x)); x -= (int)x; } return this; } public FastWriter writeln(char c){ return write(c).writeln(); } public FastWriter writeln(int x){ return write(x).writeln(); } public FastWriter writeln(long x){ return write(x).writeln(); } public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); } public FastWriter write(int... xs) { boolean first = true; for(int x : xs) { if (!first) write(' '); first = false; write(x); } return this; } public FastWriter write(long... xs) { boolean first = true; for(long x : xs) { if (!first) write(' '); first = false; write(x); } return this; } public FastWriter writeln() { return write((byte)'\n'); } public FastWriter writeln(int... xs) { return write(xs).writeln(); } public FastWriter writeln(long... xs) { return write(xs).writeln(); } public FastWriter writeln(char[] line) { return write(line).writeln(); } public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln(); return this; } public FastWriter writeln(String s) { return write(s).writeln(); } private void innerflush() { try { out.write(buf, 0, ptr); ptr = 0; } catch (IOException e) { throw new RuntimeException("innerflush"); } } public void flush() { innerflush(); try { out.flush(); } catch (IOException e) { throw new RuntimeException("flush"); } } public FastWriter print(byte b) { return write(b); } public FastWriter print(char c) { return write(c); } public FastWriter print(char[] s) { return write(s); } public FastWriter print(String s) { return write(s); } public FastWriter print(int x) { return write(x); } public FastWriter print(long x) { return write(x); } public FastWriter print(double x, int precision) { return write(x, precision); } public FastWriter println(char c){ return writeln(c); } public FastWriter println(int x){ return writeln(x); } public FastWriter println(long x){ return writeln(x); } public FastWriter println(double x, int precision){ return writeln(x, precision); } public FastWriter print(int... xs) { return write(xs); } public FastWriter print(long... xs) { return write(xs); } public FastWriter println(int... xs) { return writeln(xs); } public FastWriter println(long... xs) { return writeln(xs); } public FastWriter println(char[] line) { return writeln(line); } public FastWriter println(char[]... map) { return writeln(map); } public FastWriter println(String s) { return writeln(s); } public FastWriter println() { return writeln(); } } public static void trnz(int... o) { for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" "); System.out.println(); } // print ids which are 1 public static void trt(long... o) { Queue<Integer> stands = new ArrayDeque<>(); for(int i = 0;i < o.length;i++){ for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x)); } System.out.println(stands); } public static void tf(boolean... r) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } public static void tf(boolean[]... b) { for(boolean[] r : b) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } System.out.println(); } public void tf(long[]... b) { if(INPUT.length() != 0) { for (long[] r : b) { for (long x : r) { for (int i = 0; i < 64; i++) { System.out.print(x << ~i < 0 ? '#' : '.'); } } System.out.println(); } System.out.println(); } } public void tf(long... b) { if(INPUT.length() != 0) { for (long x : b) { for (int i = 0; i < 64; i++) { System.out.print(x << ~i < 0 ? '#' : '.'); } } System.out.println(); } } private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }