oj.uz

Submission #529606

# Submission time Handle Problem Language Result Execution time Memory
529606 2022-02-23T08:57:16 Z abc864197532 Robot (JOI21_ho_t4) C++17
100 / 100
 1756 ms 85616 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif
const int N = 400087;

vector <pair <int, lli>> adj[N];
map <pii, int> col_to_idx;
map <pii, lli> col_sum;
int _id = 0;

int get(int v, int c) {
	if (col_to_idx.count({v, c}))
		return col_to_idx[{v, c}];
	return col_to_idx[{v, c}] = _id++;
}

int main () {
	owo;
	int n, m;
	cin >> n >> m;
	vector <array <int, 4>> E;
	for (int i = 0, u, v, c, p; i < m; ++i) {
		cin >> u >> v >> c >> p, --u, --v, --c;
		col_sum[{u, c}] += p;
		col_sum[{v, c}] += p;
		E.pb({u, v, c, p});
		E.pb({v, u, c, p});
	}
	for (auto e : E) {
		int u = e[0], v = e[1], col = e[2], p = e[3];
		int a = get(u, col), b = get(u, -1), c = get(v, col), d = get(v, -1);
		// only add u -> v
		adj[a].eb(d, col_sum[{u, col}] - p);
		adj[b].eb(c, 0);
		adj[b].eb(d, min(1ll * p, col_sum[{u, col}] - p));
	}
	int st = get(0, -1);
	vector <lli> dis(_id, 1ll << 60);
	dis[st] = 0;
	priority_queue <pair <lli, int>, vector <pair <lli, int>>, greater <pair <lli, int>>> pq;
	pq.emplace(dis[st], st);
	while (!pq.empty()) {
		lli d; int v; tie(d, v) = pq.top(); pq.pop();
		if (d > dis[v])
			continue;
		for (auto [u, w] : adj[v]) if (dis[u] > dis[v] + w) {
			dis[u] = dis[v] + w;
			pq.emplace(dis[u], u);
		}
	}
	lli ans;
	if (get(n - 1, -1) == dis.size())
		ans = -1;
	else
		ans = dis[get(n - 1, -1)];
	if (ans == 1ll << 60)
		ans = -1;
	cout << ans << endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:74:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |  if (get(n - 1, -1) == dis.size())
      |      ~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9688 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 7 ms 9932 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 10 ms 10444 KB Output is correct
10 Correct 10 ms 10320 KB Output is correct
11 Correct 9 ms 10188 KB Output is correct
12 Correct 12 ms 10116 KB Output is correct
13 Correct 9 ms 10316 KB Output is correct
14 Correct 9 ms 10316 KB Output is correct
15 Correct 10 ms 10048 KB Output is correct
16 Correct 10 ms 10188 KB Output is correct
17 Correct 9 ms 10192 KB Output is correct
18 Correct 7 ms 9932 KB Output is correct
19 Correct 10 ms 10188 KB Output is correct
20 Correct 9 ms 10060 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 521 ms 35576 KB Output is correct
2 Correct 173 ms 22384 KB Output is correct
3 Correct 585 ms 42116 KB Output is correct
4 Correct 274 ms 27240 KB Output is correct
5 Correct 1745 ms 85104 KB Output is correct
6 Correct 1439 ms 79268 KB Output is correct
7 Correct 827 ms 66980 KB Output is correct
8 Correct 1366 ms 65912 KB Output is correct
9 Correct 1362 ms 66072 KB Output is correct
10 Correct 878 ms 52432 KB Output is correct
11 Correct 556 ms 41524 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9688 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 7 ms 9932 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 10 ms 10444 KB Output is correct
10 Correct 10 ms 10320 KB Output is correct
11 Correct 9 ms 10188 KB Output is correct
12 Correct 12 ms 10116 KB Output is correct
13 Correct 9 ms 10316 KB Output is correct
14 Correct 9 ms 10316 KB Output is correct
15 Correct 10 ms 10048 KB Output is correct
16 Correct 10 ms 10188 KB Output is correct
17 Correct 9 ms 10192 KB Output is correct
18 Correct 7 ms 9932 KB Output is correct
19 Correct 10 ms 10188 KB Output is correct
20 Correct 9 ms 10060 KB Output is correct
21 Correct 521 ms 35576 KB Output is correct
22 Correct 173 ms 22384 KB Output is correct
23 Correct 585 ms 42116 KB Output is correct
24 Correct 274 ms 27240 KB Output is correct
25 Correct 1745 ms 85104 KB Output is correct
26 Correct 1439 ms 79268 KB Output is correct
27 Correct 827 ms 66980 KB Output is correct
28 Correct 1366 ms 65912 KB Output is correct
29 Correct 1362 ms 66072 KB Output is correct
30 Correct 878 ms 52432 KB Output is correct
31 Correct 556 ms 41524 KB Output is correct
32 Correct 479 ms 37976 KB Output is correct
33 Correct 476 ms 38372 KB Output is correct
34 Correct 973 ms 54856 KB Output is correct
35 Correct 731 ms 46160 KB Output is correct
36 Correct 762 ms 52524 KB Output is correct
37 Correct 761 ms 60956 KB Output is correct
38 Correct 841 ms 72592 KB Output is correct
39 Correct 569 ms 47948 KB Output is correct
40 Correct 1298 ms 65844 KB Output is correct
41 Correct 1316 ms 66096 KB Output is correct
42 Correct 1294 ms 70760 KB Output is correct
43 Correct 572 ms 39288 KB Output is correct
44 Correct 1102 ms 58372 KB Output is correct
45 Correct 995 ms 56000 KB Output is correct
46 Correct 910 ms 54680 KB Output is correct
47 Correct 773 ms 57432 KB Output is correct
48 Correct 1756 ms 85616 KB Output is correct