# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647251 | atom | Fireworks (APIO16_fireworks) | C++17 | 223 ms | 63796 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;
using ll = long long;
const int N=300010, M = 1e9 + 7;
ll n,m,a,b,plague[N],root[N],ans;
vector<int> edges[N];
priority_queue<ll> q[N];
void dfs(int u){
root[u]=u;
if(u>n){
q[u].push(plague[u]);
q[u].push(plague[u]);
return;
}
for(auto v:edges[u]){
dfs(v);
if(q[root[v]].size() > q[root[u]].size()) root[u]=root[v];
}
# | 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... |