Submission #1190311

#TimeUsernameProblemLanguageResultExecution timeMemory
1190311vitoVinjete (COI22_vinjete)C++20
11 / 100
256 ms589824 KiB
#include <bits/stdc++.h> using namespace std; using ll=long long; #define F first #define S second #define sz(x) int(x.size()) const int MAX=1e5+5; vector<pair<int, pair<int, int>>> gr[MAX]; int n, m; vector<vector<int>> a; void dfs(int v, int p) { for(auto &u : gr[v]) { if(u.F!=p) { a[u.F]=a[v]; for(int i=u.S.F; i<=u.S.S; i++) { a[u.F][i]=1; } dfs(u.F, v); } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; a=vector<vector<int>>(n+1, vector<int>(m+1)); for(int i=0; i<n-1; i++) { int x, y, l, r; cin >> x >> y >> l >> r; gr[x].push_back(make_pair(y, make_pair(l, r))); gr[y].push_back(make_pair(x, make_pair(l, r))); } dfs(1, 1); for(int i=2; i<=n; i++) { cout << count(a[i].begin(), a[i].end(), 1) << '\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...
#Verdict Execution timeMemoryGrader output
Fetching results...