oj.uz

답안 #147300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147300 2019-08-28T18:49:16 Z JovanK26 Journey (NOI18_journey) C++14
20 / 100
 2 ms 632 KB 
#include <bits/stdc++.h>

using namespace std;
long long n,m,h;
long long f[10001][401];
vector <pair<long long,long long> >v[10001];
void solve()
{
    for(long long start=0;start<n-1;start++)
    {
      for(long long i=0;i<v[start].size();i++)
      {
        if(v[start][i].first>start)
        {
            long long sum=0;
            for(long long 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;
    long long j,k;
    for(long long i=0;i<n-1;i++)
    {
        for(long long 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(long long 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:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(long long i=0;i<v[start].size();i++)
                         ~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Incorrect 2 ms 632 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Incorrect 2 ms 632 KB Output isn't correct
4 Halted 0 ms 0 KB -