Submission #391434

#TimeUsernameProblemLanguageResultExecution timeMemory
391434qwerasdfzxclMergers (JOI19_mergers)C++14
48 / 100
3068 ms36896 KiB
#include <bits/stdc++.h> typedef long long ll; using namespace std; vector<int> adj[500500]; int col[500500], cnt[500500], val=0, val2=0; bool visited[500500], visited2[500500], chk[500500]; unordered_map<int, int> dfs1(int s){ unordered_map<int, int> ret; ret[col[s]] = 1; visited[s]=1; for (auto &v:adj[s]) if (!visited[v]){ auto tmp = dfs1(v); for (auto &p:tmp){ ret[p.first] += p.second; } } chk[s] = 1; for (auto &p:ret){ if (p.second!=cnt[p.first]){ chk[s] = 0; break; } } return ret; } int dfs2(int s, bool test){ int ret=0; if (chk[s]) ret++; if (chk[s] && s!=1 && !test) test=1, val2++; visited2[s] = 1; for (auto &v:adj[s]) if (!visited2[v]){ ret += dfs2(v, test); } if (chk[s] && ret==1 && s!=1) val++; return ret; } int main(){ int n, k; scanf("%d %d", &n, &k); for (int i=0;i<n-1;i++){ int a, b; scanf("%d %d", &a, &b); adj[a].push_back(b); adj[b].push_back(a); } for (int i=1;i<=n;i++){ scanf("%d", col+i); cnt[col[i]]++; } dfs1(1); dfs2(1, 0); /*for (int i=1;i<=n;i++) printf("%d ", col[i]); printf("\n"); for (int i=1;i<=n;i++) printf("%d ", cnt[i]); printf("\n"); for (int i=1;i<=n;i++) printf("%d ", chk[i]); printf("\n");*/ if (val2==1) val++; //printf("%d\n", val2); printf("%d\n", (val+1)/2); return 0; }

Compilation message (stderr)

mergers.cpp: In function 'int main()':
mergers.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |         scanf("%d %d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   50 |         scanf("%d", col+i);
      |         ~~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...