Submission #372321

# Submission time Handle Problem Language Result Execution time Memory
372321 2021-02-27T16:03:16 Z errorgorn Robot (JOI21_ho_t4) C++17
100 / 100
1618 ms 121108 KB
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii tuple<ll,ll,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

struct edge{
	ll v,c,p;
};

int n,m;
vector<edge> al[200005];
map<int,vector<edge> > al_c[200005];

map<int,ll> mc[200005];

map<int,ll> w[200005];
priority_queue<iii,vector<iii>,greater<iii> > pq;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	
	int a,b,c,d;
	rep(x,0,m){
		cin>>a>>b>>c>>d;
		
		al[a].pub({b,c,d});
		al[b].pub({a,c,d});
		
		al_c[a][c].pub({b,c,d});
		al_c[b][c].pub({a,c,d});
		
		mc[a][c]+=d;
		mc[b][c]+=d;
		
		w[a][c]=1e18;
		w[b][c]=1e18;
	}
	
	rep(x,1,n+1) w[x][-1]=1e18;
	
	w[1][-1]=0;
	pq.push({w[1][-1],1,-1});
	
	ll node,weight,col;
	while (!pq.empty()){
		tie(weight,node,col)=pq.top(),pq.pop();
		
		if (w[node][col]!=weight) continue;
		
		//cout<<weight<<" "<<node<<" "<<col<<endl;
				
		if (al_c[node].count(col)) for (auto &it:al_c[node][col]){
			ll nw=weight+mc[node][it.c]-it.p;
			if (w[it.v][-1]>nw){
				w[it.v][-1]=nw;
				pq.push({nw,it.v,-1});
			}
		}
		
		if (col==-1) for (auto &it:al[node]){
			ll nw=weight;
			
			if (w[it.v][it.c]>nw){
				w[it.v][it.c]=nw;
				pq.push({nw,it.v,it.c});
			}
			
			nw=weight+min(mc[node][it.c]-it.p,it.p);
			if (w[it.v][-1]>nw){
				w[it.v][-1]=nw;
				pq.push({nw,it.v,-1});
			}
		}
	}
	
	if (w[n][-1]==1e18) cout<<"-1"<<endl;
	else cout<<w[n][-1]<<endl;
}
# Verdict Execution time Memory Grader output
1 Correct 20 ms 33260 KB Output is correct
2 Correct 21 ms 33276 KB Output is correct
3 Correct 22 ms 33260 KB Output is correct
4 Correct 20 ms 33260 KB Output is correct
5 Correct 21 ms 33260 KB Output is correct
6 Correct 22 ms 33260 KB Output is correct
7 Correct 25 ms 33516 KB Output is correct
8 Correct 21 ms 33388 KB Output is correct
9 Correct 30 ms 34056 KB Output is correct
10 Correct 25 ms 34028 KB Output is correct
11 Correct 24 ms 33772 KB Output is correct
12 Correct 24 ms 33920 KB Output is correct
13 Correct 26 ms 33900 KB Output is correct
14 Correct 25 ms 33900 KB Output is correct
15 Correct 22 ms 33644 KB Output is correct
16 Correct 24 ms 33772 KB Output is correct
17 Correct 24 ms 33772 KB Output is correct
18 Correct 24 ms 33516 KB Output is correct
19 Correct 28 ms 33792 KB Output is correct
20 Correct 26 ms 33644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 346 ms 61028 KB Output is correct
2 Correct 167 ms 46812 KB Output is correct
3 Correct 387 ms 62716 KB Output is correct
4 Correct 228 ms 51900 KB Output is correct
5 Correct 1576 ms 121052 KB Output is correct
6 Correct 1382 ms 110504 KB Output is correct
7 Correct 576 ms 91244 KB Output is correct
8 Correct 747 ms 88428 KB Output is correct
9 Correct 775 ms 88428 KB Output is correct
10 Correct 555 ms 79844 KB Output is correct
11 Correct 278 ms 67052 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 20 ms 33260 KB Output is correct
2 Correct 21 ms 33276 KB Output is correct
3 Correct 22 ms 33260 KB Output is correct
4 Correct 20 ms 33260 KB Output is correct
5 Correct 21 ms 33260 KB Output is correct
6 Correct 22 ms 33260 KB Output is correct
7 Correct 25 ms 33516 KB Output is correct
8 Correct 21 ms 33388 KB Output is correct
9 Correct 30 ms 34056 KB Output is correct
10 Correct 25 ms 34028 KB Output is correct
11 Correct 24 ms 33772 KB Output is correct
12 Correct 24 ms 33920 KB Output is correct
13 Correct 26 ms 33900 KB Output is correct
14 Correct 25 ms 33900 KB Output is correct
15 Correct 22 ms 33644 KB Output is correct
16 Correct 24 ms 33772 KB Output is correct
17 Correct 24 ms 33772 KB Output is correct
18 Correct 24 ms 33516 KB Output is correct
19 Correct 28 ms 33792 KB Output is correct
20 Correct 26 ms 33644 KB Output is correct
21 Correct 346 ms 61028 KB Output is correct
22 Correct 167 ms 46812 KB Output is correct
23 Correct 387 ms 62716 KB Output is correct
24 Correct 228 ms 51900 KB Output is correct
25 Correct 1576 ms 121052 KB Output is correct
26 Correct 1382 ms 110504 KB Output is correct
27 Correct 576 ms 91244 KB Output is correct
28 Correct 747 ms 88428 KB Output is correct
29 Correct 775 ms 88428 KB Output is correct
30 Correct 555 ms 79844 KB Output is correct
31 Correct 278 ms 67052 KB Output is correct
32 Correct 230 ms 58856 KB Output is correct
33 Correct 322 ms 58212 KB Output is correct
34 Correct 679 ms 80992 KB Output is correct
35 Correct 513 ms 71556 KB Output is correct
36 Correct 512 ms 78540 KB Output is correct
37 Correct 628 ms 86720 KB Output is correct
38 Correct 629 ms 97308 KB Output is correct
39 Correct 281 ms 65640 KB Output is correct
40 Correct 779 ms 88428 KB Output is correct
41 Correct 824 ms 88428 KB Output is correct
42 Correct 818 ms 98924 KB Output is correct
43 Correct 376 ms 64876 KB Output is correct
44 Correct 817 ms 78696 KB Output is correct
45 Correct 570 ms 81132 KB Output is correct
46 Correct 509 ms 80492 KB Output is correct
47 Correct 536 ms 82816 KB Output is correct
48 Correct 1618 ms 121108 KB Output is correct