# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101866 | simona1230 | Toll (BOI17_toll) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Online C++ compiler to run C++ program online
#include <bits/stdc++.h>
using namespace std;
int k,n,m,o;
vector<pair<int,int> > v[200001],op[200001];
void read()
{
cin>>k>>n>>m>>o;
for(int i=1;i<=m;i++)
{
int a,b,t;
cin>>a>>b>>t;
v[a].push_back({b,t});
op[b].push_back({a,t});
}
}
pair<int,int> q[200001];
long long p[200001];
void subt1()
{
for(int i=0;i<n;i++)
{
p[i+1]=1e9;
for(int j=0;j<v[i].size();j++)
{
int nb=v[i][j].second;
p[i+1]=min(p[i+1],nb);
}
p[i+1]+=p[i];
}
for(int i=1;i<=o;i++)
if(p[q[i].second]-p[q[i].first]<1e9)cout<<p[q[i].second]-p[q[i].first]<<endl;
else cout<<-1<<endl;
exit(0);
}
int dp[200001];
void subt2()
{
for(int i=1;i<n;i++)
{
dp[i]=1e9;
for(int j=0;j<op[i].size();j++)
{
pair<int,int> nb=op[i][j];
dp[i]=min(dp[i],dp[nb.first]+nb.second);
}
}
for(int i=1;i<=o;i++)
cout<<dp[q[i].second]<<endl;
}
int lf=0;
void solve()
{
for(int i=1;i<=o;i++)
{
cin>>q[i].first>>q[i].second;
lf=min(lf,q[i].first);
}
if(k==1)subt1();
if(lf==1)subt2();
}
int main() {
read();
solve();
return 0;
}