# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1116869 | vjudge1 | Mergers (JOI19_mergers) | C++17 | 414 ms | 262144 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>
#define int long long int
using namespace std;
const int maxn = 1e5 + 100;
int n ,k, a[maxn], num[maxn], sz[maxn], cnt[maxn] ,ans;
bool mark[maxn];
vector<int> adj[maxn];
vector<int> states[maxn];
void dfs1(int v, int mpar = 0){
sz[v] = 1;
states[v][a[v]] = true;
for(auto u : adj[v]){
if(u != mpar){
dfs1(u, v);
sz[v] += sz[u];
cnt[v] += cnt[u];
for(int i = 1; i <= k; i++){
states[v][i] |= states[u][i];
}
}
}
int tedad = 0;
for(int i = 1; i <= k ;i ++){
if(states[v][i]){
tedad += num[i];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |