結果
問題 | No.630 門松グラフ |
ユーザー | yuya178 |
提出日時 | 2018-01-06 19:35:44 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 307 ms / 1,500 ms |
コード長 | 4,180 bytes |
コンパイル時間 | 3,538 ms |
コンパイル使用メモリ | 77,864 KB |
実行使用メモリ | 59,244 KB |
最終ジャッジ日時 | 2023-08-24 22:24:31 |
合計ジャッジ時間 | 9,305 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
52,700 KB |
testcase_01 | AC | 42 ms
49,388 KB |
testcase_02 | AC | 42 ms
49,380 KB |
testcase_03 | AC | 80 ms
52,268 KB |
testcase_04 | AC | 81 ms
53,556 KB |
testcase_05 | AC | 43 ms
49,544 KB |
testcase_06 | AC | 46 ms
49,252 KB |
testcase_07 | AC | 111 ms
52,348 KB |
testcase_08 | AC | 80 ms
52,584 KB |
testcase_09 | AC | 42 ms
49,296 KB |
testcase_10 | AC | 44 ms
49,388 KB |
testcase_11 | AC | 85 ms
52,576 KB |
testcase_12 | AC | 89 ms
52,536 KB |
testcase_13 | AC | 46 ms
49,196 KB |
testcase_14 | AC | 90 ms
54,960 KB |
testcase_15 | AC | 90 ms
52,520 KB |
testcase_16 | AC | 88 ms
52,660 KB |
testcase_17 | AC | 89 ms
52,604 KB |
testcase_18 | AC | 89 ms
52,512 KB |
testcase_19 | AC | 90 ms
52,324 KB |
testcase_20 | AC | 45 ms
49,368 KB |
testcase_21 | AC | 46 ms
49,424 KB |
testcase_22 | AC | 46 ms
49,692 KB |
testcase_23 | AC | 42 ms
49,396 KB |
testcase_24 | AC | 262 ms
57,076 KB |
testcase_25 | AC | 41 ms
49,480 KB |
testcase_26 | AC | 260 ms
57,184 KB |
testcase_27 | AC | 265 ms
56,836 KB |
testcase_28 | AC | 41 ms
49,408 KB |
testcase_29 | AC | 307 ms
57,396 KB |
testcase_30 | AC | 304 ms
57,780 KB |
testcase_31 | AC | 282 ms
59,244 KB |
testcase_32 | AC | 258 ms
57,396 KB |
testcase_33 | AC | 205 ms
56,432 KB |
testcase_34 | AC | 268 ms
57,108 KB |
testcase_35 | AC | 229 ms
57,540 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)); } }