# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365155 | ronnith | Power Plant (JOI20_power) | C++14 | 27 ms | 492 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 <bits/stdc++.h>
using namespace std;
const int N = 16;
int n, mr[N], sz[N];
vector<int> adj[N];
string s;
void dfs1(int x, int pr) {
sz[x] = (mr[x] == 1 && s[x] == '1');
for(auto e : adj[x]) {
if(e != pr) {
dfs1(e, x);
sz[x] += sz[e];
}
}
}
int res = 0;
void dfs2(int x, int pr) {
int cnt = (sz[0] - sz[x] > 0);
for(auto e : adj[x]) {
if(e != pr) {
cnt += (sz[e] > 0);
dfs2(e, x);
}
}
if(s[x] == '1' && mr[x] && !(cnt > 1)) res ++;
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... |