# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536357 | Monarchuwu | Power Plant (JOI20_power) | C++17 | 177 ms | 34808 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int N = 2e5 + 8;
int n, a[N];
char s[N];
vector<int> g[N];
void upd(int &a, int b) { if (a < b) a = b; }
int dp[N], cnt[N][3], tmp[4];
int ans;
void dfs(int u, int p) {
for (int v : g[u]) if (v != p) {
dfs(v, u);
if (u == 2) {
int bug = 1;
}
fill(tmp, tmp + 4, 0);
for (int i = 0; i < 3; ++i)
upd(tmp[i + 1], cnt[u][i] + dp[v]);
upd(cnt[u][1], tmp[1]);
upd(cnt[u][2], tmp[2]);
upd(cnt[u][2], tmp[3]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |