#include <bits/stdc++.h>
using namespace std;
int n,m,h;
long long f[10001][401];
vector <pair<int,int> >v[10001];
void solve()
{
for(int start=0;start<n-1;start++)
{
for(int i=0;i<v[start].size();i++)
{
if(v[start][i].first>start)
{
long long sum=0;
for(int j=0;j<m-v[start][i].second;j++)
{
sum=min(sum+f[start][j],(long long)500000001);
f[v[start][i].first][j+v[start][i].second]=min(f[v[start][i].first][j+v[start][i].second]+sum,(long long)500000001);
}
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> h;
int j,k;
for(int i=0;i<n-1;i++)
{
for(int t=0;t<h;t++)
{
cin >> j >> k;
v[i].push_back(make_pair(j,k));
v[j].push_back(make_pair(i,k));
}
}
f[0][0]=1;
solve();
for(int i=0;i<m;i++)
{
cout << min((long long)500000001,f[n-1][i])<<' ';
}
return 0;
}
Compilation message
journey.cpp: In function 'void solve()':
journey.cpp:11:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v[start].size();i++)
~^~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
632 KB |
Output is correct |
2 |
Correct |
2 ms |
632 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
632 KB |
Output is correct |
2 |
Correct |
2 ms |
632 KB |
Output is correct |
3 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
632 KB |
Output is correct |
2 |
Correct |
2 ms |
632 KB |
Output is correct |
3 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |