Submission #2869906
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define TRACE(x) x #define WATCH(x) TRACE(cout << #x" = " << x << endl) #define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl) #define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());}) #define all(x) (x).begin(), (x).end() typedef long long ll; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vll; typedef vector<vll> vvll; void calc_depths(vvi &tree, int loc, int par, int dep, vi &mc) { int nc = 0; for (int nbr : tree[loc]) { if (nbr != par) { nc++; calc_depths(tree, nbr, loc, dep+1, mc); } } if (nc) { while (mc.size() <= dep) mc.push_back(0); mc[dep] = max(mc[dep], nc); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); cout << fixed << setprecision(15); int N; cin >> N; vvi tree(N); for (int i = 0; i < N - 1; i++) { int u, v; cin >> u >> v; tree[u-1].push_back(v-1); tree[v-1].push_back(u-1); } int md = INT_MAX; vvi depths(N); for (int i = 0; i < N; i++) { calc_depths(tree, i, i, 0, depths[i]); md = min(md, (int) depths[i].size()); } vi centers; for (int i = 0; i < N; i++) { if (depths[i].size() == md) centers.push_back(i); } if (centers.size() == 2) { vi mc1; calc_depths(tree, centers[0], centers[1], 0, mc1); vi mc2; calc_depths(tree, centers[1], centers[0], 0, mc2); ll ans = 2; for (int i = 0; i < mc1.size(); i++) ans = ans * max(mc1[i], mc2[i]); cout << mc1.size() + 1 << " " << ans << endl; return 0; } // case that we just use the center as the root vi mc; calc_depths(tree, centers[0], centers[0], 0, mc); int col = mc.size() + 1; ll ans = 1; for (int v : mc) ans *= v; // try making a neighbor the second center for (int nbr : tree[centers[0]]) { vi mc1; calc_depths(tree, centers[0], nbr, 0, mc1); vi mc2; calc_depths(tree, nbr, centers[0], 0, mc2); while (mc1.size() < mc2.size()) mc1.push_back(0); while (mc2.size() < mc1.size()) mc2.push_back(0); ll cand = 2; for (int i = 0; i < mc1.size(); i++) cand *= max(mc1[i], mc2[i]); if (mc1.size() + 1 < col) { col = mc1.size() + 1; ans = cand; } else if (mc1.size() + 1 == col) { ans = min(ans, cand); } } cout << col << " " << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Isomorphism Freak |
User | socketnaut |
Language | C++14 (GCC 5.4.1) |
Score | 1100 |
Code Size | 2731 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1100 / 1100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, 73.txt, 74.txt, 75.txt, 76.txt, 77.txt, 78.txt, 79.txt, 80.txt, 81.txt, 82.txt, 83.txt, 84.txt, 85.txt, 86.txt, 87.txt, 88.txt, 89.txt, 90.txt, 91.txt, 92.txt, 93.txt, 94.txt, 95.txt, 96.txt, 97.txt, 98.txt, 99.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 384 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 1 ms | 256 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 1 ms | 256 KB |
29.txt | AC | 1 ms | 256 KB |
30.txt | AC | 1 ms | 256 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 1 ms | 256 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 1 ms | 256 KB |
35.txt | AC | 1 ms | 256 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 1 ms | 256 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 1 ms | 256 KB |
40.txt | AC | 1 ms | 256 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | AC | 1 ms | 256 KB |
46.txt | AC | 1 ms | 256 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | AC | 1 ms | 256 KB |
49.txt | AC | 1 ms | 256 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
53.txt | AC | 1 ms | 256 KB |
54.txt | AC | 1 ms | 256 KB |
55.txt | AC | 1 ms | 256 KB |
56.txt | AC | 1 ms | 256 KB |
57.txt | AC | 1 ms | 256 KB |
58.txt | AC | 1 ms | 256 KB |
59.txt | AC | 1 ms | 256 KB |
60.txt | AC | 1 ms | 256 KB |
61.txt | AC | 1 ms | 256 KB |
62.txt | AC | 1 ms | 256 KB |
63.txt | AC | 1 ms | 256 KB |
64.txt | AC | 1 ms | 256 KB |
65.txt | AC | 1 ms | 256 KB |
66.txt | AC | 1 ms | 256 KB |
67.txt | AC | 1 ms | 256 KB |
68.txt | AC | 1 ms | 256 KB |
69.txt | AC | 1 ms | 256 KB |
70.txt | AC | 1 ms | 256 KB |
71.txt | AC | 1 ms | 256 KB |
72.txt | AC | 1 ms | 256 KB |
73.txt | AC | 1 ms | 256 KB |
74.txt | AC | 1 ms | 256 KB |
75.txt | AC | 1 ms | 256 KB |
76.txt | AC | 1 ms | 256 KB |
77.txt | AC | 1 ms | 256 KB |
78.txt | AC | 1 ms | 256 KB |
79.txt | AC | 1 ms | 256 KB |
80.txt | AC | 1 ms | 256 KB |
81.txt | AC | 1 ms | 256 KB |
82.txt | AC | 1 ms | 256 KB |
83.txt | AC | 1 ms | 256 KB |
84.txt | AC | 1 ms | 256 KB |
85.txt | AC | 1 ms | 256 KB |
86.txt | AC | 1 ms | 256 KB |
87.txt | AC | 1 ms | 256 KB |
88.txt | AC | 1 ms | 256 KB |
89.txt | AC | 1 ms | 256 KB |
90.txt | AC | 1 ms | 256 KB |
91.txt | AC | 1 ms | 256 KB |
92.txt | AC | 1 ms | 256 KB |
93.txt | AC | 1 ms | 256 KB |
94.txt | AC | 1 ms | 256 KB |
95.txt | AC | 1 ms | 256 KB |
96.txt | AC | 1 ms | 256 KB |
97.txt | AC | 1 ms | 256 KB |
98.txt | AC | 1 ms | 256 KB |
99.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |