# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175897 | InvMOD | Burza (COCI16_burza) | C++20 | 92 ms | 1864 KiB |
#include<bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
void solve()
{
int n,k; cin >> n >> k;
vector<vector<int>> adj(n + 1, vector<int>());
for(int i = 0; i < n - 1; i++){
int u,v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
if(k * k >= n){
// each h should has >= k element to counter Daniel
cout << "DA\n";
return;
}
int cntLose = 0;
vector<int> tin(n + 1), tout(n + 1), h(n + 1);
vector<vector<int>> cover(n + 1, vector<int>());
function<void(int,int)> dfs = [&](int x, int p) -> void{
if(h[x] >= k - 1){
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... |