Submission #780542

#	Time	Username	Problem	Language	Result	Execution time	Memory
780542		vjudge1	Dostavljač (COCI18_dostavljac)	C++17	0 / 140	1 ms	2644 KiB

dostavljac

//subtask node sıralı ise &&tree
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
#define OYY 10000000005
#define mod 998244353
vector <int> v[100005];
int dizi[100005];
int cev=0,co=0,n,m;

void dfs(int node,int ata){
    co+=2;
    if(co>m)return ;
    cev+=dizi[node];
    for(int i=0;i<v[node].size();i++){
        int go=v[node][i];
        if(go==ata)continue;
        dfs(go,node);
    }
}

int32_t main(){
    faster
    cin>>n>>m;
    if(m&1)m++;
    for(int i=1;i<=n;i++)cin>>dizi[i];
    for(int i=1;i<n;i++){
        int a,b;cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs(1,-1);
    cout<<cev<<'\n';
    return 0;
}

Compilation message (stderr)

dostavljac.cpp: In function 'void dfs(long long int, long long int)':
dostavljac.cpp:16:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i=0;i<v[node].size();i++){
      |                 ~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14