oj.uz

Submission #771078

# Submission time Handle Problem Language Result Execution time Memory
771078 2023-07-02T12:29:02 Z SamNguyen Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 28132 KB 
#include <bits/stdc++.h>
using namespace std;
using lli = long long;

template <class T> 
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const lli INF = 0x1f1f1f1f1f1f1f1f;
const int MAX_N = 1e5 + 7;
const int MAX_M = 2e5 + 7;

template <class T1, class T2>
inline constexpr bool minimise(T1 &x, T2 y) {
	if (x > y) { x = y; return true; }
	return false;
}

class Edge {
private:
	int u, v, c;
	lli w;

public:
	Edge(int u = 0, int v = 0, int c = 0, lli w = 0): u(u), v(v), c(c), w(w) {}

	inline lli cost() const { return w; }
	inline pair<int, int> nodes() const { return make_pair(u, v); }
	inline int other_node(int z) const { return u ^ v ^ z; }
	inline int colour() const { return c; }

	inline int get_node(bool is_rev) const { return is_rev ? v : u; }
	inline bool is_start(int z) const { return z == u; }
};

int N, M;
Edge edge[MAX_M];
vector<int> adj[MAX_N];

void input() {
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		int u, v, c; lli w;
		cin >> u >> v >> c >> w;
		edge[i] = Edge(u, v, c, w);
		adj[u].push_back(i);
		adj[v].push_back(i);
	}

	edge[M] = Edge(0, 1, M + 1, 0);
}

lli dist[MAX_M][2][2];
bool is_locked[MAX_M][2][2];

min_priority_queue<tuple<lli, int, bool, bool>> pq;
lli sum_colour[MAX_M];

lli solve() {
	memset(dist, 0x1f, sizeof dist);
	memset(is_locked, false, sizeof is_locked);
	memset(sum_colour, 0, sizeof sum_colour);

	auto relax = [&](int i, bool is_rev, bool is_prev_mod, lli d) {
		if (minimise(dist[i][is_rev][is_prev_mod], d))
			pq.emplace(d, i, is_rev, is_prev_mod);
	};

	relax(M, 0, 0, 0);

	lli ans = INF;
	while (not pq.empty()) {
		lli cur_dist; int i; bool is_rev, is_prev_mod;
		tie(cur_dist, i, is_rev, is_prev_mod) = pq.top();
		pq.pop();

		int v = edge[i].get_node(not is_rev);
		if (v == N) 
			minimise(ans, cur_dist);

		if (is_locked[i][is_rev][is_prev_mod])
			continue;
		is_locked[i][is_rev][is_prev_mod] = true;

		for (int j : adj[v]) {
			if (j == i and is_prev_mod)
				continue;

			int c = edge[j].colour();
			sum_colour[c] += edge[j].cost();
		}

		for (int j : adj[v]) {
			if (j == i and is_prev_mod)
				continue;

			int c = edge[j].colour();
			lli w = edge[j].cost();
			bool new_is_rev = not edge[j].is_start(v);

			if (sum_colour[c] == w)
				relax(j, new_is_rev, false, cur_dist);

			relax(j, new_is_rev, true, cur_dist + w);
			relax(j, new_is_rev, false, cur_dist + sum_colour[c] - w);
		}

		for (int j : adj[v]) {
			int c = edge[j].colour();
			sum_colour[c] = 0;
		}
	}

	if (ans >= INF)
		ans = -1;
	return ans;
}

int main(void) {
	input();
	cout << solve();

	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 6 ms 15828 KB Output is correct
3 Correct 6 ms 15956 KB Output is correct
4 Correct 7 ms 15880 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 7 ms 15956 KB Output is correct
7 Correct 9 ms 16084 KB Output is correct
8 Correct 8 ms 16008 KB Output is correct
9 Correct 29 ms 16212 KB Output is correct
10 Correct 25 ms 16084 KB Output is correct
11 Correct 36 ms 16136 KB Output is correct
12 Correct 18 ms 16084 KB Output is correct
13 Correct 38 ms 16112 KB Output is correct
14 Correct 35 ms 16212 KB Output is correct
15 Correct 8 ms 15956 KB Output is correct
16 Correct 9 ms 15956 KB Output is correct
17 Correct 8 ms 16084 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 14 ms 16376 KB Output is correct
20 Correct 8 ms 15956 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 21552 KB Output is correct
2 Correct 72 ms 18752 KB Output is correct
3 Correct 473 ms 26364 KB Output is correct
4 Correct 108 ms 19160 KB Output is correct
5 Execution timed out 3079 ms 28132 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 6 ms 15828 KB Output is correct
3 Correct 6 ms 15956 KB Output is correct
4 Correct 7 ms 15880 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 7 ms 15956 KB Output is correct
7 Correct 9 ms 16084 KB Output is correct
8 Correct 8 ms 16008 KB Output is correct
9 Correct 29 ms 16212 KB Output is correct
10 Correct 25 ms 16084 KB Output is correct
11 Correct 36 ms 16136 KB Output is correct
12 Correct 18 ms 16084 KB Output is correct
13 Correct 38 ms 16112 KB Output is correct
14 Correct 35 ms 16212 KB Output is correct
15 Correct 8 ms 15956 KB Output is correct
16 Correct 9 ms 15956 KB Output is correct
17 Correct 8 ms 16084 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 14 ms 16376 KB Output is correct
20 Correct 8 ms 15956 KB Output is correct
21 Correct 184 ms 21552 KB Output is correct
22 Correct 72 ms 18752 KB Output is correct
23 Correct 473 ms 26364 KB Output is correct
24 Correct 108 ms 19160 KB Output is correct
25 Execution timed out 3079 ms 28132 KB Time limit exceeded
26 Halted 0 ms 0 KB -