結果
問題 | No.918 LISGRID |
ユーザー | uwi |
提出日時 | 2019-10-25 22:54:11 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 403 ms / 2,000 ms |
コード長 | 5,449 bytes |
コンパイル時間 | 3,926 ms |
コンパイル使用メモリ | 79,012 KB |
実行使用メモリ | 66,716 KB |
最終ジャッジ日時 | 2023-10-11 07:27:20 |
合計ジャッジ時間 | 15,569 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
52,572 KB |
testcase_01 | AC | 294 ms
61,108 KB |
testcase_02 | AC | 187 ms
59,208 KB |
testcase_03 | AC | 214 ms
58,896 KB |
testcase_04 | AC | 193 ms
56,216 KB |
testcase_05 | AC | 286 ms
63,064 KB |
testcase_06 | AC | 352 ms
62,604 KB |
testcase_07 | AC | 345 ms
64,884 KB |
testcase_08 | AC | 286 ms
61,228 KB |
testcase_09 | AC | 295 ms
63,192 KB |
testcase_10 | AC | 275 ms
64,748 KB |
testcase_11 | AC | 258 ms
62,596 KB |
testcase_12 | AC | 309 ms
64,876 KB |
testcase_13 | AC | 280 ms
60,588 KB |
testcase_14 | AC | 344 ms
65,732 KB |
testcase_15 | AC | 403 ms
66,716 KB |
testcase_16 | AC | 243 ms
60,576 KB |
testcase_17 | AC | 298 ms
61,080 KB |
testcase_18 | AC | 238 ms
58,264 KB |
testcase_19 | AC | 159 ms
58,996 KB |
testcase_20 | AC | 247 ms
58,288 KB |
testcase_21 | AC | 164 ms
58,496 KB |
testcase_22 | AC | 152 ms
58,256 KB |
testcase_23 | AC | 223 ms
58,412 KB |
testcase_24 | AC | 102 ms
53,072 KB |
testcase_25 | AC | 86 ms
52,748 KB |
testcase_26 | AC | 67 ms
52,400 KB |
testcase_27 | AC | 66 ms
52,376 KB |
testcase_28 | AC | 68 ms
52,588 KB |
testcase_29 | AC | 67 ms
52,624 KB |
testcase_30 | AC | 67 ms
52,916 KB |
testcase_31 | AC | 70 ms
52,620 KB |
testcase_32 | AC | 69 ms
52,504 KB |
testcase_33 | AC | 69 ms
52,388 KB |
testcase_34 | AC | 97 ms
54,088 KB |
testcase_35 | AC | 133 ms
57,784 KB |
testcase_36 | AC | 96 ms
53,044 KB |
testcase_37 | AC | 262 ms
58,692 KB |
testcase_38 | AC | 226 ms
59,992 KB |
ソースコード
package contest191025; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int h = ni(), w = ni(); int[] a = na(h); int[] b = na(w); Arrays.sort(a); Arrays.sort(b); int[][] as = new int[h][]; for(int i = 0;i < h;i++) { as[i] = make(w, a[i]); } int[][] bs = new int[w][]; for(int i = 0;i < w;i++) { bs[i] = make(h, b[i]); } int[] from = new int[320000]; int[] to = new int[320000]; int p = 0; for(int i = 0;i < h;i++) { int[] ia = new int[w]; for(int j = 0;j < w;j++) { ia[as[i][j]] = j; } for(int j = 0;j < w-1;j++) { from[p] = i*w+ia[j]; to[p] = i*w+ia[j+1]; p++; } } for(int i = 0;i < w;i++) { int[] ia = new int[h]; for(int j = 0;j < h;j++) { ia[bs[i][j]] = j; } for(int j = 0;j < h-1;j++) { from[p] = ia[j]*w+i; to[p] = ia[j+1]*w+i; p++; } } int[][] g = packD(h*w, from, to, p); int[] ord = sortTopologically(g); int[][] ret = new int[h][w]; for(int i = 0;i < h*w;i++) { int v = ord[i]; ret[v/w][v%w] = i+1; } for(int[] row : ret) { for(int v : row) { out.print(v + " "); } out.println(); } } public static int[] sortTopologically(int[][] g) { int n = g.length; int[] ec = new int[n]; for(int i = 0;i < n;i++){ for(int to : g[i])ec[to]++; } int[] ret = new int[n]; int q = 0; // sources for(int i = 0;i < n;i++){ if(ec[i] == 0)ret[q++] = i; } for(int p = 0;p < q;p++){ for(int to : g[ret[p]]){ if(--ec[to] == 0)ret[q++] = to; } } // loop for(int i = 0;i < n;i++){ if(ec[i] > 0)return null; } return ret; } public static int[][] packD(int n, int[] from, int[] to){ return packD(n, from, to, from.length);} public static int[][] packD(int n, int[] from, int[] to, int sup) { int[][] g = new int[n][]; int[] p = new int[n]; for(int i = 0;i < sup;i++)p[from[i]]++; for(int i = 0;i < n;i++)g[i] = new int[p[i]]; for(int i = 0;i < sup;i++){ g[from[i]][--p[from[i]]] = to[i]; } return g; } int[] make(int n, int lis) { int[] a = new int[n]; for(int i = 0;i < lis;i++) { a[i] = n-lis+i; } for(int i = lis;i < n;i++) { a[i] = n-1-i; } return a; } // 3 3 // 2 2 1 // 2 3 1 // 231 // 231 // 321 void run() throws Exception { // int n = 400, m = 99999; // Random gen = new Random(); // StringBuilder sb = new StringBuilder(); // sb.append(n + " "); // sb.append(n + " "); // for (int i = 0; i < 2*n; i++) { // sb.append(gen.nextInt(n)+1 + " "); // } // tr(sb); // INPUT = sb.toString(); 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 E().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)); } }