結果
問題 | No.1744 Selfish Spies 1 (à la Princess' Perfectionism) |
ユーザー | uwi |
提出日時 | 2021-11-15 23:50:15 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 4,811 ms / 5,000 ms |
コード長 | 14,079 bytes |
コンパイル時間 | 5,565 ms |
コンパイル使用メモリ | 93,408 KB |
実行使用メモリ | 59,164 KB |
最終ジャッジ日時 | 2024-12-15 08:35:37 |
合計ジャッジ時間 | 40,443 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
51,240 KB |
testcase_01 | AC | 74 ms
51,236 KB |
testcase_02 | AC | 82 ms
51,148 KB |
testcase_03 | AC | 75 ms
51,252 KB |
testcase_04 | AC | 84 ms
51,156 KB |
testcase_05 | AC | 77 ms
51,016 KB |
testcase_06 | AC | 73 ms
51,228 KB |
testcase_07 | AC | 81 ms
51,092 KB |
testcase_08 | AC | 71 ms
51,136 KB |
testcase_09 | AC | 77 ms
51,228 KB |
testcase_10 | AC | 81 ms
51,280 KB |
testcase_11 | AC | 86 ms
51,000 KB |
testcase_12 | AC | 136 ms
53,060 KB |
testcase_13 | AC | 93 ms
51,356 KB |
testcase_14 | AC | 171 ms
57,128 KB |
testcase_15 | AC | 162 ms
56,188 KB |
testcase_16 | AC | 187 ms
57,084 KB |
testcase_17 | AC | 365 ms
57,668 KB |
testcase_18 | AC | 313 ms
58,004 KB |
testcase_19 | AC | 87 ms
51,180 KB |
testcase_20 | AC | 89 ms
51,040 KB |
testcase_21 | AC | 155 ms
52,344 KB |
testcase_22 | AC | 129 ms
52,236 KB |
testcase_23 | AC | 97 ms
51,268 KB |
testcase_24 | AC | 550 ms
58,044 KB |
testcase_25 | AC | 156 ms
56,216 KB |
testcase_26 | AC | 203 ms
56,808 KB |
testcase_27 | AC | 536 ms
57,660 KB |
testcase_28 | AC | 3,399 ms
58,552 KB |
testcase_29 | AC | 520 ms
57,616 KB |
testcase_30 | AC | 495 ms
57,776 KB |
testcase_31 | AC | 561 ms
57,592 KB |
testcase_32 | AC | 517 ms
57,740 KB |
testcase_33 | AC | 2,496 ms
58,440 KB |
testcase_34 | AC | 2,089 ms
58,976 KB |
testcase_35 | AC | 4,666 ms
58,756 KB |
testcase_36 | AC | 4,774 ms
59,164 KB |
testcase_37 | AC | 4,811 ms
58,876 KB |
testcase_38 | AC | 3,332 ms
58,508 KB |
ソースコード
package contest211114;import java.io.*;import java.util.ArrayDeque;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Queue;import java.util.function.IntUnaryOperator;import java.util.function.LongUnaryOperator;public class A {InputStream is;FastWriter out;String INPUT = "";public void solve(){// N,M L辺 biparatite graph// 各辺について、それがなくても最大マッチングが成立するか// 最大マッチングをひとつつくり、そこに入っている辺のみ愚直にみるint n = ni(), m = ni(), L = ni();int[] from = new int[L];int[] to = new int[L];for(int i = 0;i < L;i++){from[i] = ni()-1;to[i] = ni()-1;}int[][] g = packD(n, from, to);int[] mat = doBipartiteMatchingHK(g, m);int nmat = 0;for(int v : mat)if(v != -1)nmat++;int[] ngs = new int[n];Arrays.fill(ngs, -1);for(int i = 0;i < n;i++){if(mat[i] == -1)continue;for(int j = 0;j < g[i].length;j++){if(g[i][j] == mat[i]){g[i][j] = -1;}}int[] hey = doBipartiteMatchingHK(g, m);int lnmat = 0;for(int v : hey)if(v != -1)lnmat++;if(nmat > lnmat){ngs[i] = mat[i];}for(int j = 0;j < g[i].length;j++){if(g[i][j] == -1){g[i][j] = mat[i];}}}for(int i = 0;i < L;i++){if(ngs[from[i]] == to[i]){out.println("No");}else{out.println("Yes");}}}public static int[] doBipartiteMatchingHK(int[][] g, int m){int n = g.length;if(n == 0)return new int[0];int[] from = new int[m];int[] to = new int[n];Arrays.fill(to, -1);Arrays.fill(from, n);int[] d = new int[n+1];int mat = 0;while(true){Arrays.fill(d, -1);int[] q = new int[n];int r = 0;for(int i = 0;i < n;i++){if(to[i] == -1){d[i] = 0;q[r++] = i;}}for(int p = 0;p < r;p++) {int cur = q[p];for(int adj : g[cur]){if(adj == -1)continue;int nex = from[adj];if(d[nex] == -1) {if(nex != n)q[r++] = nex;d[nex] = d[cur] + 1;}}}if(d[n] == -1)break;for(int i = 0;i < n;i++){if(to[i] == -1){if(dfsHK(d, g, n, m, to, from, i))mat++;}}}return to;}static boolean dfsHK(int[] d, int[][] g, int n, int m, int[] to, int[] from, int cur){if(cur == n)return true;for(int adj : g[cur]){if(adj == -1)continue;int nex = from[adj];if(d[nex] == d[cur] + 1 && dfsHK(d, g, n, m, to, from, nex)){to[cur] = adj;from[adj] = cur;return true;}}d[cur] = -1;return false;}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;}public static void main(String[] args) {new A().run();}public void run(){long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new FastWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-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();}private boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){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 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[] 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 int ni(){int num = 0, 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 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();}}public static class FastWriter{private static final int BUF_SIZE = 1<<13;private final byte[] buf = new byte[BUF_SIZE];private final OutputStream out;private int ptr = 0;private FastWriter(){out = null;}public FastWriter(OutputStream os){this.out = os;}public FastWriter(String path){try {this.out = new FileOutputStream(path);} catch (FileNotFoundException e) {throw new RuntimeException("FastWriter");}}public FastWriter write(byte b){buf[ptr++] = b;if(ptr == BUF_SIZE)innerflush();return this;}public FastWriter write(char c){return write((byte)c);}public FastWriter write(char[] s){for(char c : s){buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();}return this;}public FastWriter write(String s){s.chars().forEach(c -> {buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();});return this;}private static int countDigits(int l) {if (l >= 1000000000) return 10;if (l >= 100000000) return 9;if (l >= 10000000) return 8;if (l >= 1000000) return 7;if (l >= 100000) return 6;if (l >= 10000) return 5;if (l >= 1000) return 4;if (l >= 100) return 3;if (l >= 10) return 2;return 1;}public FastWriter write(int x){if(x == Integer.MIN_VALUE){return write((long)x);}if(ptr + 12 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}private static int countDigits(long l) {if (l >= 1000000000000000000L) return 19;if (l >= 100000000000000000L) return 18;if (l >= 10000000000000000L) return 17;if (l >= 1000000000000000L) return 16;if (l >= 100000000000000L) return 15;if (l >= 10000000000000L) return 14;if (l >= 1000000000000L) return 13;if (l >= 100000000000L) return 12;if (l >= 10000000000L) return 11;if (l >= 1000000000L) return 10;if (l >= 100000000L) return 9;if (l >= 10000000L) return 8;if (l >= 1000000L) return 7;if (l >= 100000L) return 6;if (l >= 10000L) return 5;if (l >= 1000L) return 4;if (l >= 100L) return 3;if (l >= 10L) return 2;return 1;}public FastWriter write(long x){if(x == Long.MIN_VALUE){return write("" + x);}if(ptr + 21 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}public FastWriter write(double x, int precision){if(x < 0){write('-');x = -x;}x += Math.pow(10, -precision)/2;// if(x < 0){ x = 0; }write((long)x).write(".");x -= (long)x;for(int i = 0;i < precision;i++){x *= 10;write((char)('0'+(int)x));x -= (int)x;}return this;}public FastWriter writeln(char c){ return write(c).writeln(); }public FastWriter writeln(int x){ return write(x).writeln(); }public FastWriter writeln(long x){ return write(x).writeln(); }public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }public FastWriter write(int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(IntUnaryOperator f, int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(f.applyAsInt(x));}return this;}public FastWriter write(LongUnaryOperator f, long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(f.applyAsLong(x));}return this;}public FastWriter writeln(){return write((byte)'\n');}public FastWriter writeln(int... xs) { return write(xs).writeln(); }public FastWriter writeln(long... xs) { return write(xs).writeln(); }public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }public FastWriter writeln(char[] line) { return write(line).writeln(); }public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }public FastWriter writeln(String s) { return write(s).writeln(); }private void innerflush(){try {out.write(buf, 0, ptr);ptr = 0;} catch (IOException e) {throw new RuntimeException("innerflush");}}public void flush(){innerflush();try {out.flush();} catch (IOException e) {throw new RuntimeException("flush");}}public FastWriter print(byte b) { return write(b); }public FastWriter print(char c) { return write(c); }public FastWriter print(char[] s) { return write(s); }public FastWriter print(String s) { return write(s); }public FastWriter print(int x) { return write(x); }public FastWriter print(long x) { return write(x); }public FastWriter print(double x, int precision) { return write(x, precision); }public FastWriter println(char c){ return writeln(c); }public FastWriter println(int x){ return writeln(x); }public FastWriter println(long x){ return writeln(x); }public FastWriter println(double x, int precision){ return writeln(x, precision); }public FastWriter print(int... xs) { return write(xs); }public FastWriter print(long... xs) { return write(xs); }public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }public FastWriter println(int... xs) { return writeln(xs); }public FastWriter println(long... xs) { return writeln(xs); }public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }public FastWriter println(char[] line) { return writeln(line); }public FastWriter println(char[]... map) { return writeln(map); }public FastWriter println(String s) { return writeln(s); }public FastWriter println() { return writeln(); }}public static void trnz(int... o){for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");System.out.println();}// print ids which are 1public static void trt(long... o){Queue<Integer> stands = new ArrayDeque<>();for(int i = 0;i < o.length;i++){for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));}System.out.println(stands);}public static void tf(boolean... r){for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}public static void tf(boolean[]... b){for(boolean[] r : b) {for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}System.out.println();}public void tf(long[]... b){if(INPUT.length() != 0) {for (long[] r : b) {for (long x : r) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}System.out.println();}}public void tf(long... b){if(INPUT.length() != 0) {for (long x : b) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}}private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }}