oj.uz

Submission #956067

# Submission time Handle Problem Language Result Execution time Memory
956067 2024-04-01T00:49:08 Z NourWael Firefighting (NOI20_firefighting) C++17
43 / 100
 3000 ms 103956 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std; 
int const mxN = 3e5+5;
int dis[mxN], lift[mxN][20], elem[mxN], n, k;
vector<pair<int,int>> adj[mxN];
bool vis[mxN];
vector<pair<int,pair<int,int>>> v;

int up ( int steps , int e) {
  for(int i=0; i<=19; i++) 
     if(steps&(1<<i)) e = lift[e][i];
  return e;
}

int bring ( int i ) {
  int l = 0, r = n+1, ans = i;
  while(l<=r) {
    int mid = (l+r)/2, e = up(mid, i);
    if(dis[i]-dis[e]<=k) { ans = e, l = mid+1; }
    else r = mid-1;
  }
  return ans;
}

void dfs ( int i , int p, int m) { 
  dis[i] = m;
  lift[i][0] = p;
  for(int j=1; j<20; j++) lift[i][j] = lift[lift[i][j-1]][j-1];
  elem[i] = bring(i);
  v.push_back({-dis[elem[i]], {elem[i], i}});
  for(auto it:adj[i]) {
    if(it.first==p) continue;
    dfs(it.first,i, m+it.second);
  }
}

void do_work ( int i , int p, int d) {
  vis[i] = 1;
  for(auto it:adj[i]) {
    if(it.first==p) continue;
    if(d+it.second>k) continue;
    do_work(it.first, i, d+it.second);
  }
}
signed main() {
  
   ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
   cin>>n>>k;
   for(int i = 0; i<n-1; i++) {
    int x,y,c; cin>>x>>y>>c;
    adj[x].push_back({y,c}), adj[y].push_back({x,c});
   }   
   dfs(1,1,0);
   
   vector<int> fin;
   sort(v.begin(),v.end());
   for(auto it:v) {
     if(!vis[it.second.second]) {
      vis[it.second.second] = 1;
      do_work(it.second.first, 0, 0);
      fin.push_back(it.second.first);
     }
   }

   cout<<fin.size()<<'\n';
   for(auto it:fin) cout<<it<<' ';

   return 0;
  
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 98628 KB Output is correct
2 Correct 471 ms 100332 KB Output is correct
3 Correct 155 ms 44888 KB Output is correct
4 Correct 473 ms 99644 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 2 ms 12632 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12728 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12736 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12716 KB Output is correct
10 Correct 3 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12736 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 3 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 3 ms 12636 KB Output is correct
15 Correct 3 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12768 KB Output is correct
18 Correct 2 ms 12768 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 4 ms 12764 KB Output is correct
22 Correct 3 ms 12772 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 3 ms 12636 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 100032 KB Output is correct
2 Correct 255 ms 59060 KB Output is correct
3 Correct 273 ms 61436 KB Output is correct
4 Correct 209 ms 55016 KB Output is correct
5 Correct 3 ms 12788 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Execution timed out 3084 ms 93960 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12892 KB Output is correct
2 Correct 5 ms 12888 KB Output is correct
3 Correct 4 ms 12948 KB Output is correct
4 Correct 4 ms 13088 KB Output is correct
5 Correct 36 ms 13256 KB Output is correct
6 Correct 34 ms 13148 KB Output is correct
7 Correct 24 ms 13288 KB Output is correct
8 Correct 23 ms 13148 KB Output is correct
9 Correct 18 ms 13208 KB Output is correct
10 Correct 17 ms 13224 KB Output is correct
11 Correct 38 ms 13148 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 25 ms 13148 KB Output is correct
14 Correct 18 ms 13144 KB Output is correct
15 Correct 5 ms 13148 KB Output is correct
16 Correct 4 ms 12892 KB Output is correct
17 Correct 3 ms 12776 KB Output is correct
18 Correct 5 ms 13148 KB Output is correct
19 Correct 4 ms 13144 KB Output is correct
20 Correct 4 ms 12888 KB Output is correct
21 Correct 5 ms 13148 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 93600 KB Output is correct
2 Correct 448 ms 90852 KB Output is correct
3 Correct 492 ms 95056 KB Output is correct
4 Correct 198 ms 52188 KB Output is correct
5 Execution timed out 3070 ms 103956 KB Time limit exceeded
6 Halted 0 ms 0 KB -