# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
355536 | 2021-01-22T16:48:38 Z | Lam_lai_cuoc_doi | Power Plant (JOI20_power) | C++17 | 2 ms | 2668 KB |
#include <iostream> #include <cstdio> #include <vector> #define task "" using namespace std; using ll = long long; using ld = long double; const int N = 1e5 + 2; const int Inf = 1e9 + 7; vector<int> adj[N]; int n, dp[N], root; bool vis[N]; string s; void Read() { cin >> n; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } cin >> s; s = " " + s; } void dfs(int v) { dp[v] = s[v] - '0'; int sum(0); for (auto i : adj[v]) if (dp[i] == -Inf) { dfs(i); sum += dp[i]; dp[v] = max(dp[v], dp[i] + 1); } dp[v] = max(dp[v], sum - (s[v] - '0')); } int GetAns(int v) { fill(dp, dp + n + 1, -Inf); root = v; dfs(v); return dp[v]; } void Solve() { cout << GetAns(1); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen(task ".INP", "r")) { freopen(task ".INP", "r", stdin); freopen(task ".OUT", "w", stdout); } Read(); Solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2668 KB | Output is correct |
2 | Incorrect | 2 ms | 2668 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2668 KB | Output is correct |
2 | Incorrect | 2 ms | 2668 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2668 KB | Output is correct |
2 | Incorrect | 2 ms | 2668 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |