#516966 (Java21) No.1123 Afforestation

提出ソース

結果

問題	No.1123 Afforestation
ユーザー	uwi
提出日時	2020-07-23 04:49:48
言語	Java21 (openjdk 21)
結果	AC
実行時間	1,246 ms / 2,500 ms
コード長	6,761 bytes
コンパイル時間	4,594 ms
コンパイル使用メモリ	96,768 KB
実行使用メモリ	67,308 KB
最終ジャッジ日時	2024-06-23 09:21:36
合計ジャッジ時間	31,412 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 37,216 KB
testcase_01	AC	53 ms 37,088 KB
testcase_02	AC	54 ms 37,420 KB
testcase_03	AC	57 ms 36,988 KB
testcase_04	AC	107 ms 39,264 KB
testcase_05	AC	255 ms 47,476 KB
testcase_06	AC	432 ms 65,236 KB
testcase_07	AC	53 ms 37,244 KB
testcase_08	AC	54 ms 36,972 KB
testcase_09	AC	53 ms 37,272 KB
testcase_10	AC	57 ms 36,916 KB
testcase_11	AC	100 ms 39,304 KB
testcase_12	AC	251 ms 44,244 KB
testcase_13	AC	1,086 ms 66,304 KB
testcase_14	AC	53 ms 37,328 KB
testcase_15	AC	52 ms 36,992 KB
testcase_16	AC	53 ms 36,984 KB
testcase_17	AC	55 ms 37,320 KB
testcase_18	AC	75 ms 38,204 KB
testcase_19	AC	123 ms 39,880 KB
testcase_20	AC	420 ms 48,948 KB
testcase_21	AC	1,244 ms 66,100 KB
testcase_22	AC	1,246 ms 67,148 KB
testcase_23	AC	1,109 ms 67,052 KB
testcase_24	AC	1,221 ms 66,020 KB
testcase_25	AC	860 ms 67,200 KB
testcase_26	AC	51 ms 37,200 KB
testcase_27	AC	52 ms 37,272 KB
testcase_28	AC	62 ms 44,736 KB
testcase_29	AC	52 ms 36,680 KB
testcase_30	AC	53 ms 37,124 KB
testcase_31	AC	62 ms 44,248 KB
testcase_32	AC	52 ms 37,216 KB
testcase_33	AC	50 ms 37,116 KB
testcase_34	AC	55 ms 36,972 KB
testcase_35	AC	58 ms 37,456 KB
testcase_36	AC	52 ms 37,488 KB
testcase_37	AC	53 ms 37,128 KB
testcase_38	AC	52 ms 36,960 KB
testcase_39	AC	75 ms 37,936 KB
testcase_40	AC	65 ms 38,480 KB
testcase_41	AC	68 ms 37,944 KB
testcase_42	AC	110 ms 40,044 KB
testcase_43	AC	156 ms 42,032 KB
testcase_44	AC	216 ms 43,976 KB
testcase_45	AC	239 ms 44,524 KB
testcase_46	AC	238 ms 43,212 KB
testcase_47	AC	260 ms 43,836 KB
testcase_48	AC	53 ms 37,292 KB
testcase_49	AC	52 ms 37,112 KB
testcase_50	AC	57 ms 37,324 KB
testcase_51	AC	59 ms 37,208 KB
testcase_52	AC	53 ms 37,308 KB
testcase_53	AC	53 ms 37,216 KB
testcase_54	AC	52 ms 37,096 KB
testcase_55	AC	78 ms 38,208 KB
testcase_56	AC	66 ms 38,356 KB
testcase_57	AC	78 ms 38,240 KB
testcase_58	AC	118 ms 39,908 KB
testcase_59	AC	147 ms 41,688 KB
testcase_60	AC	243 ms 42,956 KB
testcase_61	AC	216 ms 42,848 KB
testcase_62	AC	267 ms 43,468 KB
testcase_63	AC	260 ms 43,300 KB
testcase_64	AC	50 ms 37,268 KB
testcase_65	AC	53 ms 36,976 KB
testcase_66	AC	55 ms 37,344 KB
testcase_67	AC	55 ms 36,992 KB
testcase_68	AC	69 ms 38,220 KB
testcase_69	AC	97 ms 39,136 KB
testcase_70	AC	109 ms 39,588 KB
testcase_71	AC	158 ms 42,308 KB
testcase_72	AC	54 ms 36,976 KB
testcase_73	AC	54 ms 37,328 KB
testcase_74	AC	54 ms 36,928 KB
testcase_75	AC	55 ms 36,988 KB
testcase_76	AC	55 ms 37,112 KB
testcase_77	AC	52 ms 37,352 KB
testcase_78	AC	52 ms 37,420 KB
testcase_79	AC	53 ms 37,200 KB
testcase_80	AC	52 ms 37,448 KB
testcase_81	AC	51 ms 37,244 KB
testcase_82	AC	52 ms 37,356 KB
testcase_83	AC	54 ms 37,328 KB
testcase_84	AC	317 ms 64,792 KB
testcase_85	AC	586 ms 67,308 KB
testcase_86	AC	52 ms 37,216 KB
testcase_87	AC	51 ms 37,200 KB
testcase_88	AC	298 ms 64,052 KB
testcase_89	AC	380 ms 65,276 KB
testcase_90	AC	53 ms 37,092 KB
testcase_91	AC	52 ms 36,960 KB
testcase_92	AC	52 ms 37,360 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest200722;
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 E5 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] a = na(n);
		int[] b = na(m);
		int K = ni();
		boolean[][] house = new boolean[n][m];
		for(int i = 0;i < K;i++){
			int r = ni()-1, c = ni()-1;
			house[r][c] = true;
		}
		
		boolean[][] g = giveSimpleGraphOfBipartiteFast(a, b);
		if(g == null){
			out.println(":(");
			return;
		}
		
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(house[i][j] && g[i][j]){
					int[] pre = new int[n+m];
					Arrays.fill(pre, -1);
					int[] q = new int[n+m];
					pre[i] = -2;
					int p = 0;
					q[p++] = i;
					for(int z = 0;z < p;z++){
						int cur = q[z];
						if(cur < n){
							for(int l = 0;l < m;l++){
								if(!house[cur][l] && !g[cur][l] && pre[l+n] == -1){
									pre[l+n] = cur;
									q[p++] = l+n;
								}
							}
						}else{
							for(int l = 0;l < n;l++){
								if(g[l][cur-n] && pre[l] == -1){
									pre[l] = cur;
									q[p++] = l;
								}
							}
						}
					}
//					tr(pre, i, j);
					if(pre[j+n] != -1){
						int r = j+n;
						while(true){
							int l = pre[r];
							g[l][r-n] = true;
							r = pre[l];
							if(r < 0)break;
							g[l][r-n] = false;
						}
						g[i][j] = false;
					}else{
						out.println(":(");
						return;
					}
				}
			}
		}
		
		out.println("Yay!");
		char[][] ret = new char[n][m];
		for(int i = 0;i < n;i++)Arrays.fill(ret[i], '.');
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(house[i][j]){
					ret[i][j] = 'x';
				}else if(g[i][j]){
					ret[i][j] = 'o';
				}
			}
		}
		for(char[] line : ret){
			out.println(new String(line));
		}
	}
	
	public static boolean[][] giveSimpleGraphOfBipartite(int[] e, int[] f)
	{
		int n = e.length, m = f.length;
		int dsum = 0;
		for(int v : e)dsum += v;
		for(int v : f)dsum -= v;
		if(dsum != 0)return null;
		
		int[] er = new int[n];
		int[] fr = new int[m];
		for(int i = 0;i < n;i++)er[i] = e[i]<<16|i;
		for(int i = 0;i < m;i++)fr[i] = f[i]<<16|i;
		
		Arrays.sort(er);
		er = rev_(er);
		
		boolean[][] g = new boolean[n][m];
		for(int i = 0;i < n;i++){
			Arrays.sort(fr);
			fr = rev_(fr);
			for(int j = 0;j < m && er[i]>>>16 > 0;j++){
				fr[j] -= 1<<16;
				er[i] -= 1<<16;
				if(fr[j] < 0)return null;
				g[er[i]&65535][fr[j]&65535] = true;
			}
			if(er[i]>>>16 > 0)return null;
		}
		return g;
	}
	
	public static int[] rev_(int[] a){for(int i = 0, j = a.length-1;i < j;i++,j--){int c = a[i]; a[i] = a[j]; a[j] = c;}return a;}

	
	public static boolean[][] giveSimpleGraphOfBipartiteFast(int[] e, int[] f)
	{
		int n = e.length, m = f.length;
		int dsum = 0;
		for(int v : e)dsum += v;
		for(int v : f)dsum -= v;
		if(dsum != 0)return null;
		
		int[] er = new int[n];
		int[] fr = new int[m];
		for(int i = 0;i < n;i++)er[i] = e[i]<<16|i;
		for(int i = 0;i < m;i++)fr[i] = f[i]<<16|i;
		
		boolean[][] ret = new boolean[n][m];
		Arrays.sort(er);
		er = rev_(er);
		Arrays.sort(fr);
		fr = rev_(fr);
		int[] temp = new int[m];
		for(int i = 0;i < n;i++){
			int j;
			for(j = 0;j < m && er[i]>>>16 > 0;j++){
				fr[j] -= 1<<16; er[i] -= 1<<16;
				if(fr[j] < 0)return null;
				ret[er[i]&65535][fr[j]&65535] = true;
			}
			if(er[i]>>>16 > 0)return null;
			int q = 0, r = 0;
			for(int k = j;k < m;k++){
				while(q < j && fr[q]>>>16 > fr[k]>>>16)temp[r++] = fr[q++];
				temp[r++] = fr[k];
			}
			while(q < j)temp[r++] = fr[q++];
			for(int k = 0;k < m;k++)fr[k] = temp[k];
		}
		return ret;
	}
	
	void run() throws Exception
	{
//		int n = 2000, m = 2000;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(m + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(1000 + " ");
//		}
//		for (int i = 0; i < m; i++) {
//			sb.append(1000 + " ");
//		}
//		sb.append(0 + " ");
//		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 E5().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)); }
}

yukicoder

結果

テストケース

ソースコード