Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream in("modernizare.in");
- ofstream out("modernizare.out");
- int n,m,f,v[1001][1001],v2[100001],s[100001],p;
- deque < int > c;
- int main()
- {
- in>>n>>m>>f;
- for(int i=1;i<=m;i++)
- { int a,b,x;
- in>>a>>b>>x;
- v[a][b]=x;
- v[b][a]=x;
- }
- v2[1]=1;
- c.push_back(1);
- while( !c.empty() )
- {int k=1;
- for(int i=1;i<=n;i++)
- if(v[c.front()][i]!=0)
- if(v2[i]==0)
- {
- c.push_back(i);
- v2[i]=1;
- }
- for(int i=1;i<c.size();i++)
- s[i]=v[i][c.front()];
- sort(s+1,s+c.size());
- for(int i=0;i<c.size();i++)
- if(c[i]!=c.front()) if(v[c[i]][c.front()]!=0) if(v[c[i]][c.front()]<=f) {f=f-v[c[i]][c.front()]; p++; }
- else {k=0; break;}
- if(k==0) break;
- if(f==0) break;
- c.pop_front();
- }
- out<<p;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement