結果
問題 | No.630 門松グラフ |
ユーザー | yuya178 |
提出日時 | 2018-01-06 19:35:44 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 297 ms / 1,500 ms |
コード長 | 4,180 bytes |
コンパイル時間 | 2,283 ms |
コンパイル使用メモリ | 80,772 KB |
実行使用メモリ | 46,808 KB |
最終ジャッジ日時 | 2024-06-02 11:34:49 |
合計ジャッジ時間 | 8,182 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
38,364 KB |
testcase_01 | AC | 46 ms
36,772 KB |
testcase_02 | AC | 47 ms
36,876 KB |
testcase_03 | AC | 81 ms
38,776 KB |
testcase_04 | AC | 90 ms
40,156 KB |
testcase_05 | AC | 47 ms
36,836 KB |
testcase_06 | AC | 48 ms
37,036 KB |
testcase_07 | AC | 75 ms
37,932 KB |
testcase_08 | AC | 85 ms
38,396 KB |
testcase_09 | AC | 49 ms
37,032 KB |
testcase_10 | AC | 48 ms
36,784 KB |
testcase_11 | AC | 80 ms
38,628 KB |
testcase_12 | AC | 81 ms
38,596 KB |
testcase_13 | AC | 47 ms
36,764 KB |
testcase_14 | AC | 92 ms
38,892 KB |
testcase_15 | AC | 75 ms
38,204 KB |
testcase_16 | AC | 87 ms
38,896 KB |
testcase_17 | AC | 82 ms
39,608 KB |
testcase_18 | AC | 79 ms
39,632 KB |
testcase_19 | AC | 83 ms
39,592 KB |
testcase_20 | AC | 47 ms
36,552 KB |
testcase_21 | AC | 47 ms
36,960 KB |
testcase_22 | AC | 48 ms
36,984 KB |
testcase_23 | AC | 47 ms
37,080 KB |
testcase_24 | AC | 238 ms
44,928 KB |
testcase_25 | AC | 47 ms
36,876 KB |
testcase_26 | AC | 237 ms
45,628 KB |
testcase_27 | AC | 247 ms
44,584 KB |
testcase_28 | AC | 47 ms
36,856 KB |
testcase_29 | AC | 297 ms
46,808 KB |
testcase_30 | AC | 282 ms
45,772 KB |
testcase_31 | AC | 266 ms
45,352 KB |
testcase_32 | AC | 247 ms
45,248 KB |
testcase_33 | AC | 200 ms
43,620 KB |
testcase_34 | AC | 257 ms
45,336 KB |
testcase_35 | AC | 223 ms
45,964 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = Integer.MAX_VALUE; List<Integer>[] arr; List<Integer>[] arr2; boolean[] seen; int[] count; void solve(){ int n = ni(); int m = ni(); long sum = 0; int res = n/2; if(n%2==0) sum = (1+res)*res - res; if(n%2==1) sum = (1+res)*res; if(m<n-1 || m>sum){ out.println("NO"); return; } out.println("YES"); for(int i = 1; i <= res; i++){ out.print(i+" "); if(n%2==0) out.print((i+res)+" "); if(n%2==1) out.print((i+res+1)+" "); } if(n%2==1) out.print(res+1); out.println(); long ans = 0; for(int i = 1; i <= n; i++){ for(int j = i+1; j <= n; j+=2){ out.println(i+" "+j); ans++; if(ans==m){ return; } } } } 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"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private 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) && 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 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(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }