結果
問題 | No.763 Noelちゃんと木遊び |
ユーザー | te-sh |
提出日時 | 2020-02-08 16:37:14 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 170 ms / 2,000 ms |
コード長 | 4,453 bytes |
コンパイル時間 | 1,296 ms |
コンパイル使用メモリ | 147,688 KB |
実行使用メモリ | 14,668 KB |
最終ジャッジ日時 | 2023-09-04 05:33:54 |
合計ジャッジ時間 | 5,567 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
14,436 KB |
testcase_01 | AC | 53 ms
8,160 KB |
testcase_02 | AC | 133 ms
13,860 KB |
testcase_03 | AC | 87 ms
11,528 KB |
testcase_04 | AC | 60 ms
10,292 KB |
testcase_05 | AC | 83 ms
10,024 KB |
testcase_06 | AC | 162 ms
14,644 KB |
testcase_07 | AC | 156 ms
14,612 KB |
testcase_08 | AC | 93 ms
11,344 KB |
testcase_09 | AC | 58 ms
8,272 KB |
testcase_10 | AC | 23 ms
4,752 KB |
testcase_11 | AC | 170 ms
14,668 KB |
testcase_12 | AC | 149 ms
13,620 KB |
testcase_13 | AC | 148 ms
13,436 KB |
testcase_14 | AC | 121 ms
12,304 KB |
testcase_15 | AC | 86 ms
10,292 KB |
testcase_16 | AC | 13 ms
4,376 KB |
testcase_17 | AC | 85 ms
11,068 KB |
testcase_18 | AC | 165 ms
14,668 KB |
testcase_19 | AC | 147 ms
13,612 KB |
testcase_20 | AC | 150 ms
13,676 KB |
コンパイルメッセージ
Main.d(153): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", int).put.putMain!(c, int).putMain` function requires a dual-context, which is deprecated Main.d-mixin-141(141): instantiated from here: `putMain!(c, int)` Main.d(26): instantiated from here: `put!("{}", int)`
ソースコード
// URL: https://yukicoder.me/problems/no/763 import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string; version(unittest) {} else void main() { int N; io.getV(N); auto g = Graph(N); foreach (_; 0..N-1) { int U, V; io.getV(U, V); --U; --V; g.addEdgeB(U, V); } auto t = g.tree(0); auto a = new int[](N), b = new int[](N); foreach_reverse (u; t.dfsOrder) { a[u] = 1; foreach (v; t.children(u)) { a[u] += max(a[v]-1, b[v]); b[u] += max(a[v], b[v]); } } io.put(max(a[0], b[0])); } struct Graph { alias Node = int; Node n; Node[][] g; alias g this; this(Node n) { this.n = n; g = new Node[][](n); } void addEdge(Node u, Node v) { g[u] ~= v; } void addEdgeB(Node u, Node v) { g[u] ~= v; g[v] ~= u; } } struct GraphW(W = int, W i = 10^^9) { alias Node = int, Wt = W, inf = i; struct Edge { Node src, dst; Wt wt; alias cap = wt; } Node n; Edge[][] g; alias g this; this(Node n) { this.n = n; g = new Edge[][](n); } void addEdge(Node u, Node v, Wt w) { g[u] ~= Edge(u, v, w); } void addEdgeB(Node u, Node v, Wt w) { g[u] ~= Edge(u, v, w); g[v] ~= Edge(v, u, w); } } struct GraphM(W = int, W i = 10^^9) { alias Node = int, Wt = W, inf = i; Node n; Wt[][] g; alias g this; this(int n) { this.n = n; g = new Wt[][](n, n); } static GraphM!(W, i) init(Node n) { auto g = GraphM!(W, i)(n); foreach (i; 0..n) { g[i][] = inf; g[i][i] = 0; } return g; } } struct Tree(Graph) { alias Node = Graph.Node; Graph g; alias g this; Node root; Node[] parent; Node[] dfsOrder; int[] size; int[] depth; this(Graph g, Node r) { this.g = g; this.root = r; parent = new Node[](n); depth = new int[](n); depth[] = -1; struct UP { Node u, p; } auto st = SList!UP(UP(r, r)); while (!st.empty) { auto up = st.front; st.removeFront(); parent[up.u] = up.p; depth[up.u] = depth[up.p] + 1; dfsOrder ~= up.u; foreach (v; g[up.u]) if (v != up.p) st.insertFront(UP(v, up.u)); } size = new int[](n); size[] = 1; foreach_reverse (u; dfsOrder.drop(1)) size[parent[u]] += size[u]; } pure auto children(Node u) { return g[u].filter!(v => v != parent[u]); } } Tree!Graph tree(Graph, Node)(Graph g, Node r) { return Tree!Graph(g, r); } auto io = IO!()(); import std.stdio; struct IO(alias IN = stdin, alias OUT = stdout) { import std.conv, std.format, std.meta, std.traits, core.stdc.stdlib; auto getV(T...)(ref T v) { foreach (ref w; v) get(w); } auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T) { v = new T(n); foreach (ref w; v) get(w); } auto getC(T...)(size_t n, ref T v) if (allSatisfy!(hasAssignableElements, T)) { foreach (ref w; v) w = new typeof(w)(n); foreach (i; 0..n) foreach (ref w; v) get(w[i]); } auto getM(T)(size_t r, size_t c, ref T v) if (hasAssignableElements!T && hasAssignableElements!(ElementType!T)) { v = new T(r); foreach (ref w; v) getA(c, w); } template getS(E...) { auto getS(T)(size_t n, ref T v) { v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");"); } } const struct PutConf { bool newline = true, flush, exit; string floatFormat = "%.10f", delimiter = " "; } auto put(alias conf = "{}", T...)(T v) { mixin("const PutConf c = "~conf~"; putMain!c(v);"); } auto putB(alias conf = "{}", S, T)(bool c, S t, T f) { if (c) put(t); else put(f); } auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; } private { dchar[] buf; auto sp = (new dchar[](0)).splitter; void nextLine() { IN.readln(buf); sp = buf.splitter; } auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); } auto putMain(PutConf c, T...)(T v) { foreach (i, w; v) { putOne!c(w); if (i < v.length-1) OUT.write(c.delimiter); } static if (c.newline) OUT.writeln; static if (c.flush) OUT.flush(); static if (c.exit) exit(0); } auto putOne(PutConf c, T)(T v) { static if (isInputRange!T && !isSomeString!T) putRange!c(v); else if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v)); else OUT.write(v); } auto putRange(PutConf c, T)(T v) { auto w = v; while (!w.empty) { putOne!c(w.front); w.popFront(); if (!w.empty) OUT.write(c.delimiter); } } } }