Submission #951299

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
951299	2024-03-21T15:10:24 Z	NourWael	Firefighting (NOI20_firefighting)	C++17	17 / 100	533 ms	25428 KB

Firefighting

#include <bits/stdc++.h>
#define int long long
using namespace std; 
int const mxN = 3e5+5;
int n,k; 
vector<pair<int,int>> adj [mxN];
vector<int> put;
bool vis[mxN];

void dfs ( int i, int p, int d) {
   if(d>k) return;
   vis[i] = 1;
   for(auto it:adj[i]) {
      if(it.first==p) continue;
      dfs(it.first, i, d+it.second);
   }
}

vector<int> ans;

void check() {
   memset(vis,0,sizeof vis);
   for(auto it:put) dfs(it,0,0);
   for(int i=1; i<=n; i++) if(!vis[i]) return;
   if(ans.size()>put.size() || ans.empty()) ans = put;
}

void solve ( int i ) {
   if(i==n+1) { check(); return; }
   solve(i+1);
   put.push_back(i);
   solve(i+1);
   put.pop_back();
}

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 a,b,c; cin>>a>>b>>c;
      adj[a].push_back({b,c}), adj[b].push_back({a,c});
   }

   if(n<=17) {
      solve(1);
      cout<<ans.size()<<'\n';
      for(auto it:ans) cout<<it<<' ';
   }
   else {
      cout<<n<<'\n';
      for(int i=1; i<=n; i++) cout<<i<<' ';
   }
 
   return 0;
}

Subtask #1
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	172 ms	25264 KB	Output is correct
2	Correct	148 ms	25428 KB	Output is correct
3	Correct	45 ms	14016 KB	Output is correct
4	Correct	167 ms	24912 KB	Output is correct
5	Correct	2 ms	7772 KB	Output is correct
6	Correct	2 ms	7772 KB	Output is correct

Subtask #2
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	523 ms	7772 KB	Output is correct
2	Correct	3 ms	7768 KB	Output is correct
3	Correct	2 ms	7772 KB	Output is correct
4	Correct	2 ms	7616 KB	Output is correct
5	Correct	225 ms	7816 KB	Output is correct
6	Correct	223 ms	7768 KB	Output is correct
7	Correct	425 ms	7772 KB	Output is correct
8	Correct	533 ms	7776 KB	Output is correct
9	Correct	472 ms	7776 KB	Output is correct
10	Correct	496 ms	7772 KB	Output is correct
11	Correct	443 ms	7772 KB	Output is correct
12	Correct	492 ms	7772 KB	Output is correct
13	Correct	418 ms	7776 KB	Output is correct
14	Correct	29 ms	7768 KB	Output is correct
15	Correct	2 ms	8024 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	417 ms	7772 KB	Output is correct
2	Correct	456 ms	8020 KB	Output is correct
3	Correct	434 ms	7772 KB	Output is correct
4	Correct	209 ms	7772 KB	Output is correct
5	Correct	2 ms	7768 KB	Output is correct
6	Correct	2 ms	7768 KB	Output is correct
7	Correct	2 ms	7772 KB	Output is correct
8	Correct	2 ms	7772 KB	Output is correct
9	Correct	499 ms	7772 KB	Output is correct
10	Correct	439 ms	7768 KB	Output is correct
11	Correct	2 ms	7772 KB	Output is correct
12	Correct	415 ms	7772 KB	Output is correct
13	Correct	229 ms	7768 KB	Output is correct
14	Correct	235 ms	8020 KB	Output is correct
15	Correct	459 ms	7776 KB	Output is correct
16	Correct	251 ms	7768 KB	Output is correct
17	Correct	435 ms	7772 KB	Output is correct
18	Correct	232 ms	7772 KB	Output is correct
19	Correct	443 ms	7772 KB	Output is correct
20	Correct	495 ms	7788 KB	Output is correct
21	Correct	515 ms	7772 KB	Output is correct
22	Correct	494 ms	7768 KB	Output is correct
23	Correct	491 ms	7772 KB	Output is correct
24	Correct	417 ms	7776 KB	Output is correct
25	Correct	415 ms	7772 KB	Output is correct
26	Correct	428 ms	7768 KB	Output is correct