結果
| 問題 | No.2115 Making Forest Easy |
| ユーザー |
 uwi
|
| 提出日時 | 2022-10-28 23:23:00 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 15,967 bytes |
| コンパイル時間 | 4,402 ms |
| コンパイル使用メモリ | 93,968 KB |
| 実行使用メモリ | 54,760 KB |
| 最終ジャッジ日時 | 2024-07-06 02:39:12 |
| 合計ジャッジ時間 | 46,982 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 58 ms
37,224 KB |
| testcase_01 | AC | 57 ms
37,372 KB |
| testcase_02 | AC | 795 ms
53,388 KB |
| testcase_03 | TLE | - |
| testcase_04 | AC | 970 ms
53,884 KB |
| testcase_05 | AC | 884 ms
53,188 KB |
| testcase_06 | AC | 809 ms
52,860 KB |
| testcase_07 | AC | 1,255 ms
53,336 KB |
| testcase_08 | AC | 798 ms
52,844 KB |
| testcase_09 | AC | 876 ms
53,904 KB |
| testcase_10 | AC | 778 ms
53,284 KB |
| testcase_11 | AC | 1,435 ms
54,000 KB |
| testcase_12 | AC | 887 ms
53,772 KB |
| testcase_13 | AC | 905 ms
52,588 KB |
| testcase_14 | AC | 908 ms
53,220 KB |
| testcase_15 | AC | 1,258 ms
54,104 KB |
| testcase_16 | AC | 1,148 ms
54,256 KB |
| testcase_17 | AC | 138 ms
45,604 KB |
| testcase_18 | AC | 168 ms
46,332 KB |
| testcase_19 | AC | 555 ms
52,992 KB |
| testcase_20 | AC | 946 ms
53,340 KB |
| testcase_21 | AC | 122 ms
45,092 KB |
| testcase_22 | AC | 415 ms
51,452 KB |
| testcase_23 | AC | 617 ms
52,556 KB |
| testcase_24 | AC | 1,369 ms
53,328 KB |
| testcase_25 | AC | 470 ms
52,628 KB |
| testcase_26 | AC | 840 ms
53,260 KB |
| testcase_27 | AC | 732 ms
52,828 KB |
| testcase_28 | AC | 1,249 ms
53,464 KB |
| testcase_29 | AC | 136 ms
44,044 KB |
| testcase_30 | AC | 1,415 ms
54,472 KB |
| testcase_31 | AC | 919 ms
53,480 KB |
| testcase_32 | AC | 774 ms
52,392 KB |
| testcase_33 | AC | 759 ms
52,840 KB |
| testcase_34 | AC | 195 ms
48,852 KB |
| testcase_35 | AC | 238 ms
46,676 KB |
| testcase_36 | AC | 775 ms
53,748 KB |
| testcase_37 | AC | 616 ms
52,144 KB |
| testcase_38 | AC | 341 ms
51,120 KB |
| testcase_39 | AC | 380 ms
51,704 KB |
| testcase_40 | AC | 1,179 ms
52,960 KB |
| testcase_41 | AC | 888 ms
53,044 KB |
| testcase_42 | AC | 1,533 ms
53,904 KB |
| testcase_43 | AC | 532 ms
52,596 KB |
| testcase_44 | AC | 370 ms
52,116 KB |
| testcase_45 | AC | 859 ms
53,400 KB |
| testcase_46 | AC | 910 ms
54,080 KB |
| testcase_47 | AC | 617 ms
52,956 KB |
| testcase_48 | AC | 954 ms
52,996 KB |
| testcase_49 | AC | 915 ms
53,388 KB |
| testcase_50 | AC | 790 ms
53,276 KB |
| testcase_51 | AC | 531 ms
52,368 KB |
ソースコード
package contest221028;
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 G3 {
InputStream is;
FastWriter out;
String INPUT = "";
public void solve()
{
final int mod = 998244353;
int n = ni();
int[] a = na(n);
int[] from = new int[n - 1];
int[] to = new int[n - 1];
for (int i = 0; i < n - 1; i++) {
from[i] = ni() - 1;
to[i] = ni() - 1;
}
long ans = 0;
int[][] g = packU(n, from, to);
long[] ps = enumPows((mod+1)/2, n+1, mod);
for(int root = 0;root < n;root++) {
int[][] pars = parents(g, root);
int[] par = pars[0], ord = pars[1], dep = pars[2];
boolean[] valid = new boolean[n];
valid[root] = true;
for(int i = 1;i < n;i++){
int cur = ord[i];
if(valid[par[cur]] && (a[cur] < a[root] || a[cur] == a[root] && cur < root)){
valid[cur] = true;
}
}
long[] safe = new long[n];
long[][] lss = new long[n][];
long[][] rss = new long[n][];
for(int i = n-1;i >= 0;i--){
int cur = ord[i];
if(valid[cur]){
safe[cur] = 1;
long[] ls = new long[g[cur].length+1];
ls[0] = 1;
for(int j = 0;j < g[cur].length;j++){
int e = g[cur][j];
ls[j+1] = ls[j];
if(par[cur] == e){
ls[j+1] = ls[j] * 2 % mod;
continue;
}
if(valid[e]){
ls[j+1] = ls[j+1] * (safe[e]+1) % mod;
}
}
long[] rs = new long[g[cur].length+1];
rs[0] = 1;
for(int j = 0;j < g[cur].length;j++){
int e = g[cur][g[cur].length-1-j];
rs[j+1] = rs[j];
if(par[cur] == e){
rs[j+1] = rs[j] * 2 % mod;
continue;
}
if(valid[e]){
rs[j+1] = rs[j+1] * (safe[e]+1) % mod;
}
}
safe[cur] = ls[g[cur].length] * ps[g[cur].length] % mod;
lss[cur] = ls;
rss[cur] = rs;
}
}
// tr(safe);
// for(long v : safe)tr(guessFrac(v, mod));
long[] isafe = new long[n];
isafe[root] = 1;
for(int i = 0;i < n;i++){
int cur = ord[i];
if(!valid[cur])continue;
long h = isafe[cur] * ps[g[cur].length-1] % mod;
for(int j = 0;j < g[cur].length;j++){
int e = g[cur][j];
if(par[cur] == e)continue;
if(valid[e]){
isafe[e] = h * lss[cur][j] % mod * rss[cur][g[cur].length-j-1] % mod;
}
}
}
long lans = 0;
for(int i = 0;i < n;i++){
int cur = ord[i];
if(valid[cur]){
lans += ps[dep[cur]] * isafe[cur] % mod * safe[cur];
// tr(cur, guessFrac(ps[dep[cur]] * isafe[cur] % mod * safe[cur] % mod, mod));
lans %= mod;
}
}
ans += a[root] * lans;
ans %= mod;
}
ans = ans * pow(2, n-1, mod) % mod;
out.println(ans);
}
public static long invl(long a, long mod) {
long b = mod;
long p = 1, q = 0;
while (b > 0) {
long c = a / b;
long d;
d = a;
a = b;
b = d % b;
d = p;
p = q;
q = d - c * q;
}
return p < 0 ? p + mod : p;
}
public static long[] guessFrac(long n, int mod)
{
long min = mod;
long argnum = -1, argden = 0;
for(int den = 1;den <= 200000;den++){
long num = n*den%mod;
if(num*2 >= mod)num -= mod;
if(Math.abs(num) + den < min){
min = Math.abs(num) + den;
argnum = num;
argden = den;
}
}
return argden == 0 ? null : new long[]{argnum, argden};
}
public static long pow(long a, long n, long mod) {
// a %= mod;
long ret = 1;
int x = 63 - Long.numberOfLeadingZeros(n);
for (; x >= 0; x--) {
ret = ret * ret % mod;
if (n << 63 - x < 0) ret = ret * a % mod;
}
return ret;
}
public static long[] enumPows(int a, int n, int mod)
{
a %= mod;
long[] pows = new long[n+1];
pows[0] = 1;
for(int i = 1;i <= n;i++)pows[i] = pows[i-1] * a % mod;
return pows;
}
public static int[][] parents(int[][] g, int root) {
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
int[] depth = new int[n];
depth[0] = 0;
int[] q = new int[n];
q[0] = root;
for (int p = 0, r = 1; p < r; p++) {
int cur = q[p];
for (int nex : g[cur]) {
if (par[cur] != nex) {
q[r++] = nex;
par[nex] = cur;
depth[nex] = depth[cur] + 1;
}
}
}
return new int[][]{par, q, depth};
}
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 void main(String[] args) {
new G3().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)); }
}