oj.uz

Submission #494065

# Submission time Handle Problem Language Result Execution time Memory
494065 2021-12-14T07:11:18 Z rk42745417 Robot (JOI21_ho_t4) C++17
100 / 100
 403 ms 42576 KB 
/*
--------------              |   /
      |                     |  /
      |                     | /
      |             *       |/          |    |         ------            *
      |                     |           |    |        /      \
      |             |       |\          |    |       |       |\          |
   \  |             |       | \         |    |       |       | \         |
    \ |             |       |  \        |    |        \     /   \        |
     V              |       |   \        \__/|         -----     \       |
*/
#include <bits/stdc++.h>
using namespace std;

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
const double EPS  = 1e-8;
const int INF     = 0x3F3F3F3F;
const ll LINF     = 4611686018427387903;
const int MOD     = 1e9+7;
/*--------------------------------------------------------------------------------------*/

struct dat {
	int v, c;
	ll p;
	bool operator<(const dat &b) { return c < b.c; }
};

signed main() { EmiliaMyWife
	int n, m;
	cin >> n >> m;
	vector<vector<dat>> edge(n + 1), nwedge(n + 1);
	set<pair<int, int>> has;
	vector<ll> dis(n + 1, LINF), sum(m + 1);
	for(int i = 0, a, b, c, d; i < m; i++) {
		cin >> a >> b >> c >> d;
		edge[a].push_back({b, c, d});
		edge[b].push_back({a, c, d});
	}
	for(int i = 1; i <= n; i++) {
		for(const auto &[v, c, p] : edge[i])
			sum[c] += p;
		for(const auto &[v, c, p] : edge[i])
			nwedge[i].push_back({v, c, sum[c] - p});
		for(const auto &[v, c, p] : edge[i])
			sum[c] -= p;
		sort(nwedge[i].begin(), nwedge[i].end());
	}
	dis[1] = 0;
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
	pq.push({0, 1});
	while(!pq.empty()) {
		const auto [d, u] = pq.top();
		pq.pop();
		if(d > dis[u])
			continue;
		for(const auto &[v, c, p] : edge[u]) {
			if(dis[v] > dis[u] + p) {
				dis[v] = dis[u] + p;
				pq.push({dis[v], v});
			}
			if(has.count(make_pair(v, c)))
				continue;
			has.insert({v, c});
			int it = lower_bound(nwedge[v].begin(), nwedge[v].end(), (dat){-1, c, -1}) - nwedge[v].begin();
			while(it < nwedge[v].size() && nwedge[v][it].c == c) {
				if(dis[nwedge[v][it].v] > dis[u] + nwedge[v][it].p) {
					dis[nwedge[v][it].v] = dis[u] + nwedge[v][it].p;
					pq.push({dis[nwedge[v][it].v], nwedge[v][it].v});
				}
				it++;
			}
		}
		for(const auto &[v, c, p] : nwedge[u]) {
			if(dis[v] > dis[u] + p) {
				dis[v] = dis[u] + p;
				pq.push({dis[v], v});
			}
		}
	}
	if(dis[n] != LINF)
		cout << dis[n] << '\n';
	else
		cout << "-1\n";
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:69:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<dat>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    while(it < nwedge[v].size() && nwedge[v][it].c == c) {
      |          ~~~^~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 588 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 588 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 2 ms 588 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 14816 KB Output is correct
2 Correct 50 ms 7216 KB Output is correct
3 Correct 152 ms 19420 KB Output is correct
4 Correct 76 ms 10396 KB Output is correct
5 Correct 384 ms 40500 KB Output is correct
6 Correct 330 ms 37984 KB Output is correct
7 Correct 236 ms 33824 KB Output is correct
8 Correct 315 ms 35292 KB Output is correct
9 Correct 331 ms 35272 KB Output is correct
10 Correct 193 ms 22968 KB Output is correct
11 Correct 61 ms 16964 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 588 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 588 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 127 ms 14816 KB Output is correct
22 Correct 50 ms 7216 KB Output is correct
23 Correct 152 ms 19420 KB Output is correct
24 Correct 76 ms 10396 KB Output is correct
25 Correct 384 ms 40500 KB Output is correct
26 Correct 330 ms 37984 KB Output is correct
27 Correct 236 ms 33824 KB Output is correct
28 Correct 315 ms 35292 KB Output is correct
29 Correct 331 ms 35272 KB Output is correct
30 Correct 193 ms 22968 KB Output is correct
31 Correct 61 ms 16964 KB Output is correct
32 Correct 128 ms 18152 KB Output is correct
33 Correct 142 ms 18468 KB Output is correct
34 Correct 358 ms 27052 KB Output is correct
35 Correct 214 ms 22188 KB Output is correct
36 Correct 214 ms 26672 KB Output is correct
37 Correct 229 ms 30592 KB Output is correct
38 Correct 265 ms 35108 KB Output is correct
39 Correct 149 ms 25016 KB Output is correct
40 Correct 345 ms 35892 KB Output is correct
41 Correct 330 ms 35908 KB Output is correct
42 Correct 342 ms 35656 KB Output is correct
43 Correct 121 ms 16552 KB Output is correct
44 Correct 234 ms 29496 KB Output is correct
45 Correct 250 ms 30204 KB Output is correct
46 Correct 210 ms 29200 KB Output is correct
47 Correct 226 ms 29680 KB Output is correct
48 Correct 403 ms 42576 KB Output is correct