Submission #1082410

# Submission time Handle Problem Language Result Execution time Memory
1082410 2024-08-31T09:56:42 Z hahahaha Robot (JOI21_ho_t4) C++17
100 / 100
406 ms 159956 KB
#include <bits/stdc++.h>
#define eb emplace_back
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

const ll MAX=1e6+10;
const ll oo=0x3f3f3f3f3f3f3f3f;

ll n,m;

struct edge{
	ll d,clr,cst;
	edge(ll a,ll b,ll c):d(a),clr(b),cst(c){}
};

vector<edge> G[MAX];
vector<pll> G2[MAX*3];

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m;
	for (int i=0;i<m;i++) {
		ll a,b,c,p;
		cin>>a>>b>>c>>p;
		G[a].eb(b,c,p);
		G[b].eb(a,c,p);
		G2[a].eb(b,p);
		G2[b].eb(a,p);
	}
	int now=n+1;
	for (int i=1;i<=n;i++) {
		map<int,vector<pll> > ttl;
		for (auto eg:G[i]) ttl[eg.clr].eb(eg.d,eg.cst);
		for (auto [clr,egs]:ttl) {
			ll ttlw=0;
			for (auto eg:egs) ttlw+=eg.S;
			G2[i].eb(now,0);
			for (auto eg:egs) {
				G2[now].eb(eg.F,ttlw-eg.S);
				G2[eg.F].eb(now,0);
			}
			++now;
		}
	}
	priority_queue<pll> D;
	vector<bool> vis(now+1,0);
	vector<ll> d(now+1,oo);
	d[1]=0;
	D.emplace(0,1);
	while (!D.empty()) {
		while (!D.empty() and vis[D.top().S]) D.pop();
		if (D.empty()) break;
		int v=D.top().S;
		D.pop();
		vis[v]=true;
		for (auto [u,w]:G2[v]) {
			if (!vis[u] and d[v]+w<d[u]) {
				d[u]=d[v]+w;
				D.emplace(-d[u],u);
			}
		}
	}
	cout<<(d[n]==oo?-1:d[n])<<"\n";
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 28 ms 94296 KB Output is correct
2 Correct 26 ms 94312 KB Output is correct
3 Correct 26 ms 94296 KB Output is correct
4 Correct 23 ms 94300 KB Output is correct
5 Correct 25 ms 94300 KB Output is correct
6 Correct 25 ms 94388 KB Output is correct
7 Correct 25 ms 94556 KB Output is correct
8 Correct 24 ms 94344 KB Output is correct
9 Correct 27 ms 94812 KB Output is correct
10 Correct 26 ms 94812 KB Output is correct
11 Correct 26 ms 94812 KB Output is correct
12 Correct 28 ms 94800 KB Output is correct
13 Correct 26 ms 94812 KB Output is correct
14 Correct 26 ms 94804 KB Output is correct
15 Correct 28 ms 94556 KB Output is correct
16 Correct 26 ms 94812 KB Output is correct
17 Correct 27 ms 94760 KB Output is correct
18 Correct 26 ms 94480 KB Output is correct
19 Correct 25 ms 94812 KB Output is correct
20 Correct 25 ms 94544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 113 ms 114640 KB Output is correct
2 Correct 72 ms 103236 KB Output is correct
3 Correct 118 ms 125132 KB Output is correct
4 Correct 82 ms 107260 KB Output is correct
5 Correct 406 ms 154636 KB Output is correct
6 Correct 349 ms 149808 KB Output is correct
7 Correct 233 ms 146924 KB Output is correct
8 Correct 293 ms 146332 KB Output is correct
9 Correct 300 ms 146216 KB Output is correct
10 Correct 172 ms 127432 KB Output is correct
11 Correct 117 ms 120312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 94296 KB Output is correct
2 Correct 26 ms 94312 KB Output is correct
3 Correct 26 ms 94296 KB Output is correct
4 Correct 23 ms 94300 KB Output is correct
5 Correct 25 ms 94300 KB Output is correct
6 Correct 25 ms 94388 KB Output is correct
7 Correct 25 ms 94556 KB Output is correct
8 Correct 24 ms 94344 KB Output is correct
9 Correct 27 ms 94812 KB Output is correct
10 Correct 26 ms 94812 KB Output is correct
11 Correct 26 ms 94812 KB Output is correct
12 Correct 28 ms 94800 KB Output is correct
13 Correct 26 ms 94812 KB Output is correct
14 Correct 26 ms 94804 KB Output is correct
15 Correct 28 ms 94556 KB Output is correct
16 Correct 26 ms 94812 KB Output is correct
17 Correct 27 ms 94760 KB Output is correct
18 Correct 26 ms 94480 KB Output is correct
19 Correct 25 ms 94812 KB Output is correct
20 Correct 25 ms 94544 KB Output is correct
21 Correct 113 ms 114640 KB Output is correct
22 Correct 72 ms 103236 KB Output is correct
23 Correct 118 ms 125132 KB Output is correct
24 Correct 82 ms 107260 KB Output is correct
25 Correct 406 ms 154636 KB Output is correct
26 Correct 349 ms 149808 KB Output is correct
27 Correct 233 ms 146924 KB Output is correct
28 Correct 293 ms 146332 KB Output is correct
29 Correct 300 ms 146216 KB Output is correct
30 Correct 172 ms 127432 KB Output is correct
31 Correct 117 ms 120312 KB Output is correct
32 Correct 98 ms 127952 KB Output is correct
33 Correct 111 ms 124104 KB Output is correct
34 Correct 226 ms 133528 KB Output is correct
35 Correct 156 ms 125636 KB Output is correct
36 Correct 201 ms 130980 KB Output is correct
37 Correct 221 ms 139716 KB Output is correct
38 Correct 225 ms 148832 KB Output is correct
39 Correct 136 ms 140836 KB Output is correct
40 Correct 300 ms 147772 KB Output is correct
41 Correct 318 ms 147792 KB Output is correct
42 Correct 298 ms 143136 KB Output is correct
43 Correct 116 ms 120264 KB Output is correct
44 Correct 180 ms 145096 KB Output is correct
45 Correct 276 ms 135456 KB Output is correct
46 Correct 203 ms 131636 KB Output is correct
47 Correct 227 ms 136576 KB Output is correct
48 Correct 359 ms 159956 KB Output is correct