Submission #938796

#	Time	Username	Problem	Language	Result	Execution time	Memory
938796		vjudge1	Toll (BOI17_toll)	C++17	7 / 100	3064 ms	5020 KiB

toll

#include <bits/stdc++.h>

#define int long long
#define ff first
#define ss second
using namespace std;
const int inf = 1e9;
void dfs(vector<int>& dp, vector<vector<pair<int,int>>>& graph, int cur)
{
    for (auto a : graph[cur])
    {
        dp[a.ff] = min(dp[a.ff],dp[cur]+a.ss);
        dfs(dp,graph,a.ff);
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int k,n,m,o;
    cin >> k >> n >> m >> o;
    if (k==1)
    {
        vector<int> edges(n-1,inf);
        for (int i = 0; i < m; i++)
        {
            int a,b,c;
            cin >> a >> b >> c;
            
            edges[a] = c;
            
        }
        vector<int> pref_sum(n-1,0);
        pref_sum[0] = edges[0];
        for (int i = 1; i < n-1; i++)
            pref_sum[i] = pref_sum[i-1]+edges[i];
            
        auto sum = [&](int l,int r)
        {
          return pref_sum[r] - (l > 0 ? pref_sum[l-1] : 0LL);  
        };
        
        for (int i = 0; i < o; i++)
        {
            int a,b;
            cin >> a >> b;
            if (sum(a,b-1) >= inf)
                cout << -1 << '\n';
            else
                cout << sum(a,b-1) << '\n';
        }
    }
    else 
    {
        //turk milleti meslin baban!!!!
        vector<vector<pair<int,int>>> graph(n);
        for (int i = 0; i < m; i++)
        {
            int a,b,t;
            cin >> a >> b >> t;
            graph[a].push_back({b,t});

        }
        vector<int> dp(n,inf);
        dp[0] = 0;
        dfs(dp,graph,0);
        
        for (int i = 0; i < o; i++)
        {
            int a,b;
            cin >> a >> b;
            if (dp[b] >= inf)
                cout << "-1\n";
            else
                cout << dp[b] << '\n';
        }
    }
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 31
• Subtask 5: 0 / 44