結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | uwi |
提出日時 | 2021-01-22 21:30:21 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 864 ms / 2,000 ms |
コード長 | 11,064 bytes |
コンパイル時間 | 4,444 ms |
コンパイル使用メモリ | 83,692 KB |
実行使用メモリ | 60,624 KB |
最終ジャッジ日時 | 2023-08-27 17:37:21 |
合計ジャッジ時間 | 54,812 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
50,692 KB |
testcase_01 | AC | 65 ms
50,516 KB |
testcase_02 | AC | 61 ms
51,176 KB |
testcase_03 | AC | 508 ms
57,608 KB |
testcase_04 | AC | 534 ms
40,976 KB |
testcase_05 | AC | 498 ms
41,204 KB |
testcase_06 | AC | 526 ms
41,292 KB |
testcase_07 | AC | 572 ms
42,568 KB |
testcase_08 | AC | 475 ms
40,956 KB |
testcase_09 | AC | 302 ms
39,188 KB |
testcase_10 | AC | 298 ms
39,784 KB |
testcase_11 | AC | 740 ms
41,724 KB |
testcase_12 | AC | 766 ms
41,660 KB |
testcase_13 | AC | 413 ms
42,428 KB |
testcase_14 | AC | 447 ms
57,252 KB |
testcase_15 | AC | 558 ms
60,624 KB |
testcase_16 | AC | 561 ms
58,364 KB |
testcase_17 | AC | 847 ms
58,412 KB |
testcase_18 | AC | 608 ms
58,392 KB |
testcase_19 | AC | 630 ms
58,952 KB |
testcase_20 | AC | 665 ms
58,576 KB |
testcase_21 | AC | 612 ms
58,680 KB |
testcase_22 | AC | 675 ms
58,596 KB |
testcase_23 | AC | 570 ms
58,108 KB |
testcase_24 | AC | 598 ms
58,468 KB |
testcase_25 | AC | 185 ms
54,336 KB |
testcase_26 | AC | 188 ms
54,592 KB |
testcase_27 | AC | 367 ms
55,296 KB |
testcase_28 | AC | 379 ms
55,272 KB |
testcase_29 | AC | 442 ms
56,496 KB |
testcase_30 | AC | 423 ms
56,264 KB |
testcase_31 | AC | 394 ms
57,112 KB |
testcase_32 | AC | 416 ms
57,420 KB |
testcase_33 | AC | 450 ms
56,636 KB |
testcase_34 | AC | 441 ms
56,856 KB |
testcase_35 | AC | 489 ms
58,256 KB |
testcase_36 | AC | 498 ms
57,996 KB |
testcase_37 | AC | 218 ms
56,036 KB |
testcase_38 | AC | 219 ms
55,180 KB |
testcase_39 | AC | 172 ms
54,452 KB |
testcase_40 | AC | 180 ms
54,784 KB |
testcase_41 | AC | 294 ms
55,596 KB |
testcase_42 | AC | 277 ms
55,784 KB |
testcase_43 | AC | 221 ms
55,512 KB |
testcase_44 | AC | 864 ms
57,724 KB |
testcase_45 | AC | 451 ms
56,752 KB |
testcase_46 | AC | 234 ms
55,840 KB |
testcase_47 | AC | 613 ms
58,372 KB |
testcase_48 | AC | 610 ms
42,188 KB |
testcase_49 | AC | 630 ms
41,928 KB |
testcase_50 | AC | 541 ms
41,440 KB |
testcase_51 | AC | 121 ms
37,380 KB |
testcase_52 | AC | 718 ms
41,728 KB |
testcase_53 | AC | 723 ms
41,584 KB |
testcase_54 | AC | 790 ms
43,008 KB |
testcase_55 | AC | 654 ms
43,060 KB |
testcase_56 | AC | 723 ms
42,044 KB |
testcase_57 | AC | 674 ms
58,316 KB |
testcase_58 | AC | 788 ms
57,520 KB |
testcase_59 | AC | 680 ms
57,572 KB |
testcase_60 | AC | 652 ms
58,132 KB |
testcase_61 | AC | 657 ms
57,396 KB |
testcase_62 | AC | 723 ms
57,896 KB |
testcase_63 | AC | 672 ms
57,584 KB |
testcase_64 | AC | 709 ms
58,956 KB |
testcase_65 | AC | 747 ms
56,244 KB |
testcase_66 | AC | 778 ms
58,152 KB |
testcase_67 | AC | 751 ms
58,000 KB |
testcase_68 | AC | 822 ms
58,624 KB |
testcase_69 | AC | 696 ms
57,972 KB |
testcase_70 | AC | 663 ms
57,720 KB |
testcase_71 | AC | 717 ms
59,040 KB |
testcase_72 | AC | 772 ms
57,660 KB |
testcase_73 | AC | 693 ms
57,872 KB |
testcase_74 | AC | 651 ms
57,652 KB |
testcase_75 | AC | 839 ms
56,852 KB |
testcase_76 | AC | 754 ms
56,784 KB |
testcase_77 | AC | 653 ms
57,548 KB |
ソースコード
package contest210122; import java.io.*; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; // B public class A { InputStream is; FastWriter out; String INPUT = ""; public void solve() { int n = ni(), K = ni(), M = ni(); int[][] a = new int[4][]; for(int i = 0;i < 4;i++){ a[i] = na(n); Arrays.sort(a[i]); } long ans = 0; for(int i= 0;i < n;i++){ int min = Integer.MAX_VALUE; int max = 0; for(int j = 0;j < 4;j++){ min = Math.min(min, a[j][i]); max = Math.max(max, a[j][i]); } ans += pow(max-min, K, M); } out.println(ans%M); } public static long pow(long a, long n, long mod) { a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } public static void main(String[] args) { new A().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)); } }