Submission #1206876

#TimeUsernameProblemLanguageResultExecution timeMemory
1206876mychecksedadUnique Cities (JOI19_ho_t5)C++20
4 / 100
2095 ms34884 KiB
/* Author : Mychecksdead */ #include<bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' #define ff first #define ss second #define pii pair<int,int> #define vi vector<int> const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30; int n, m, c[N]; vi g[N]; void solve(){ cin >> n >> m; for(int i = 1; i < n; ++i){ int u, v; cin >> u >> v; g[u].pb(v); g[v].pb(u); } for(int i = 1; i <= n; ++i){ cin >> c[i]; } for(int i = 1; i <= n; ++i){ vi dist(n+1, -1); dist[i] = 0; queue<int> q; q.push(i); vector<vi> D(n+1); while(!q.empty()){ int v = q.front(); q.pop(); D[dist[v]].pb(v); for(int u: g[v]){ if(dist[u] == -1){ dist[u] = dist[v] + 1; q.push(u); } } } set<int> res; for(int i = 1; i < n; ++i){ if(D[i].size()==1){ res.insert(c[D[i][0]]); } } cout << res.size() << '\n'; } } int main(){ cin.tie(0); ios::sync_with_stdio(0); int tt = 1, aa; // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); while(tt--){ solve(); en; } cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...