結果
| 問題 | No.1123 Afforestation |
| ユーザー |
 uwi
|
| 提出日時 | 2020-07-22 22:31:31 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,203 ms / 2,500 ms |
| コード長 | 6,984 bytes |
| コンパイル時間 | 3,903 ms |
| コンパイル使用メモリ | 85,604 KB |
| 実行使用メモリ | 67,016 KB |
| 最終ジャッジ日時 | 2024-06-22 23:12:29 |
| 合計ジャッジ時間 | 25,606 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 90 |
ソースコード
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.Comparator;import java.util.InputMismatchException;public class E4 {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 = giveSimpleGraphOfBipartite(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] = new int[]{e[i], i};for(int i = 0;i < m;i++)fr[i] = new int[]{f[i], i};boolean[][] ret = new boolean[n][m];Arrays.sort(er, new Comparator<int[]>() {public int compare(int[] a, int[] b) {return -(a[0] - b[0]);}});int p = 0;Arrays.sort(fr, new Comparator<int[]>() {public int compare(int[] a, int[] b) {return -(a[0] - b[0]);}});int[][] temp = new int[m][];for(int i = 0;i < n;i++){int j;for(j = 0;j < m && er[i][0] > 0;j++){fr[j][0]--; er[i][0]--;if(fr[j][0] < 0)return null;ret[er[i][0]][fr[j][1]] = true;}if(er[i][0] > 0)return null;int q = 0, r = 0;for(int k = j;k < m;k++){while(q < j && fr[q][0] > fr[k][0])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 E4().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)); }}