結果
問題 | No.1123 Afforestation |
ユーザー | uwi |
提出日時 | 2020-07-22 22:14:55 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 11,455 bytes |
コンパイル時間 | 5,774 ms |
コンパイル使用メモリ | 89,412 KB |
実行使用メモリ | 698,704 KB |
最終ジャッジ日時 | 2023-09-04 21:13:05 |
合計ジャッジ時間 | 55,710 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,788 KB |
testcase_01 | AC | 45 ms
49,496 KB |
testcase_02 | AC | 45 ms
49,492 KB |
testcase_03 | AC | 71 ms
50,840 KB |
testcase_04 | AC | 210 ms
62,520 KB |
testcase_05 | AC | 746 ms
193,948 KB |
testcase_06 | TLE | - |
testcase_07 | AC | 76 ms
47,272 KB |
testcase_08 | AC | 44 ms
49,448 KB |
testcase_09 | AC | 46 ms
49,604 KB |
testcase_10 | AC | 64 ms
51,036 KB |
testcase_11 | AC | 126 ms
56,620 KB |
testcase_12 | AC | 578 ms
119,832 KB |
testcase_13 | TLE | - |
testcase_14 | AC | 45 ms
49,812 KB |
testcase_15 | AC | 43 ms
49,312 KB |
testcase_16 | AC | 44 ms
49,432 KB |
testcase_17 | AC | 51 ms
49,524 KB |
testcase_18 | AC | 76 ms
51,840 KB |
testcase_19 | AC | 244 ms
62,308 KB |
testcase_20 | AC | 998 ms
184,568 KB |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | AC | 42 ms
49,344 KB |
testcase_27 | AC | 43 ms
49,616 KB |
testcase_28 | AC | 48 ms
53,816 KB |
testcase_29 | AC | 42 ms
49,636 KB |
testcase_30 | AC | 42 ms
49,300 KB |
testcase_31 | AC | 49 ms
53,984 KB |
testcase_32 | AC | 43 ms
49,512 KB |
testcase_33 | AC | 43 ms
49,412 KB |
testcase_34 | AC | 70 ms
50,944 KB |
testcase_35 | AC | 68 ms
50,756 KB |
testcase_36 | AC | 45 ms
49,616 KB |
testcase_37 | AC | 46 ms
49,516 KB |
testcase_38 | AC | 46 ms
49,416 KB |
testcase_39 | AC | 78 ms
51,972 KB |
testcase_40 | AC | 81 ms
52,044 KB |
testcase_41 | AC | 77 ms
51,980 KB |
testcase_42 | AC | 147 ms
57,400 KB |
testcase_43 | AC | 227 ms
62,352 KB |
testcase_44 | AC | 388 ms
83,192 KB |
testcase_45 | AC | 382 ms
83,512 KB |
testcase_46 | AC | 441 ms
83,688 KB |
testcase_47 | AC | 460 ms
84,372 KB |
testcase_48 | AC | 42 ms
49,408 KB |
testcase_49 | AC | 43 ms
49,408 KB |
testcase_50 | AC | 70 ms
50,944 KB |
testcase_51 | AC | 70 ms
50,700 KB |
testcase_52 | AC | 46 ms
49,604 KB |
testcase_53 | AC | 45 ms
49,416 KB |
testcase_54 | AC | 47 ms
49,540 KB |
testcase_55 | AC | 80 ms
51,968 KB |
testcase_56 | AC | 77 ms
52,028 KB |
testcase_57 | AC | 77 ms
51,816 KB |
testcase_58 | AC | 151 ms
58,276 KB |
testcase_59 | AC | 237 ms
62,548 KB |
testcase_60 | AC | 373 ms
82,608 KB |
testcase_61 | AC | 389 ms
81,544 KB |
testcase_62 | AC | 456 ms
83,768 KB |
testcase_63 | AC | 472 ms
83,960 KB |
testcase_64 | AC | 44 ms
49,548 KB |
testcase_65 | AC | 44 ms
49,436 KB |
testcase_66 | AC | 52 ms
49,932 KB |
testcase_67 | AC | 53 ms
49,764 KB |
testcase_68 | AC | 79 ms
52,332 KB |
testcase_69 | AC | 101 ms
54,204 KB |
testcase_70 | AC | 148 ms
57,256 KB |
testcase_71 | AC | 232 ms
62,888 KB |
testcase_72 | AC | 43 ms
49,400 KB |
testcase_73 | AC | 44 ms
49,524 KB |
testcase_74 | AC | 42 ms
49,592 KB |
testcase_75 | AC | 44 ms
49,304 KB |
testcase_76 | AC | 43 ms
49,404 KB |
testcase_77 | AC | 44 ms
49,536 KB |
testcase_78 | AC | 43 ms
49,396 KB |
testcase_79 | AC | 42 ms
49,460 KB |
testcase_80 | AC | 43 ms
49,528 KB |
testcase_81 | AC | 44 ms
49,660 KB |
testcase_82 | AC | 43 ms
49,252 KB |
testcase_83 | AC | 45 ms
49,664 KB |
testcase_84 | MLE | - |
testcase_85 | MLE | - |
testcase_86 | AC | 44 ms
49,456 KB |
testcase_87 | AC | 46 ms
49,400 KB |
testcase_88 | MLE | - |
testcase_89 | MLE | - |
testcase_90 | AC | 42 ms
49,540 KB |
testcase_91 | AC | 43 ms
49,468 KB |
testcase_92 | AC | 45 ms
49,540 KB |
ソースコード
package contest200722; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.List; public class E3 { 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[][] one = giveSimpleGraphOfBipartite(a, b); if(one == null){ out.println(":("); return; } List<Edge> es = new ArrayList<>(); int src = n+m, sink = src+1; int[] fa = new int[n]; int[] fb = new int[m]; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ if(house[i][j])continue; Edge e = new Edge(i, j+n, 1); if(one[i][j]){ e.flow = 1; fa[i]++; fb[j]++; } es.add(e); } } int tof = 0; for(int i = 0;i < n;i++){ Edge e = new Edge(src, i, a[i]); e.flow = fa[i]; tof += a[i]-fa[i]; es.add(e); } for(int j = 0;j < m;j++){ Edge e = new Edge(j+n, sink, b[j]); e.flow = fb[j]; es.add(e); } long F = maximumFlowDinic(compileWD(sink+1, es), src, sink); if(F != tof){ 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'; } } } for(Edge e : es){ if(!e.cloned && e.from < n && e.flow == 1){ ret[e.from][e.to-n] = '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; } public static class Edge { public int from, to; public long capacity; public long flow; public Edge complement; public boolean cloned; public Edge(int from, int to, long capacity) { this.from = from; this.to = to; this.capacity = capacity; } } public static void reset(Edge[][] g) { for(Edge[] row : g){ for(Edge e : row){ e.flow = e.cloned ? e.capacity : 0; } } } public static Edge[][] compileWD(int n, List<Edge> edges) { Edge[][] g = new Edge[n][]; // cloning for(int i = edges.size()-1;i >= 0;i--){ Edge origin = edges.get(i); Edge clone = new Edge(origin.to, origin.from, origin.capacity); clone.flow = origin.capacity - origin.flow; clone.complement = origin; clone.cloned = true; origin.complement = clone; edges.add(clone); } int[] p = new int[n]; for(Edge e : edges)p[e.from]++; for(int i = 0;i < n;i++)g[i] = new Edge[p[i]]; for(Edge e : edges)g[e.from][--p[e.from]] = e; return g; } public static Edge[][] compileWU(int n, List<Edge> edges) { Edge[][] g = new Edge[n][]; // cloning for(int i = edges.size()-1;i >= 0;i--){ Edge origin = edges.get(i); Edge clone = new Edge(origin.to, origin.from, origin.capacity*2); origin.flow = origin.capacity; clone.flow = origin.capacity; clone.complement = origin; clone.cloned = true; origin.complement = clone; origin.capacity *= 2; edges.add(clone); } int[] p = new int[n]; for(Edge e : edges)p[e.from]++; for(int i = 0;i < n;i++)g[i] = new Edge[p[i]]; for(Edge e : edges)g[e.from][--p[e.from]] = e; return g; } public static long maximumFlowDinic(Edge[][] g, int source, int sink) { int n = g.length; int[] d = new int[n]; int[] q = new int[n]; long ret = 0; while(true){ Arrays.fill(d, -1); q[0] = source; int r = 1; d[source] = 0; for(int v = 0;v < r;v++){ int cur = q[v]; for(Edge ne : g[cur]){ if(d[ne.to] == -1 && ne.capacity - ne.flow > 0) { q[r++] = ne.to; d[ne.to] = d[cur] + 1; } } } if(d[sink] == -1)break; int[] sp = new int[n]; for(int i = 0;i < n;i++)sp[i] = g[i].length - 1; ret += dfsDinic(d, g, sp, source, sink, Long.MAX_VALUE); } return ret; } private static long dfsDinic(int[] d, Edge[][] g, int[] sp, int cur, int sink, long min) { if(cur == sink)return min; long left = min; for(int i = sp[cur];i >= 0;i--){ Edge ne = g[cur][i]; if(d[ne.to] == d[cur]+1 && ne.capacity - ne.flow > 0){ long fl = dfsDinic(d, g, sp, ne.to, sink, Math.min(left, ne.capacity - ne.flow)); if(fl > 0){ left -= fl; ne.flow += fl; ne.complement.flow -= fl; if(left == 0){ sp[cur] = i; return min; } } } } sp[cur] = -1; return min-left; } public static long maximumFlowDinicNoRec(Edge[][] g, int source, int sink) { int n = g.length; int[] d = new int[n]; // distance int[] q = new int[n]; // queue for BFS long ret = 0; int[] stack = new int[n]; long[] lefts = new long[n]; // left to flow long[] parflow = new long[n]; int[] probe = new int[n]; // search pointer while(true){ // BFS Arrays.fill(d, -1); q[0] = source; int r = 1; d[source] = 0; for(int v = 0;v < r;v++){ int cur = q[v]; for(Edge ne : g[cur]){ if(d[ne.to] == -1 && ne.capacity - ne.flow > 0) { q[r++] = ne.to; d[ne.to] = d[cur] + 1; } } } if(d[sink] == -1)break; // DFS for(int i = 0;i < n;i++)probe[i] = g[i].length-1; int sp = 0; stack[sp] = source; lefts[sp] = Long.MAX_VALUE / 10; parflow[sp] = 0; sp++; long delta = 0; boolean down = true; while(sp > 0){ int cur = stack[sp-1]; long left = lefts[sp-1]; if(cur == sink){ delta += left; parflow[sp-1] = left; sp--; down = false; continue; } if(!down){ if(parflow[sp] > 0){ lefts[sp-1] -= parflow[sp]; left = lefts[sp-1]; Edge ne = g[cur][probe[cur]]; ne.flow += parflow[sp]; ne.complement.flow -= parflow[sp]; parflow[sp-1] += parflow[sp]; } if(left > 0)probe[cur]--; } if(left > 0 && probe[cur] >= 0){ down = true; Edge ne = g[cur][probe[cur]]; if(d[ne.to] == d[cur]+1 && ne.capacity - ne.flow > 0){ lefts[sp] = Math.min(left, ne.capacity - ne.flow); stack[sp] = ne.to; parflow[sp] = 0; sp++; }else{ probe[cur]--; } }else{ down = false; sp--; } } ret += delta; } 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(gen.nextInt(1000) + " "); // } // for (int i = 0; i < m; i++) { // sb.append(gen.nextInt(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 E3().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)); } }