oj.uz

Submission #768793

# Submission time Handle Problem Language Result Execution time Memory
768793 2023-06-28T15:44:27 Z 1075508020060209tc Janjetina (COCI21_janjetina) C++14
15 / 110
 11 ms 5988 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int K;
int uf[200005];
int usz[200005];
pair<int,pair<int,int>>e[200005];
int fin(int x){
if(uf[x]==x){return x;}
uf[x]=fin(uf[x]);
return uf[x];
}
void mrg(int a,int b){
int pa=fin(a);int pb=fin(b);
uf[pa]=pb;
usz[pb]+=usz[pa];
}
int ans;
vector<pair<int,int>>ee[200005];
int dph[200005];
void dfs(int nw,int pa,int mxv){
    if(pa&&mxv-dph[nw]>=K){
        ans++;
    }
    for(int i=0;i<ee[nw].size();i++){
        int v=ee[nw][i].first;
        if(v==pa){continue;}
        int w=ee[nw][i].second;
        dph[v]=dph[nw]+1;
        dfs(v,nw,max(mxv,w) );
    }
}
void solve(){
ans=0;
for(int i=1;i<=n;i++){
    dph[i]=0;
    dfs(i,0,0);
}
cout<<ans<<endl;
exit(0);
}

signed main(){
cin>>n>>K;
for(int i=1;i<=n-1;i++){
    cin>>e[i].second.first>>e[i].second.second>>e[i].first;
    int a=e[i].second.first;int b=e[i].second.second;int c=e[i].first;
    ee[a].push_back({b,c});
    ee[b].push_back({a,c});
}

if(n<=1000){
    solve();
}

sort(e+1,e+n-1+1);
for(int i=1;i<=n;i++){
    uf[i]=i;
    usz[i]=1;
}
ans=0;
for(int i=1;i<=n-1;i++){
    int W=e[i].first;
    //L<=W-K
    int a=e[i].second.first;int b=e[i].second.second;
    a=fin(a);b=fin(b);
    if(usz[a]>usz[b]){
        swap(a,b);
    }
    for(int j=1;j<=usz[a];j++){
        ans+=min((W-K)-j+1ll,usz[b]);
    }
    mrg(a,b);
  //  cout<<W<<" "<<ans<<endl;
}
cout<<ans*2<<endl;

}

Compilation message

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

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4948 KB Output is correct
2 Correct 2 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 10 ms 5144 KB Output is correct
5 Correct 10 ms 5216 KB Output is correct
6 Correct 10 ms 5152 KB Output is correct
7 Correct 10 ms 5064 KB Output is correct
8 Correct 10 ms 5148 KB Output is correct
9 Correct 9 ms 5076 KB Output is correct
10 Correct 10 ms 5076 KB Output is correct
11 Correct 10 ms 5012 KB Output is correct
12 Correct 10 ms 5104 KB Output is correct
13 Correct 11 ms 5076 KB Output is correct
14 Correct 11 ms 5076 KB Output is correct
15 Correct 10 ms 5076 KB Output is correct
16 Correct 11 ms 5020 KB Output is correct
17 Correct 10 ms 5100 KB Output is correct
18 Correct 10 ms 5012 KB Output is correct
19 Correct 11 ms 5076 KB Output is correct
20 Correct 10 ms 5096 KB Output is correct
21 Correct 11 ms 5020 KB Output is correct
22 Correct 10 ms 5104 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 10 ms 5076 KB Output is correct
5 Incorrect 10 ms 5988 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4948 KB Output is correct
2 Correct 2 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 10 ms 5144 KB Output is correct
5 Correct 10 ms 5216 KB Output is correct
6 Correct 10 ms 5152 KB Output is correct
7 Correct 10 ms 5064 KB Output is correct
8 Correct 10 ms 5148 KB Output is correct
9 Correct 9 ms 5076 KB Output is correct
10 Correct 10 ms 5076 KB Output is correct
11 Correct 10 ms 5012 KB Output is correct
12 Correct 10 ms 5104 KB Output is correct
13 Correct 11 ms 5076 KB Output is correct
14 Correct 11 ms 5076 KB Output is correct
15 Correct 10 ms 5076 KB Output is correct
16 Correct 11 ms 5020 KB Output is correct
17 Correct 10 ms 5100 KB Output is correct
18 Correct 10 ms 5012 KB Output is correct
19 Correct 11 ms 5076 KB Output is correct
20 Correct 10 ms 5096 KB Output is correct
21 Correct 11 ms 5020 KB Output is correct
22 Correct 10 ms 5104 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5008 KB Output is correct
26 Correct 10 ms 5076 KB Output is correct
27 Incorrect 10 ms 5988 KB Output isn't correct
28 Halted 0 ms 0 KB -