Submission #680435

#TimeUsernameProblemLanguageResultExecution timeMemory
680435qwerasdfzxclWells (CEOI21_wells)C++17
0 / 100
65 ms72556 KiB
#include <bits/stdc++.h> typedef long long ll; using namespace std; int dist[10010][10010], vcnt, n, k; vector<int> adj[1501500], G[1501500], st; vector<vector<int>> path; void dfs(int s, int pa = -1){ st.push_back(s); if ((int)st.size()==k) path.push_back(st); dist[st[0]][s] = (int)st.size() - 1; for (auto &v:adj[s]) if (v!=pa){ dfs(v, s); } st.pop_back(); } int col[1501500]; bool simulate(int s){ vector<int> q = {s}; fill(col+1, col+n+1, 0); col[s] = 1; while(!q.empty()){ int v = q.back(); q.pop_back(); for (int i=1;i<=n;i++) if (dist[v][i]==k && !col[i]){ col[i] = 1; q.push_back(i); } } for (auto &p:path){ int cnt = 0; for (auto &x:p) if (col[x]) cnt++; if (cnt!=1) return 0; } return 1; } int main(){ scanf("%d %d", &n, &k); for (int i=1;i<=n-1;i++){ int x, y; scanf("%d %d", &x, &y); adj[x].push_back(y); adj[y].push_back(x); } for (int i=1;i<=n;i++){ dfs(i); } for (int i=1;i<=n;i++) if (simulate(i)){ printf("YES\n0\n"); return 0; } printf("NO\n0\n"); return 0; }

Compilation message (stderr)

wells.cpp: In function 'int main()':
wells.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
wells.cpp:47:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...