oj.uz

Submission #805551

# Submission time Handle Problem Language Result Execution time Memory
805551 2023-08-03T17:47:29 Z denniskim Robot (JOI21_ho_t4) C++17
100 / 100
 1985 ms 184256 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

struct edge
{
	ll v, col, cost, num;
};

ll n, m;
vector<edge> vec[500010];
pair<pll, pll> edg[500010];
ll all, bll, cll, dll;
map<pll, ll> bun;
map<pll, vector<pll> > vv;
map<pll, ll> sum;
ll cc;
vector<pll> vec2[500010];
ll dist[500010];
priority_queue<pll> pq;
ll ans = INF;

int main(void)
{
	fastio
	
	cin >> n >> m;
	
	for(ll i = 1 ; i <= m ; ++i)
	{
		cin >> all >> bll >> cll >> dll;
		
		vec[all].push_back({bll, cll, dll, i});
		vec[bll].push_back({all, cll, dll, i});
		edg[i] = {{all, bll}, {cll, dll}};
	}
	
	for(ll i = 1 ; i <= n ; ++i)
	{
		bun[{i, 0}] = ++cc;
		
		for(auto &j : vec[i])
		{
			bun[{i, j.num}] = ++cc;
			
			if((ll)vv[{i, j.col}].size() < 2)
			{
				vv[{i, j.col}].push_back({j.cost, j.num});
				sort(vv[{i, j.col}].begin(), vv[{i, j.col}].end());
				reverse(vv[{i, j.col}].begin(), vv[{i, j.col}].end());
			}
			
			else
			{
				if(vv[{i, j.col}][0].fi < j.cost)
				{
					vv[{i, j.col}][1] = vv[{i, j.col}][0];
					vv[{i, j.col}][0] = {j.cost, j.num};
				}
				
				else if(vv[{i, j.col}][1].fi < j.cost)
					vv[{i, j.col}][1] = {j.cost, j.num};
			}
			
			sum[{i, j.col}] += j.cost;
			vec2[cc].push_back({bun[{i, 0}], 0});
		}
	}
	
	for(ll i = 1 ; i <= n ; ++i)
	{
		for(auto &j : vec[i])
		{
			ll C = sum[{i, j.col}] - j.cost;
			
			vec2[bun[{i, 0}]].push_back({bun[{j.v, 0}], C});
			vec2[bun[{i, 0}]].push_back({bun[{j.v, j.num}], j.cost});
			
			if((ll)vv[{i, j.col}].size() <= 1)
				continue;
			
			if((ll)vv[{i, j.col}][0].se != j.num)
			{
				ll numm = vv[{i, j.col}][0].se;
				vec2[bun[{i, j.num}]].push_back({bun[{edg[numm].fi.fi + edg[numm].fi.se - i, 0}], C - edg[numm].se.se});
			}
			
			else
			{
				ll numm = vv[{i, j.col}][1].se;
				vec2[bun[{i, j.num}]].push_back({bun[{edg[numm].fi.fi + edg[numm].fi.se - i, 0}], C - edg[numm].se.se});
			}
		}
	}
	
	for(ll i = 1 ; i <= cc ; ++i)
		dist[i] = INF;
	
	dist[bun[{1, 0}]] = 0;
	pq.push({0, bun[{1, 0}]});
	
	while(!pq.empty())
	{
		pll qq = pq.top();
		pq.pop();
		
		if(-qq.fi > dist[qq.se])
			continue;
		
		for(auto &i : vec2[qq.se])
		{
			if(dist[i.fi] > dist[qq.se] + i.se)
			{
				dist[i.fi] = dist[qq.se] + i.se;
				pq.push({-dist[i.fi], i.fi});
			}
		}
	}
	
	ans = min(ans, dist[bun[{n, 0}]]);
	
	for(auto &i : vec[n])
		ans = min(ans, dist[bun[{n, i.num}]]);
	
	if(ans == INF)
		cout << -1;
	else
		cout << ans;
	
	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23720 KB Output is correct
2 Correct 10 ms 23764 KB Output is correct
3 Correct 11 ms 23804 KB Output is correct
4 Correct 11 ms 23696 KB Output is correct
5 Correct 11 ms 23892 KB Output is correct
6 Correct 11 ms 23764 KB Output is correct
7 Correct 13 ms 24388 KB Output is correct
8 Correct 12 ms 23988 KB Output is correct
9 Correct 18 ms 25296 KB Output is correct
10 Correct 22 ms 25300 KB Output is correct
11 Correct 16 ms 25048 KB Output is correct
12 Correct 15 ms 24904 KB Output is correct
13 Correct 20 ms 25220 KB Output is correct
14 Correct 15 ms 25064 KB Output is correct
15 Correct 13 ms 24532 KB Output is correct
16 Correct 16 ms 25096 KB Output is correct
17 Correct 14 ms 24788 KB Output is correct
18 Correct 12 ms 24264 KB Output is correct
19 Correct 16 ms 25044 KB Output is correct
20 Correct 14 ms 24660 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 78876 KB Output is correct
2 Correct 187 ms 49248 KB Output is correct
3 Correct 682 ms 103856 KB Output is correct
4 Correct 271 ms 61276 KB Output is correct
5 Correct 1985 ms 174160 KB Output is correct
6 Correct 1779 ms 166828 KB Output is correct
7 Correct 1263 ms 151956 KB Output is correct
8 Correct 1246 ms 150156 KB Output is correct
9 Correct 1387 ms 150176 KB Output is correct
10 Correct 838 ms 111904 KB Output is correct
11 Correct 556 ms 90392 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23720 KB Output is correct
2 Correct 10 ms 23764 KB Output is correct
3 Correct 11 ms 23804 KB Output is correct
4 Correct 11 ms 23696 KB Output is correct
5 Correct 11 ms 23892 KB Output is correct
6 Correct 11 ms 23764 KB Output is correct
7 Correct 13 ms 24388 KB Output is correct
8 Correct 12 ms 23988 KB Output is correct
9 Correct 18 ms 25296 KB Output is correct
10 Correct 22 ms 25300 KB Output is correct
11 Correct 16 ms 25048 KB Output is correct
12 Correct 15 ms 24904 KB Output is correct
13 Correct 20 ms 25220 KB Output is correct
14 Correct 15 ms 25064 KB Output is correct
15 Correct 13 ms 24532 KB Output is correct
16 Correct 16 ms 25096 KB Output is correct
17 Correct 14 ms 24788 KB Output is correct
18 Correct 12 ms 24264 KB Output is correct
19 Correct 16 ms 25044 KB Output is correct
20 Correct 14 ms 24660 KB Output is correct
21 Correct 483 ms 78876 KB Output is correct
22 Correct 187 ms 49248 KB Output is correct
23 Correct 682 ms 103856 KB Output is correct
24 Correct 271 ms 61276 KB Output is correct
25 Correct 1985 ms 174160 KB Output is correct
26 Correct 1779 ms 166828 KB Output is correct
27 Correct 1263 ms 151956 KB Output is correct
28 Correct 1246 ms 150156 KB Output is correct
29 Correct 1387 ms 150176 KB Output is correct
30 Correct 838 ms 111904 KB Output is correct
31 Correct 556 ms 90392 KB Output is correct
32 Correct 702 ms 106020 KB Output is correct
33 Correct 561 ms 90240 KB Output is correct
34 Correct 982 ms 119916 KB Output is correct
35 Correct 792 ms 102416 KB Output is correct
36 Correct 1000 ms 113772 KB Output is correct
37 Correct 1095 ms 134556 KB Output is correct
38 Correct 1117 ms 151900 KB Output is correct
39 Correct 900 ms 120652 KB Output is correct
40 Correct 1341 ms 150132 KB Output is correct
41 Correct 1324 ms 150320 KB Output is correct
42 Correct 1384 ms 149368 KB Output is correct
43 Correct 581 ms 88988 KB Output is correct
44 Correct 1368 ms 143684 KB Output is correct
45 Correct 1076 ms 123728 KB Output is correct
46 Correct 845 ms 117528 KB Output is correct
47 Correct 1085 ms 129136 KB Output is correct
48 Correct 1830 ms 184256 KB Output is correct