結果

問題 No.918 LISGRID
ユーザー uwiuwi
提出日時 2019-10-25 22:54:11
言語 Java
(openjdk 23)
結果
AC  
実行時間 398 ms / 2,000 ms
コード長 5,449 bytes
コンパイル時間 3,949 ms
コンパイル使用メモリ 82,280 KB
実行使用メモリ 65,724 KB
最終ジャッジ日時 2024-09-13 06:34:54
合計ジャッジ時間 14,963 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
}
0