oj.uz

Submission #678618

# Submission time Handle Problem Language Result Execution time Memory
678618 2023-01-06T08:40:30 Z SanguineChameleon Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 274 ms 20416 KB 
// BEGIN BOILERPLATE CODE

#include <bits/stdc++.h>
using namespace std;

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const long long inf = 1e18L + 20;
const int ms = 1e5 + 20;
vector<pair<int, int>> adj[ms];
long long d_sx[ms];
long long d_tx[ms];
long long d_ty[ms];
long long dp_tx[ms];
long long dp_ty[ms];
bool g1[ms];
bool g2[ms];
bool g3[ms];
bool f[ms];
int n, m, sx, sy, tx, ty;

void dijk(int cx, long long d[]) {
	for (int i = 1; i <= n; i++) {
		d[i] = inf;
	}
	d[cx] = 0;
	priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> q;
	q.push({0, cx});
	while (!q.empty()) {
		int u = q.top().second;
		long long cd = q.top().first;
		q.pop();
		if (d[u] != cd) {
			continue;
		}
		for (auto x: adj[u]) {
			int v = x.first;
			int w = x.second;
			if (d[u] + w < d[v]) {
				d[v] = d[u] + w;
				q.push({d[v], v});
			} 
		}
	}
}

void dfs1(int u) {
	if (u == sy) {
		f[u] = true;
		return;
	}
	for (auto x: adj[u]) {
		int v = x.first;
		int w = x.second;
		if (d_sx[u] + w == d_sx[v]) {
			if (!g3[v]) {
				dfs1(v);
				g3[v] = true;
			}
			f[u] |= f[v];
		}
	}
}

void dfs2(int u, long long dp[], long long d[], bool g[]) {
	dp[u] = d[u];
	if (u == sy) {
		return;
	}
	for (auto x: adj[u]) {
		int v = x.first;
		int w = x.second;
		if (d_sx[u] + w == d_sx[v]) {
			if (f[v]) {
				if (!g[v]) {
					dfs2(v, dp, d, g);
					g[v] = true;
				}
				dp[u] = min(dp[u], dp[v]);
			}
		}
	}
}

void just_do_it() {
	cin >> n >> m;
	cin >> sx >> sy >> tx >> ty;
	for (int i = 0; i < m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		adj[u].push_back({v, w});
		adj[v].push_back({u, w});
	}
	dijk(sx, d_sx);
	dijk(tx, d_tx);
	dijk(ty, d_ty);
	dfs1(sx);
	dfs2(sx, dp_tx, d_tx, g1);
	dfs2(sx, dp_ty, d_ty, g2);
	long long res = d_tx[ty];
	for (int u = 1; u <= n; u++) {
		if (f[u]) {
			res = min(res, dp_tx[u] + d_ty[u]);
			res = min(res, dp_ty[u] + d_tx[u]);
		}
	}
	cout << res;
}

// END MAIN CODE

Compilation message

commuter_pass.cpp: In function 'void file_io(std::string, std::string)':
commuter_pass.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 14420 KB Output is correct
2 Correct 257 ms 13480 KB Output is correct
3 Correct 247 ms 20416 KB Output is correct
4 Correct 196 ms 15108 KB Output is correct
5 Correct 233 ms 14348 KB Output is correct
6 Correct 211 ms 15280 KB Output is correct
7 Correct 237 ms 14320 KB Output is correct
8 Correct 236 ms 14488 KB Output is correct
9 Correct 207 ms 13916 KB Output is correct
10 Correct 176 ms 13804 KB Output is correct
11 Correct 101 ms 14876 KB Output is correct
12 Correct 218 ms 13836 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 15904 KB Output is correct
2 Correct 247 ms 16344 KB Output is correct
3 Correct 219 ms 15848 KB Output is correct
4 Correct 222 ms 16160 KB Output is correct
5 Correct 254 ms 16880 KB Output is correct
6 Correct 252 ms 18912 KB Output is correct
7 Correct 234 ms 19524 KB Output is correct
8 Correct 244 ms 16480 KB Output is correct
9 Correct 228 ms 16796 KB Output is correct
10 Correct 218 ms 15844 KB Output is correct
11 Correct 118 ms 15944 KB Output is correct
12 Correct 239 ms 19220 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3412 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 14 ms 4604 KB Output is correct
5 Correct 9 ms 3720 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 3 ms 2788 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 10 ms 3796 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 14420 KB Output is correct
2 Correct 257 ms 13480 KB Output is correct
3 Correct 247 ms 20416 KB Output is correct
4 Correct 196 ms 15108 KB Output is correct
5 Correct 233 ms 14348 KB Output is correct
6 Correct 211 ms 15280 KB Output is correct
7 Correct 237 ms 14320 KB Output is correct
8 Correct 236 ms 14488 KB Output is correct
9 Correct 207 ms 13916 KB Output is correct
10 Correct 176 ms 13804 KB Output is correct
11 Correct 101 ms 14876 KB Output is correct
12 Correct 218 ms 13836 KB Output is correct
13 Correct 220 ms 15904 KB Output is correct
14 Correct 247 ms 16344 KB Output is correct
15 Correct 219 ms 15848 KB Output is correct
16 Correct 222 ms 16160 KB Output is correct
17 Correct 254 ms 16880 KB Output is correct
18 Correct 252 ms 18912 KB Output is correct
19 Correct 234 ms 19524 KB Output is correct
20 Correct 244 ms 16480 KB Output is correct
21 Correct 228 ms 16796 KB Output is correct
22 Correct 218 ms 15844 KB Output is correct
23 Correct 118 ms 15944 KB Output is correct
24 Correct 239 ms 19220 KB Output is correct
25 Correct 8 ms 3412 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 14 ms 4604 KB Output is correct
29 Correct 9 ms 3720 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 3 ms 2788 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 10 ms 3796 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 205 ms 15228 KB Output is correct
41 Correct 217 ms 14144 KB Output is correct
42 Correct 206 ms 14004 KB Output is correct
43 Correct 120 ms 15580 KB Output is correct
44 Correct 121 ms 15632 KB Output is correct
45 Correct 243 ms 15088 KB Output is correct
46 Correct 224 ms 14260 KB Output is correct
47 Correct 221 ms 15228 KB Output is correct
48 Correct 120 ms 12596 KB Output is correct
49 Correct 191 ms 15300 KB Output is correct
50 Correct 274 ms 14192 KB Output is correct
51 Correct 252 ms 14324 KB Output is correct