結果
問題 | No.1523 +/- Tree |
ユーザー | shojin_pro |
提出日時 | 2021-05-28 22:46:01 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,748 bytes |
コンパイル時間 | 2,646 ms |
コンパイル使用メモリ | 89,464 KB |
実行使用メモリ | 41,056 KB |
最終ジャッジ日時 | 2024-04-25 00:42:30 |
合計ジャッジ時間 | 12,712 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 54 ms
37,236 KB |
testcase_02 | AC | 98 ms
40,000 KB |
testcase_03 | AC | 54 ms
37,364 KB |
testcase_04 | AC | 53 ms
37,340 KB |
testcase_05 | AC | 54 ms
37,308 KB |
testcase_06 | AC | 52 ms
36,900 KB |
testcase_07 | AC | 54 ms
36,820 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 108 ms
40,264 KB |
testcase_25 | AC | 133 ms
40,712 KB |
testcase_26 | AC | 109 ms
40,636 KB |
testcase_27 | AC | 128 ms
40,812 KB |
testcase_28 | AC | 125 ms
40,704 KB |
testcase_29 | AC | 102 ms
40,352 KB |
testcase_30 | AC | 122 ms
40,232 KB |
testcase_31 | AC | 131 ms
40,568 KB |
testcase_32 | AC | 106 ms
40,120 KB |
testcase_33 | AC | 140 ms
40,600 KB |
testcase_34 | AC | 122 ms
40,588 KB |
testcase_35 | AC | 130 ms
40,732 KB |
testcase_36 | AC | 115 ms
40,692 KB |
testcase_37 | AC | 121 ms
40,280 KB |
testcase_38 | AC | 109 ms
40,036 KB |
testcase_39 | AC | 131 ms
40,428 KB |
testcase_40 | AC | 126 ms
40,756 KB |
testcase_41 | AC | 121 ms
40,648 KB |
testcase_42 | AC | 105 ms
40,116 KB |
testcase_43 | AC | 139 ms
40,948 KB |
testcase_44 | AC | 126 ms
40,888 KB |
testcase_45 | AC | 101 ms
39,892 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); static PrintWriter pw = new PrintWriter(System.out); static StringBuilder sb = new StringBuilder(); static long mod = (long) 1e9 + 7; public static void main(String[] args) throws Exception { solve(); pw.flush(); } public static void solve() { int N = sc.nextInt(); int K = sc.nextInt(); if(K == 1){ pw.println("No"); }else{ pw.println("Yes"); int peek = K; int minus = 2*(K-1)+1; pw.println(1 + " " + 2 + " " + (-minus)); for(int i = 3; i <= N; i++){ pw.println(i + " " + Math.min(peek,i-1) + " " + 2); } } } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } public static void save_sort(long[] array) { shuffle(array); Arrays.sort(array); } public static long[] shuffle(long[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); long randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class Combination { final static long mod = (long) 1e9 + 7; private static long[] fact, ifact; public Combination(int n) { fact = new long[n + 1]; ifact = new long[n + 1]; fact[0] = 1; long ln = n; for (long i = 1; i <= ln; ++i) { int ii = (int) i; fact[ii] = fact[ii - 1] % mod * i % mod; } ifact[n] = pow(fact[n], this.mod - 2); for (int i = n; i >= 1; --i) { int ii = (int) i; ifact[ii - 1] = ifact[ii] % mod * i % mod; } } public static long comb(int n, int k) { if (k < 0 || k > n) return 0; return fact[n] % mod * ifact[k] % mod * ifact[n - k] % mod; } public static long perm(int n, int k) { return comb(n, k) * fact[k] % mod; } public static long pow(long a, long b) { long ret = 1; long tmp = a; while (b > 0) { if ((b & 1) == 1) { ret = (ret * tmp) % mod; } tmp = (tmp * tmp) % mod; b = b >> 1; } return ret; } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public FastScanner(FileReader in) { reader = new BufferedReader(in); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }