Submission #1261271
Source Code Expand
#define _USE_MATH_DEFINES #include <cstdio> #include <iostream> #include <sstream> #include <fstream> #include <iomanip> #include <algorithm> #include <cmath> #include <complex> #include <string> #include <vector> #include <list> #include <queue> #include <stack> #include <set> #include <map> #include <bitset> #include <numeric> #include <limits> #include <climits> #include <cfloat> #include <functional> #include <iterator> using namespace std; vector<vector<int> > edges; int solve(int curr, int prev, int& ans) { vector<int> v(2, 0); for(int next : edges[curr]){ if(next != prev) v.push_back(solve(next, curr, ans)); } sort(v.rbegin(), v.rend()); int cnt = v[0] + v[1]; if(edges[curr].size() == 2){ ++ cnt; ans = max(ans, cnt); return v[0] + 1; } else{ ans = max(ans, cnt); return v[0]; } } int main() { int n; cin >> n; edges.assign(n, vector<int>()); for(int i=0; i<n-1; ++i){ int p, q; cin >> p >> q; -- p; -- q; edges[p].push_back(q); edges[q].push_back(p); } int leaf = 0; for(int i=0; i<n; ++i){ if(edges[i].size() == 1) ++ leaf; } int ans = 0; solve(0, -1, ans); ans += leaf; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | K - Problem on Tree |
User | mamekin |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1424 Byte |
Status | AC |
Exec Time | 90 ms |
Memory | 5888 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 71 ms | 4864 KB |
subtask1_02.txt | AC | 57 ms | 3968 KB |
subtask1_03.txt | AC | 23 ms | 1792 KB |
subtask1_04.txt | AC | 30 ms | 2304 KB |
subtask1_05.txt | AC | 36 ms | 2688 KB |
subtask1_06.txt | AC | 4 ms | 512 KB |
subtask1_07.txt | AC | 84 ms | 5760 KB |
subtask1_08.txt | AC | 22 ms | 1792 KB |
subtask1_09.txt | AC | 51 ms | 3712 KB |
subtask1_10.txt | AC | 67 ms | 4608 KB |
subtask1_11.txt | AC | 30 ms | 2304 KB |
subtask1_12.txt | AC | 12 ms | 1024 KB |
subtask1_13.txt | AC | 7 ms | 640 KB |
subtask1_14.txt | AC | 7 ms | 768 KB |
subtask1_15.txt | AC | 86 ms | 5760 KB |
subtask1_16.txt | AC | 87 ms | 5760 KB |
subtask1_17.txt | AC | 85 ms | 5760 KB |
subtask1_18.txt | AC | 83 ms | 5760 KB |
subtask1_19.txt | AC | 85 ms | 5760 KB |
subtask1_20.txt | AC | 85 ms | 5760 KB |
subtask1_21.txt | AC | 86 ms | 5760 KB |
subtask1_22.txt | AC | 83 ms | 5760 KB |
subtask1_23.txt | AC | 85 ms | 5760 KB |
subtask1_24.txt | AC | 90 ms | 5760 KB |
subtask1_25.txt | AC | 85 ms | 5760 KB |
subtask1_26.txt | AC | 89 ms | 5760 KB |
subtask1_27.txt | AC | 87 ms | 5760 KB |
subtask1_28.txt | AC | 86 ms | 5760 KB |
subtask1_29.txt | AC | 89 ms | 5888 KB |
subtask1_30.txt | AC | 86 ms | 5760 KB |
subtask1_31.txt | AC | 86 ms | 5888 KB |
subtask1_32.txt | AC | 86 ms | 5760 KB |
subtask1_33.txt | AC | 87 ms | 5760 KB |
subtask1_34.txt | AC | 85 ms | 5760 KB |
subtask1_35.txt | AC | 86 ms | 5760 KB |
subtask1_36.txt | AC | 85 ms | 5760 KB |
subtask1_37.txt | AC | 86 ms | 5760 KB |
subtask1_38.txt | AC | 85 ms | 5760 KB |
subtask1_39.txt | AC | 85 ms | 5760 KB |