# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674572 | Nicolas125841 | Burza (COCI16_burza) | C++14 | 809 ms | 27176 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 YES "DA"
#define NO "NE"
vector<vector<int>> layers;
vector<int> ways;
unordered_map<int, bitset<400>> coverage;
bitset<400> dfs(vector<vector<int>> &mp, int n, int p, int d, int k){
if(layers.size() == d){
layers.push_back(vector<int>());
ways.push_back(0);
}
if(d == k){
coverage[n] |= 1;
coverage[n] <<= layers[d].size();
}
layers[d].push_back(n);
for(int v : mp[n]){
if(v != p){
bitset<400> res = dfs(mp, v, n, d+1, k);
if(layers.size() > k && d < k)
coverage[n] |= 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |