Submission #896516

#	Time	Username	Problem	Language	Result	Execution time	Memory
896516		Abito	Vinjete (COI22_vinjete)	C++17	27 / 100	3068 ms	498668 KiB

Main

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
typedef unsigned long long ull;
using namespace std;
struct edge{
    int x,l,r;
};
const int N=1e5+5;
int n,m,ans[N];
vector<edge> adj[N];
bitset<N> bs[N];
void dfs(int node,int p){
    bs[node].count();
    for (auto u:adj[node]){
        if (p==u.x) continue;
        bs[u.x]=bs[node];
        for (int i=u.l;i<=u.r;i++) bs[u.x][i]=1;
        dfs(u.x,node);
    }return;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>m;
    for (int i=1;i<n;i++){
        int x,y,l,r;
        cin>>x>>y>>l>>r;
        adj[x].pb({y,l,r});
        adj[y].pb({x,l,r});
    }dfs(1,0);
    for (int i=2;i<=n;i++) cout<<bs[i].count()<<endl;
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 13
• Subtask 3: 16 / 16
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31