結果
問題 | No.991 N×Mマス計算(構築) |
ユーザー | uwi |
提出日時 | 2020-02-14 21:54:11 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 197 ms / 2,000 ms |
コード長 | 4,001 bytes |
コンパイル時間 | 3,966 ms |
コンパイル使用メモリ | 81,096 KB |
実行使用メモリ | 55,868 KB |
最終ジャッジ日時 | 2024-10-06 11:31:30 |
合計ジャッジ時間 | 8,949 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,280 KB |
testcase_01 | AC | 104 ms
52,840 KB |
testcase_02 | AC | 94 ms
52,856 KB |
testcase_03 | AC | 93 ms
52,796 KB |
testcase_04 | AC | 102 ms
52,640 KB |
testcase_05 | AC | 194 ms
55,868 KB |
testcase_06 | AC | 94 ms
52,940 KB |
testcase_07 | AC | 92 ms
52,668 KB |
testcase_08 | AC | 92 ms
52,604 KB |
testcase_09 | AC | 91 ms
53,004 KB |
testcase_10 | AC | 93 ms
52,768 KB |
testcase_11 | AC | 137 ms
52,984 KB |
testcase_12 | AC | 104 ms
52,816 KB |
testcase_13 | AC | 178 ms
53,740 KB |
testcase_14 | AC | 94 ms
52,760 KB |
testcase_15 | AC | 89 ms
52,736 KB |
testcase_16 | AC | 141 ms
53,384 KB |
testcase_17 | AC | 107 ms
52,924 KB |
testcase_18 | AC | 106 ms
52,884 KB |
testcase_19 | AC | 94 ms
52,824 KB |
testcase_20 | AC | 92 ms
52,588 KB |
testcase_21 | AC | 99 ms
53,032 KB |
testcase_22 | AC | 110 ms
52,924 KB |
testcase_23 | AC | 180 ms
55,740 KB |
testcase_24 | AC | 91 ms
52,812 KB |
testcase_25 | AC | 159 ms
53,616 KB |
testcase_26 | AC | 92 ms
52,588 KB |
testcase_27 | AC | 105 ms
52,872 KB |
testcase_28 | AC | 197 ms
55,756 KB |
testcase_29 | AC | 107 ms
52,864 KB |
ソースコード
package contest200214; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class F { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int X = ni(); if(X == 0) { out.println("1 2 6"); out.println("+ 1 1"); out.println("2"); return; } int[] f = find(X); int n = f[0], m = f[1]; out.println(f[0] + " " + f[1] + " " + 1000000000); out.print("*"); for(int i = 0;i < m-f[3];i++) { out.print(" " + 1000000000); } long y = X; for(int i = 0;i < f[3]-1;i++) { out.print(" 1"); y--; } out.println(" " + y); for(int i = 0;i < n-1;i++) { out.println(1000000000); } out.println(1); } int[] find(int X) { int S = (int)Math.sqrt(X); for(int i = S;i <= 100000 && i <= S+1000;i++) { for(int j = i;j <= 100000 && j <= i+1000;j++) { if((long)i*j > X) { long cha = (long)i*j - X; if(cha <= j) { return new int[] {i, j, 1, (int)cha}; } // for(int k = 1;k*k <= cha;k++) { // if(cha % k == 0 && k <= i && cha/k <= j) { // return new int[] {i, j, k, (int)(cha/k)}; // } // } } } } throw new RuntimeException(); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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(); } public static void main(String[] args) throws Exception { new F().run(); } private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }