結果
| 問題 | No.1983 [Cherry 4th Tune C] 南の島のマーメイド |
| ユーザー |
 uwi
|
| 提出日時 | 2022-06-17 22:18:50 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 2,850 ms / 4,000 ms |
| コード長 | 17,973 bytes |
| コンパイル時間 | 5,704 ms |
| コンパイル使用メモリ | 93,740 KB |
| 実行使用メモリ | 162,404 KB |
| 最終ジャッジ日時 | 2024-10-09 08:23:27 |
| 合計ジャッジ時間 | 47,828 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 86 ms
38,088 KB |
| testcase_01 | AC | 85 ms
38,144 KB |
| testcase_02 | AC | 84 ms
38,108 KB |
| testcase_03 | AC | 86 ms
38,484 KB |
| testcase_04 | AC | 85 ms
37,944 KB |
| testcase_05 | AC | 84 ms
38,164 KB |
| testcase_06 | AC | 85 ms
38,252 KB |
| testcase_07 | AC | 87 ms
38,136 KB |
| testcase_08 | AC | 168 ms
41,812 KB |
| testcase_09 | AC | 177 ms
45,604 KB |
| testcase_10 | AC | 232 ms
48,256 KB |
| testcase_11 | AC | 218 ms
48,288 KB |
| testcase_12 | AC | 154 ms
43,148 KB |
| testcase_13 | AC | 911 ms
75,168 KB |
| testcase_14 | AC | 1,308 ms
77,748 KB |
| testcase_15 | AC | 1,240 ms
92,820 KB |
| testcase_16 | AC | 862 ms
97,236 KB |
| testcase_17 | AC | 1,225 ms
105,616 KB |
| testcase_18 | AC | 1,145 ms
96,224 KB |
| testcase_19 | AC | 1,351 ms
115,292 KB |
| testcase_20 | AC | 1,059 ms
93,272 KB |
| testcase_21 | AC | 1,195 ms
90,048 KB |
| testcase_22 | AC | 1,660 ms
105,052 KB |
| testcase_23 | AC | 1,531 ms
119,456 KB |
| testcase_24 | AC | 1,623 ms
118,972 KB |
| testcase_25 | AC | 1,543 ms
119,248 KB |
| testcase_26 | AC | 1,481 ms
118,616 KB |
| testcase_27 | AC | 1,512 ms
118,992 KB |
| testcase_28 | AC | 1,554 ms
118,640 KB |
| testcase_29 | AC | 1,546 ms
119,196 KB |
| testcase_30 | AC | 1,519 ms
119,376 KB |
| testcase_31 | AC | 1,548 ms
119,328 KB |
| testcase_32 | AC | 1,515 ms
118,936 KB |
| testcase_33 | AC | 86 ms
37,760 KB |
| testcase_34 | AC | 750 ms
101,952 KB |
| testcase_35 | AC | 2,715 ms
153,888 KB |
| testcase_36 | AC | 1,385 ms
142,964 KB |
| testcase_37 | AC | 85 ms
37,812 KB |
| testcase_38 | AC | 245 ms
46,876 KB |
| testcase_39 | AC | 2,850 ms
162,404 KB |
| testcase_40 | AC | 1,090 ms
117,192 KB |
ソースコード
package contest220617;
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
public class E {
InputStream is;
FastWriter out;
String INPUT = "";
public void solve() {
int n = ni(), m = ni(), Q = ni();
int[] from = new int[m+2*n];
int[] to = new int[m+2*n];
int[] ws = new int[m+2*n];
Set<Long> hit = new HashSet<>();
for (int i = 0; i < m; i++) {
from[i] = ni() - 1;
to[i] = ni() - 1;
ws[i] = i;
hit.add((long)from[i]<<32|to[i]);
hit.add((long)to[i]<<32|from[i]);
}
int[][][] g = packWU(n, from, to, ws, m);
DJSet ds = new DJSet(n);
for(int i = 0;i < m;i++){
ds.union(from[i], to[i]);
}
int p = m;
for(int i = 0;i < n;i++){
if(ds.upper[i] < 0){
from[p] = i; to[p] = n; ws[p] = p; p++;
from[p] = i; to[p] = n+1; ws[p] = p; p++;
}
}
g = packWU(n+2, from, to, ws, p);
BCDatum dat = decomposeToBiconnectedComponents(g);
int[][] h = buildBlockCutTree(dat);
int[] ff = new int[p];
for(int i = 0;i < p;i++){
ff[dat.edgeClus[i]]++;
}
int[] whom = new int[n+2];
Arrays.fill(whom, -1);
for(int i = 0;i < p;i++){
if(!dat.isArtic[from[i]]){
whom[from[i]] = dat.edgeClus[i];
}
if(!dat.isArtic[to[i]]){
whom[to[i]] = dat.edgeClus[i];
}
}
int nart = 0;
for(int i = 0;i < n+2;i++){
if(dat.isArtic[i])nart++;
}
int ncc = h.length - nart;
//
// int[] f = new int[h.length];
// for(int i = 0;i < n+2;i++){
// if(whom[i] != -1){
// f[whom[i]]++;
// }
// }
DJSet ds2 = new DJSet(h.length);
for(int i = 0;i < h.length;i++){
for(int e : h[i]){
if((i >= ncc || ff[i] <= 1) && (e >= ncc || ff[e] <= 1)){
ds2.union(i, e);
}
}
}
int[] arid = new int[n+2];
Arrays.fill(arid, -1);
int u = ncc;
for(int i = 0;i < n+2;i++){
if(dat.isArtic[i]){
arid[i] = u++;
}
}
// tr(arid);
// tr(f);
for(int z = 0;z < Q;z++){
int x = ni()-1;
int y = ni()-1;
int tx = dat.isArtic[x] ? arid[x] : whom[x];
int ty = dat.isArtic[y] ? arid[y] : whom[y];
if(tx == ty){
out.println("No");
}else{
out.println(ds2.equiv(tx, ty) ? "Yes" : "No");
}
}
}
public static int[][] buildBlockCutTree(BCDatum dat)
{
int n = dat.g.length;
int m = dat.ecp;
int[] artics = new int[n];
Arrays.fill(artics, -1);
int q = 0;
for(int i = 0;i < n;i++){
if(dat.isArtic[i]){
artics[i] = q++;
}
}
int[] from = new int[q+m-1];
int[] to = new int[q+m-1];
// m+q
int p = 0;
int[] temp = new int[n];
for(int i = 0;i < n;i++){
if(dat.isArtic[i]){
int lp = 0;
for(int[] e : dat.g[i]){
temp[lp++] = dat.edgeClus[e[1]];
}
assert lp >= 2;
Arrays.sort(temp, 0, lp);
for(int j = 0;j < lp;j++){
if(j == 0 || temp[j] != temp[j-1]){
from[p] = m+artics[i]; to[p] = temp[j]; p++;
}
}
}
}
assert p == from.length;
return packU(q+m, from, to);
}
public static int[][] packU(int n, int[] from, int[] to) {
return packU(n, from, to, from.length);
}
public static int[][] packU(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 < sup; i++) p[to[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];
g[to[i]][--p[to[i]]] = from[i];
}
return g;
}
public static class DJSet {
public int[] upper;
public DJSet(int n) {
upper = new int[n];
Arrays.fill(upper, -1);
}
public int root(int x) {
return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
}
public boolean equiv(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (upper[y] < upper[x]) {
int d = x;
x = y;
y = d;
}
upper[x] += upper[y];
upper[y] = x;
}
return x == y;
}
public int count() {
int ct = 0;
for (int u : upper) if (u < 0) ct++;
return ct;
}
public int[][] toBucket() {
int n = upper.length;
int[][] ret = new int[n][];
int[] rp = new int[n];
for (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];
for (int i = 0; i < n; i++) {
int r = root(i);
ret[r][rp[r]++] = i;
}
return ret;
}
}
public static int[][][] packWU(int n, int[] from, int[] to, int[] w) {
return packWU(n, from, to, w, from.length);
}
public static int[][][] packWU(int n, int[] from, int[] to, int[] w, 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 < sup; i++) p[to[i]]++;
for (int i = 0; i < n; i++) g[i] = new int[p[i]][2];
for (int i = 0; i < sup; i++) {
--p[from[i]];
g[from[i]][p[from[i]]][0] = to[i];
g[from[i]][p[from[i]]][1] = w[i];
--p[to[i]];
g[to[i]][p[to[i]]][0] = from[i];
g[to[i]][p[to[i]]][1] = w[i];
}
return g;
}
public static BCDatum decomposeToBiconnectedComponents(int[][][] g)
{
int n = g.length;
int m = 0;
for(int[][] row : g)m += row.length;
m /= 2;
BCDatum d = new BCDatum();
d.g = g;
d.gen = 0;
d.low = new int[n];
Arrays.fill(d.low, -1);
d.ord = new int[n];
Arrays.fill(d.ord, -1);
d.edgeStack = new int[m];
d.esp = 0;
d.edgeClus = new int[m];
Arrays.fill(d.edgeClus, -1);
d.visited = new boolean[n];
d.parente = new int[n];
d.isArtic = new boolean[n];
Arrays.fill(d.parente, -1);
for(int i = 0;i < n;i++){
if(!d.visited[i])dfsBC(i, d);
}
assert d.esp == 0;
return d;
}
private static void dfsBC(int cur, BCDatum d)
{
d.visited[cur] = true;
d.low[cur] = d.ord[cur] = d.gen++;
int dfsch = 0;
for(int[] e : d.g[cur]){
if(!d.visited[e[0]]){
d.edgeStack[d.esp++] = e[1];
d.parente[e[0]] = e[1];
dfsch++;
dfsBC(e[0], d);
if(d.low[e[0]] >= d.ord[cur]){
d.isArtic[cur] = true;
while(d.esp > 0){
d.edgeClus[d.edgeStack[--d.esp]] = d.ecp;
if(d.edgeStack[d.esp] == e[1])break;
}
d.ecp++;
}
d.low[cur] = Math.min(d.low[cur], d.low[e[0]]);
}else if(d.parente[cur] != e[1] && d.ord[e[0]] < d.ord[cur]){
// e is a back edge from cur to its ancestor e[0]
d.edgeStack[d.esp++] = e[1];
d.low[cur] = Math.min(d.low[cur], d.ord[e[0]]);
}
}
if(d.parente[cur] < 0 && dfsch == 1)d.isArtic[cur] = false; // if root node and degree on dfs tree = 1 then not articulation point.
}
public static class BCDatum
{
public int[][][] g;
public int[] edgeClus;
public int ecp;
public int gen;
public int[] ord;
public int[] low;
public int[] edgeStack;
public int esp;
public boolean[] visited;
public int[] parente;
public boolean[] isArtic;
}
public static void main(String[] args) {
new E().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[][] 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[] 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 1
public 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)); }
}