#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, int> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=800010, LOG=20;
int n, m, k, u, v, x, y, t, a, b;
int A[MAXN], B[MAXN], C[MAXN], P[MAXN];
ll P2[MAXN], sum[MAXN];
ll dist[MAXN];
bool mark[MAXN];
int mark2[MAXN];
vector<int> G[MAXN];
priority_queue<pll, vector<pll>, greater<pll>> pq;
inline void upd(int v, ll d){ if (dist[v]>d) pq.push({dist[v]=d, v});}
inline bool cmp(int i, int j){ return C[i]<C[j];}
inline bool cmp2(int i, int j){
if (C[i]!=C[j]) return C[i]<C[j];
return P[i]>P[j];
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m;
for (int i=0; i<2*m; i++){
cin>>u>>v>>x>>y;
A[i]=u, B[i]=v, C[i]=x, P[i]=y, G[u].pb(i);
swap(u, v);
i++;
A[i]=u, B[i]=v, C[i]=x, P[i]=y, G[u].pb(i);
}
for (int i=1; i<=n; i++){
sort(all(G[i]), cmp2);
for (int j:G[i]) sum[C[j]]=0;
for (int j:G[i]) sum[C[j]]+=P[j];
for (int j:G[i]) P2[j]+=sum[C[j]];
}
memset(dist, 63, sizeof(dist));
for (int i:G[1]){
upd(i<<1, P2[i]-P[i]);
upd(i<<1 | 1, P[i]);
}
while (pq.size()){
int st=pq.top().second;
pq.pop();
if (mark[st]) continue ;
mark[st]=1;
int id=(st>>1), last=(st&1);
int v=B[id];
if (v==n) kill(dist[st]);
if (!mark2[v]){
mark2[v]=1;
for (int i:G[v]){
upd(i<<1 | 1, dist[st]+P[i]);
if (C[id]!=C[i]) upd(i<<1, dist[st]+P2[i]-P[i]);
else if (last) upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
}
}
else if (last){
auto it=lower_bound(all(G[v]), id, cmp);
while (it!=G[v].end() && C[*it]==C[id]){ // O(1) times
int i=*(it++);
if (P2[i]-P[i]-P[id]>=P[i]) break ;
upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
}
}
}
cout<<"-1\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
25428 KB |
Output is correct |
2 |
Correct |
17 ms |
25388 KB |
Output is correct |
3 |
Correct |
17 ms |
25376 KB |
Output is correct |
4 |
Correct |
17 ms |
25364 KB |
Output is correct |
5 |
Correct |
17 ms |
25420 KB |
Output is correct |
6 |
Correct |
16 ms |
25356 KB |
Output is correct |
7 |
Correct |
17 ms |
25548 KB |
Output is correct |
8 |
Correct |
17 ms |
25492 KB |
Output is correct |
9 |
Correct |
19 ms |
25676 KB |
Output is correct |
10 |
Correct |
19 ms |
25652 KB |
Output is correct |
11 |
Correct |
19 ms |
25676 KB |
Output is correct |
12 |
Correct |
18 ms |
25612 KB |
Output is correct |
13 |
Correct |
18 ms |
25736 KB |
Output is correct |
14 |
Correct |
18 ms |
25652 KB |
Output is correct |
15 |
Correct |
17 ms |
25420 KB |
Output is correct |
16 |
Correct |
19 ms |
25648 KB |
Output is correct |
17 |
Correct |
18 ms |
25676 KB |
Output is correct |
18 |
Correct |
17 ms |
25408 KB |
Output is correct |
19 |
Correct |
18 ms |
25628 KB |
Output is correct |
20 |
Correct |
17 ms |
25516 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
132 ms |
35144 KB |
Output is correct |
2 |
Correct |
69 ms |
29104 KB |
Output is correct |
3 |
Correct |
104 ms |
34544 KB |
Output is correct |
4 |
Correct |
61 ms |
30304 KB |
Output is correct |
5 |
Correct |
784 ms |
49708 KB |
Output is correct |
6 |
Correct |
673 ms |
50120 KB |
Output is correct |
7 |
Correct |
319 ms |
47352 KB |
Output is correct |
8 |
Correct |
370 ms |
40160 KB |
Output is correct |
9 |
Correct |
436 ms |
40172 KB |
Output is correct |
10 |
Correct |
316 ms |
38316 KB |
Output is correct |
11 |
Correct |
96 ms |
32996 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
25428 KB |
Output is correct |
2 |
Correct |
17 ms |
25388 KB |
Output is correct |
3 |
Correct |
17 ms |
25376 KB |
Output is correct |
4 |
Correct |
17 ms |
25364 KB |
Output is correct |
5 |
Correct |
17 ms |
25420 KB |
Output is correct |
6 |
Correct |
16 ms |
25356 KB |
Output is correct |
7 |
Correct |
17 ms |
25548 KB |
Output is correct |
8 |
Correct |
17 ms |
25492 KB |
Output is correct |
9 |
Correct |
19 ms |
25676 KB |
Output is correct |
10 |
Correct |
19 ms |
25652 KB |
Output is correct |
11 |
Correct |
19 ms |
25676 KB |
Output is correct |
12 |
Correct |
18 ms |
25612 KB |
Output is correct |
13 |
Correct |
18 ms |
25736 KB |
Output is correct |
14 |
Correct |
18 ms |
25652 KB |
Output is correct |
15 |
Correct |
17 ms |
25420 KB |
Output is correct |
16 |
Correct |
19 ms |
25648 KB |
Output is correct |
17 |
Correct |
18 ms |
25676 KB |
Output is correct |
18 |
Correct |
17 ms |
25408 KB |
Output is correct |
19 |
Correct |
18 ms |
25628 KB |
Output is correct |
20 |
Correct |
17 ms |
25516 KB |
Output is correct |
21 |
Correct |
132 ms |
35144 KB |
Output is correct |
22 |
Correct |
69 ms |
29104 KB |
Output is correct |
23 |
Correct |
104 ms |
34544 KB |
Output is correct |
24 |
Correct |
61 ms |
30304 KB |
Output is correct |
25 |
Correct |
784 ms |
49708 KB |
Output is correct |
26 |
Correct |
673 ms |
50120 KB |
Output is correct |
27 |
Correct |
319 ms |
47352 KB |
Output is correct |
28 |
Correct |
370 ms |
40160 KB |
Output is correct |
29 |
Correct |
436 ms |
40172 KB |
Output is correct |
30 |
Correct |
316 ms |
38316 KB |
Output is correct |
31 |
Correct |
96 ms |
32996 KB |
Output is correct |
32 |
Correct |
205 ms |
54796 KB |
Output is correct |
33 |
Correct |
171 ms |
44252 KB |
Output is correct |
34 |
Correct |
188 ms |
43024 KB |
Output is correct |
35 |
Correct |
155 ms |
40752 KB |
Output is correct |
36 |
Correct |
280 ms |
46540 KB |
Output is correct |
37 |
Correct |
439 ms |
49832 KB |
Output is correct |
38 |
Correct |
436 ms |
51748 KB |
Output is correct |
39 |
Correct |
398 ms |
50088 KB |
Output is correct |
40 |
Correct |
429 ms |
45528 KB |
Output is correct |
41 |
Correct |
518 ms |
45796 KB |
Output is correct |
42 |
Correct |
601 ms |
51496 KB |
Output is correct |
43 |
Correct |
227 ms |
38588 KB |
Output is correct |
44 |
Correct |
193 ms |
45436 KB |
Output is correct |
45 |
Correct |
348 ms |
40916 KB |
Output is correct |
46 |
Correct |
239 ms |
39336 KB |
Output is correct |
47 |
Correct |
476 ms |
48764 KB |
Output is correct |
48 |
Correct |
845 ms |
54912 KB |
Output is correct |