結果

問題 No.439 チワワのなる木
ユーザー tanzaku
提出日時 2016-10-28 23:04:18
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 375 ms
コード長 6,738 Byte
コンパイル時間 1,807 ms
使用メモリ 72,260 KB
最終ジャッジ日時 2019-10-11 11:35:30

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
in01.txt AC 77 ms
29,520 KB
in02.txt AC 76 ms
30,936 KB
in03.txt AC 76 ms
31,512 KB
in04.txt AC 76 ms
30,620 KB
in05.txt AC 78 ms
31,424 KB
in06.txt AC 77 ms
32,208 KB
in07.txt AC 77 ms
31,304 KB
in08.txt AC 77 ms
30,580 KB
r01.txt AC 78 ms
31,976 KB
r02.txt AC 77 ms
32,208 KB
r03.txt AC 77 ms
30,660 KB
r04.txt AC 76 ms
30,684 KB
r05.txt AC 77 ms
31,524 KB
r06.txt AC 95 ms
30,668 KB
r07.txt AC 82 ms
30,956 KB
r08.txt AC 108 ms
30,788 KB
r09.txt AC 95 ms
30,372 KB
r10.txt AC 91 ms
31,964 KB
r11.txt AC 252 ms
44,364 KB
r12.txt AC 229 ms
44,600 KB
r13.txt AC 329 ms
51,356 KB
r14.txt AC 158 ms
38,676 KB
r15.txt AC 154 ms
38,676 KB
z01.txt AC 351 ms
57,736 KB
z02.txt AC 375 ms
68,096 KB
z03.txt AC 306 ms
51,684 KB
z04.txt AC 300 ms
48,248 KB
z05.txt AC 237 ms
72,260 KB
テストケース一括ダウンロード

ソースコード

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

import static java.util.Arrays.*;

public class Main {
	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
	public void run() 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");
		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