oj.uz

Submission #380390

# Submission time Handle Problem Language Result Execution time Memory
380390 2021-03-21T11:17:29 Z peijar Robot (JOI21_ho_t4) C++17
100 / 100
 459 ms 74388 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int INF = 1e18;

signed main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int nbSommets, nbAretes;
	cin >> nbSommets >> nbAretes;
	vector<vector<tuple<int, int, int>>> aretesAdj(nbSommets+1);
	for (int iArete = 0; iArete < nbAretes; ++iArete) 
	{
		int u, v, iCol, cost;
		cin >> u >> v >> iCol >> cost;
		aretesAdj[u].emplace_back(iCol, v, cost);
		aretesAdj[v].emplace_back(iCol, u, cost);
	}

	int szAdj = nbSommets;
	vector<vector<pair<int, int>>> adj(nbSommets+1);
	for (int iSommet = 1; iSommet <= nbSommets; ++iSommet) 
	{
		sort(aretesAdj[iSommet].begin(), aretesAdj[iSommet].end());
		int deg = aretesAdj[iSommet].size();
		for (int iAdj(0); iAdj < deg;)
		{
			int iPos(iAdj);
			int col = get<0>(aretesAdj[iSommet][iAdj]);
			int totCost = 0;
			while (iPos < deg and get<0>(aretesAdj[iSommet][iPos]) == col)
				totCost += get<2>(aretesAdj[iSommet][iPos++]);
			adj.emplace_back();
			adj[iSommet].emplace_back(++szAdj, 0);
			for (int i(iAdj); i < iPos; ++i)
			{
				auto [icol, iFrere, cost] = aretesAdj[iSommet][i];
				adj[iSommet].emplace_back(iFrere, cost);
				adj[iFrere].emplace_back(szAdj, 0);
				adj[szAdj].emplace_back(iFrere, totCost - cost);
			}
			iAdj = iPos;
		}
	}
	vector<int> dis(1+adj.size(), INF);
	dis[0] = 0;
	priority_queue<pair<int, int>> pq;
	pq.emplace(0, 1);
	while (!pq.empty())
	{
		auto [curDis, iNoeud] = pq.top(); pq.pop();

		curDis = -curDis;
		if (dis[iNoeud] < curDis) continue;
		for (auto [iFrere, iCout] : adj[iNoeud])
			if (iCout + curDis < dis[iFrere])
			{
				dis[iFrere] = iCout + curDis;
				pq.emplace(-dis[iFrere], iFrere);
			}
	}
	int sol = dis[nbSommets];
	if (sol == INF) sol = -1;
	cout<< sol << endl;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 2 ms 1004 KB Output is correct
12 Correct 3 ms 1004 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 3 ms 1004 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 1004 KB Output is correct
17 Correct 2 ms 876 KB Output is correct
18 Correct 1 ms 620 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 2 ms 748 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 23656 KB Output is correct
2 Correct 60 ms 11560 KB Output is correct
3 Correct 168 ms 34112 KB Output is correct
4 Correct 103 ms 16520 KB Output is correct
5 Correct 454 ms 70380 KB Output is correct
6 Correct 349 ms 64768 KB Output is correct
7 Correct 257 ms 60888 KB Output is correct
8 Correct 458 ms 59716 KB Output is correct
9 Correct 456 ms 59716 KB Output is correct
10 Correct 269 ms 39320 KB Output is correct
11 Correct 180 ms 32060 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 2 ms 1004 KB Output is correct
12 Correct 3 ms 1004 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 3 ms 1004 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 1004 KB Output is correct
17 Correct 2 ms 876 KB Output is correct
18 Correct 1 ms 620 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 140 ms 23656 KB Output is correct
22 Correct 60 ms 11560 KB Output is correct
23 Correct 168 ms 34112 KB Output is correct
24 Correct 103 ms 16520 KB Output is correct
25 Correct 454 ms 70380 KB Output is correct
26 Correct 349 ms 64768 KB Output is correct
27 Correct 257 ms 60888 KB Output is correct
28 Correct 458 ms 59716 KB Output is correct
29 Correct 456 ms 59716 KB Output is correct
30 Correct 269 ms 39320 KB Output is correct
31 Correct 180 ms 32060 KB Output is correct
32 Correct 134 ms 34564 KB Output is correct
33 Correct 158 ms 32372 KB Output is correct
34 Correct 329 ms 45476 KB Output is correct
35 Correct 280 ms 36648 KB Output is correct
36 Correct 327 ms 45364 KB Output is correct
37 Correct 279 ms 52976 KB Output is correct
38 Correct 270 ms 65988 KB Output is correct
39 Correct 193 ms 47356 KB Output is correct
40 Correct 433 ms 60996 KB Output is correct
41 Correct 459 ms 61192 KB Output is correct
42 Correct 456 ms 58816 KB Output is correct
43 Correct 177 ms 29616 KB Output is correct
44 Correct 247 ms 53244 KB Output is correct
45 Correct 386 ms 48452 KB Output is correct
46 Correct 280 ms 44296 KB Output is correct
47 Correct 313 ms 50604 KB Output is correct
48 Correct 435 ms 74388 KB Output is correct