이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 500005
#define oo 1e18
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
ll m,n,pass[MAX];
vector<pair<ll,pll>> v[MAX];
ll distra(ll x,ll y){
priority_queue<pll> q;
q.push({0,x});
while(!q.empty()){
pll u=q.top();q.pop();
// cout<<u.S<<" "<<-u.F<<"\n";
if(pass[u.S]!=0)continue;
pass[u.S]=1;
if(u.S==y)return -u.F;
map<ll,ll> mp;
for(auto w : v[u.S]){
mp[w.S.F]+=w.S.S;
}
for(auto w : v[u.S]){
// cout<<" "<<w.F<<" "<<min(w.S.S,mp[w.S.F]-w.S.S)<<"\n";
q.push({u.F-min(w.S.S,mp[w.S.F]-w.S.S),w.F});
}
}
return -1;
}
int main(){
fast_in
cin>>n>>m;ll a1,a2,a3,a4;
for(int i=0;i<m;i++){
cin>>a1>>a2>>a3>>a4;
v[a1].push_back({a2,{a3,a4}});
v[a2].push_back({a1,{a3,a4}});
}
cout<<distra(1,n);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |