Advertisement
pb_jiang

logu P2016 WA

Jan 24th, 2023
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.92 KB | None | 0 0
  1.  vector<vector<T>>(m, vector<T>(n)); }
  2. template <class T, T init> inline auto vv(int m) { return vector<vector<T>>(m, vector<T>(m, init)); }
  3. template <class T, T init> inline auto vv(int m, int n) { return vector<vector<T>>(m, vector<T>(n, init)); }
  4.  
  5. template <class T> using mpq = priority_queue<T, vector<T>, greater<T>>;
  6.  
  7. using ll = long long;
  8. using pii = pair<int, int>;
  9. using vl = vector<ll>;
  10. using vi = vector<int>;
  11.  
  12. int n;
  13. vi g[2048];
  14.  
  15. pii dfs(int u, int pa)
  16. {
  17.     int all = 0;
  18.     int min_delta = INT_MAX / 2;
  19.     for (auto v : g[u]) {
  20.         if (v == pa)
  21.             continue;
  22.         auto [sw, swn] = dfs(v, u);
  23.         all += min(sw, swn);
  24.         min_delta = min(min_delta, sw - swn);
  25.     }
  26.     return {all + 1, all + (min_delta > 0 ? min_delta : 0)};
  27. }
  28.  
  29. int main(int argc, char **argv)
  30. {
  31.     cin >> n;
  32.     for (int i = 0; i < n; ++i) {
  33.         int u, v, k;
  34.         cin >> u >> k;
  35.         for (int
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement