結果

問題 No.439 チワワのなる木
ユーザー tanzakutanzaku
提出日時 2016-10-28 23:06:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 369 ms / 5,000 ms
コード長 7,070 bytes
コンパイル時間 2,350 ms
コンパイル使用メモリ 84,596 KB
実行使用メモリ 81,880 KB
最終ジャッジ日時 2024-11-24 06:18:26
合計ジャッジ時間 7,107 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
37,552 KB
testcase_01 AC 52 ms
37,168 KB
testcase_02 AC 50 ms
37,756 KB
testcase_03 AC 50 ms
37,708 KB
testcase_04 AC 51 ms
37,556 KB
testcase_05 AC 51 ms
37,280 KB
testcase_06 AC 53 ms
37,436 KB
testcase_07 AC 53 ms
37,604 KB
testcase_08 AC 52 ms
37,296 KB
testcase_09 AC 53 ms
37,800 KB
testcase_10 AC 54 ms
37,836 KB
testcase_11 AC 53 ms
37,288 KB
testcase_12 AC 52 ms
37,708 KB
testcase_13 AC 56 ms
37,712 KB
testcase_14 AC 58 ms
37,824 KB
testcase_15 AC 60 ms
38,280 KB
testcase_16 AC 64 ms
38,352 KB
testcase_17 AC 62 ms
38,336 KB
testcase_18 AC 263 ms
57,120 KB
testcase_19 AC 251 ms
56,868 KB
testcase_20 AC 358 ms
59,568 KB
testcase_21 AC 140 ms
47,272 KB
testcase_22 AC 131 ms
46,296 KB
testcase_23 AC 345 ms
60,740 KB
testcase_24 AC 369 ms
70,244 KB
testcase_25 AC 334 ms
63,592 KB
testcase_26 AC 332 ms
63,092 KB
testcase_27 AC 275 ms
81,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;

import static java.util.Arrays.*;

public class Main implements Runnable {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

//	TreeMap<Integer, Integer>[] comb = new TreeMap[100000];
	
	/// MAIN CODE
	@Override
	public void run() {
		try {
			runMain();
		}
		catch(Exception e) {
			
		}
	}
	
	public void runMain() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int n = io.nextInt();
			cs = io.next();
//			cs = new char[n];
//			for (int i = 0; i < n; i++) cs[i] = "cw".charAt(random.nextInt(2));
			g = new List[n];
			for (int i = 0; i < n; i++) g[i] = new ArrayList<>();
			for (int i = 0; i < n - 1; i++) {
				int a = io.nextInt() - 1;
				int b = io.nextInt() - 1;
//				int a = i;
//				int b = a + 1;
				g[a].add(b);
				g[b].add(a);
			}
			val1 = new long[n];
			val2 = new long[n];
			dfs(0, -1);
//			dump(val1, val2);
			io.out.println(dfs2(0, -1, 0, 0));
		}
	}
	
	List<Integer>[] g;
	char[] cs;
	long[] val1;
	long[] val2;
	
	void dfs(int v, int p) {
		if (cs[v] == 'w') {
			val1[v]++;
		}
		for (int t : g[v]) if (t != p) {
			dfs(t, v);
			val1[v] += val1[t];
			val2[v] += val2[t] + (cs[v] == 'w' ? val1[t] : 0);
		}
	}
	
	long dfs2(int v, int p, long c1, long c2) {
		long ans = 0;
//		long sum = 0;
		
		c2 += val2[v];
		if (p != -1 && cs[v] == 'w') c2 += c1;
		c1 += val1[v];
		
		for (int t : g[v]) if (t != p) {
			long v2 = c2 - val2[t] - (cs[v] == 'w' ? val1[t] : 0);
			long v1 = c1 - val1[t];
			ans += dfs2(t, v, v1, v2);
//			sum += val2[v];
		}
		if (cs[v] == 'c') ans += c2;
//		dump(v, p, c1, c2, ans);
		return ans;
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
      Thread thread = new Thread(null, this, "0", 1<<25);
      thread.start();
      try {
		thread.join();
	} catch (InterruptedException e1) {
		// TODO Auto-generated catch block
		e1.printStackTrace();
	}
//		try { run(); }
//		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0