# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723786 | rshohruh | Bosses (BOI16_bosses) | C++14 | 1486 ms | 940 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;
#define int long long
vector<vector<int>> dp1, dp2;
vector<bool> vis;
pair<int, int> dfs(int u){
vis[u] = true;
pair<int, int> res0 = {1, 0}, res1;
for(int v : dp2[u]){
res1 = dfs(v);
res0.second += res1.second;
res0.first += res1.first;
}
res0.second += res0.first;
return res0;
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n; cin >> n;
dp1.resize(n);
for(int i=0; i<n; ++i){
int k; cin >> k;
for(int j=0; j<k; ++j){
int x; cin >> x;
dp1[x-1].push_back(i);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |