# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674557 | 2022-12-25T06:46:13 Z | Nicolas125841 | Burza (COCI16_burza) | C++14 | 1 ms | 596 KB |
#include <bits/stdc++.h> using namespace std; #define YES "DA" #define NO "NE" vector<vector<int>> layers; unordered_map<int, bitset<50>> coverage; bitset<50> dfs(vector<vector<int>> &mp, int n, int p, int d, int k){ if(layers.size() == d) layers.push_back(vector<int>()); 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<50> res = dfs(mp, v, n, d+1, k); if(layers.size() > k && d < k) coverage[n] |= res; } } return coverage[n]; } int main(){ cin.tie(NULL)->sync_with_stdio(false); int n, k; cin >> n >> k; vector<vector<int>> mp(n, vector<int>()); for(int i = 0; i < n-1; i++){ int u, v; cin >> u >> v; mp[--u].push_back(--v); mp[v].push_back(u); } dfs(mp, 0, -1, 0, k); if(layers.size() <= k) cout << YES << "\n"; else{ assert(layers[k].size() <= 50); unordered_set<bitset<50>> cur, prev = {bitset<50>()}; bool g = false; for(int i = 1; i <= k; i++){ for(int v : layers[i]){ for(bitset<50> bs : prev){ if((coverage[v] & bs) == 0){ cur.insert(coverage[v] | bs); if((coverage[v] | bs).count() == layers[k].size()) g = true; } } } swap(cur, prev); cur.clear(); } cout << (g ? YES : NO) << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 596 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 596 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 596 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 596 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |