oj.uz

Submission #486779

# Submission time Handle Problem Language Result Execution time Memory
486779 2021-11-12T18:30:23 Z socho Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 535 ms 25520 KB 
/*
	Going for full
*/
#include <bits/stdc++.h>
using namespace std;
void fast() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
	srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
	long long a = rand();
	long long b = rand();
	return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
	freopen("problem.in", "r", stdin); 
	freopen("problem.out", "w", stdout);
}
template<typename T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
#define endl '\n'
// #define double long double
#define int long long
// const int MOD = 1000 * 1000 * 1000 + 7;
// const int MOD = 998244353;
// #define cerr if(0) cerr
#define debug(x) cerr << #x << ": " << x << endl;

int n, m;
int s, t, u, v;
const int MXN = 100005;
vector<pair<int, int>> adj[MXN];
 
int distu[MXN], distv[MXN];
int dists[MXN], distt[MXN];
int dist[MXN];
bool access[MXN];
 
int result;
 
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> proc;
 
void src(int no) {
	
	for (int i=1; i<=n; i++) {
		dist[i] = LLONG_MAX;
	}
	
	proc.push({0, no});
	
	while (!proc.empty()) {
		
		pair<int, int> tr = proc.top();
		proc.pop();
		int di = tr.first, no = tr.second;
		if (dist[no] < di) continue;
		dist[no] = di;
		
		for (auto x: adj[no]) {
			int ot = x.first;
			int od = x.second + di;
			if (dist[ot] > od) {
				dist[ot] = od;
				proc.push({od, ot});
			}
		}
		
	}
	
}
 
int running_v[MXN];
int running_u[MXN];
 
bool byd(int a, int b) {
	return dist[a] < dist[b];
}
 
void go(int from, int to) {
	
	src(from);
	
	vector<int> proc;
	for (int i=1; i<=n; i++) proc.push_back(i);
	
	sort(proc.begin(), proc.end(), byd);
	
	for (auto no: proc) {
		
		running_v[no] = distv[no];
		running_u[no] = distu[no];
		
		for (auto x: adj[no]) {
			int ot = x.first;
			int od = x.second;
			if (dist[ot] + od == dist[no]) {
				running_u[no] = min(running_u[no], running_u[ot]);
				running_v[no] = min(running_v[no], running_v[ot]);
			}
		}
		
		if (access[no]) {
			result = min(result, running_u[no] + distv[no]);
			result = min(result, distu[no] + running_v[no]);
		}
		
	}
	
}
 
signed main() {
 
	cin >> n >> m;
	cin >> s >> t;
	cin >> u >> v;
	
	for (int i=0; i<m; i++) {
		int a, b, w;
		cin >> a >> b >> w;
		adj[a].push_back({b, w});
		adj[b].push_back({a, w});
	}
	
	src(u);
	for (int i=1; i<=n; i++) distu[i] = dist[i];
	
	src(v);
	for (int i=1; i<=n; i++) distv[i] = dist[i];
	
	result = distu[v];
	
	src(s);
	for (int i=1; i<=n; i++) dists[i] = dist[i];
	
	src(t);
	for (int i=1; i<=n; i++) distt[i] = dist[i];
	
	for (int i=1; i<=n; i++) {
		if (dists[i] + distt[i] == dists[t]) {
			access[i] = true;
		}
	}
	
	go(s, t);
	go(t, s);
	
	cout << result << endl;
 
}

Compilation message

commuter_pass.cpp: In function 'void usaco()':
commuter_pass.cpp:18:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  freopen("problem.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:19:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  freopen("problem.out", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 25244 KB Output is correct
2 Correct 514 ms 24864 KB Output is correct
3 Correct 509 ms 25136 KB Output is correct
4 Correct 488 ms 25272 KB Output is correct
5 Correct 454 ms 24608 KB Output is correct
6 Correct 509 ms 25404 KB Output is correct
7 Correct 473 ms 24884 KB Output is correct
8 Correct 474 ms 24740 KB Output is correct
9 Correct 504 ms 25468 KB Output is correct
10 Correct 485 ms 25304 KB Output is correct
11 Correct 229 ms 17272 KB Output is correct
12 Correct 501 ms 25388 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 495 ms 25108 KB Output is correct
2 Correct 494 ms 24820 KB Output is correct
3 Correct 503 ms 24740 KB Output is correct
4 Correct 491 ms 24832 KB Output is correct
5 Correct 484 ms 24668 KB Output is correct
6 Correct 469 ms 25128 KB Output is correct
7 Correct 488 ms 24576 KB Output is correct
8 Correct 479 ms 24736 KB Output is correct
9 Correct 535 ms 24740 KB Output is correct
10 Correct 485 ms 24732 KB Output is correct
11 Correct 213 ms 17296 KB Output is correct
12 Correct 479 ms 25124 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4460 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 40 ms 6184 KB Output is correct
5 Correct 26 ms 4364 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 4 ms 2792 KB Output is correct
8 Correct 5 ms 2892 KB Output is correct
9 Correct 3 ms 2740 KB Output is correct
10 Correct 20 ms 4428 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 3 ms 2672 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 25244 KB Output is correct
2 Correct 514 ms 24864 KB Output is correct
3 Correct 509 ms 25136 KB Output is correct
4 Correct 488 ms 25272 KB Output is correct
5 Correct 454 ms 24608 KB Output is correct
6 Correct 509 ms 25404 KB Output is correct
7 Correct 473 ms 24884 KB Output is correct
8 Correct 474 ms 24740 KB Output is correct
9 Correct 504 ms 25468 KB Output is correct
10 Correct 485 ms 25304 KB Output is correct
11 Correct 229 ms 17272 KB Output is correct
12 Correct 501 ms 25388 KB Output is correct
13 Correct 495 ms 25108 KB Output is correct
14 Correct 494 ms 24820 KB Output is correct
15 Correct 503 ms 24740 KB Output is correct
16 Correct 491 ms 24832 KB Output is correct
17 Correct 484 ms 24668 KB Output is correct
18 Correct 469 ms 25128 KB Output is correct
19 Correct 488 ms 24576 KB Output is correct
20 Correct 479 ms 24736 KB Output is correct
21 Correct 535 ms 24740 KB Output is correct
22 Correct 485 ms 24732 KB Output is correct
23 Correct 213 ms 17296 KB Output is correct
24 Correct 479 ms 25124 KB Output is correct
25 Correct 20 ms 4460 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 40 ms 6184 KB Output is correct
29 Correct 26 ms 4364 KB Output is correct
30 Correct 3 ms 2764 KB Output is correct
31 Correct 4 ms 2792 KB Output is correct
32 Correct 5 ms 2892 KB Output is correct
33 Correct 3 ms 2740 KB Output is correct
34 Correct 20 ms 4428 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 3 ms 2672 KB Output is correct
39 Correct 3 ms 2764 KB Output is correct
40 Correct 481 ms 25184 KB Output is correct
41 Correct 499 ms 25492 KB Output is correct
42 Correct 493 ms 25520 KB Output is correct
43 Correct 207 ms 17320 KB Output is correct
44 Correct 210 ms 17316 KB Output is correct
45 Correct 427 ms 24428 KB Output is correct
46 Correct 425 ms 24096 KB Output is correct
47 Correct 466 ms 25208 KB Output is correct
48 Correct 206 ms 16676 KB Output is correct
49 Correct 407 ms 24748 KB Output is correct
50 Correct 433 ms 24400 KB Output is correct
51 Correct 413 ms 24208 KB Output is correct