oj.uz

Submission #103359

# Submission time Handle Problem Language Result Execution time Memory
103359 2019-03-30T00:53:22 Z tincamatei Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 467 ms 21636 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000;
const long long INF = 1LL << 60;

vector<pair<int, int> > graph[1+MAX_N];

long long dist[2][1+MAX_N], dists[1+MAX_N];
long long dp[1+MAX_N][4];
bool viz[1+MAX_N];

void dijkstra(int n, int src, long long *dist) {
	priority_queue<pair<long long, int> > pq;

	for(int i = 1; i <= n; ++i)
		dist[i] = INF;
	
	dist[src] = 0;
	pq.push(make_pair(0, src));
	
	while(!pq.empty()) {
		int nod = pq.top().second;
		long long cost = -pq.top().first;
		pq.pop();

		if(cost == dist[nod]) {
			for(auto it: graph[nod])
				if(cost + it.second < dist[it.first]) {
					dist[it.first] = cost + it.second;
					pq.push(make_pair(-cost - it.second, it.first));
				}
		}
	}
}

void computeDp(int nod) {
	if(!viz[nod]) {
		viz[nod] = true;
		dp[nod][1] = dist[0][nod];
		dp[nod][2] = dist[1][nod];
		dp[nod][3] = dist[0][nod] + dist[1][nod];

		for(auto it: graph[nod])
			if(dists[nod] - it.second == dists[it.first]) {
				computeDp(it.first);
				dp[nod][1] = min(dp[nod][1], dp[it.first][1]);
				dp[nod][2] = min(dp[nod][2], dp[it.first][2]);
				dp[nod][3] = min(min(min(dp[nod][3], 
				                         dp[it.first][1] + dist[1][nod]),
				                         dp[it.first][2] + dist[0][nod]),
				                         dp[it.first][3]);
			}
	}
}

int main() {
#ifdef HOME
	FILE *fin = fopen("input.in", "r");
	FILE *fout = fopen("output.out", "w");
#else
	FILE *fin = stdin;
	FILE *fout = stdout;
#endif

	priority_queue<int> pq;

	int n, m, s, t, u, v;
	int a, b, c;

	fscanf(fin, "%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
	for(int i = 0; i < m; ++i) {
		fscanf(fin, "%d%d%d", &a, &b, &c);
		graph[a].push_back(make_pair(b, c));
		graph[b].push_back(make_pair(a, c));
	}

	dijkstra(n, u, dist[0]);
	dijkstra(n, v, dist[1]);
	dijkstra(n, s, dists);
	
	computeDp(t);
	
	fprintf(fout, "%lld", min(dist[0][v], dp[t][3]));

	fclose(fin);
	fclose(fout);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:72:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(fin, "%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
  ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:74:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(fin, "%d%d%d", &a, &b, &c);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 14532 KB Output is correct
2 Correct 404 ms 14860 KB Output is correct
3 Correct 410 ms 17752 KB Output is correct
4 Correct 364 ms 13572 KB Output is correct
5 Correct 365 ms 14684 KB Output is correct
6 Correct 381 ms 14500 KB Output is correct
7 Correct 385 ms 14808 KB Output is correct
8 Correct 390 ms 14860 KB Output is correct
9 Correct 333 ms 13028 KB Output is correct
10 Correct 326 ms 13020 KB Output is correct
11 Correct 164 ms 13432 KB Output is correct
12 Correct 378 ms 13124 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 16076 KB Output is correct
2 Correct 424 ms 16256 KB Output is correct
3 Correct 392 ms 16132 KB Output is correct
4 Correct 385 ms 19532 KB Output is correct
5 Correct 417 ms 20008 KB Output is correct
6 Correct 412 ms 21248 KB Output is correct
7 Correct 401 ms 21204 KB Output is correct
8 Correct 408 ms 19628 KB Output is correct
9 Correct 395 ms 19960 KB Output is correct
10 Correct 461 ms 19568 KB Output is correct
11 Correct 176 ms 16484 KB Output is correct
12 Correct 467 ms 21636 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3328 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 5 ms 2688 KB Output is correct
4 Correct 21 ms 4736 KB Output is correct
5 Correct 15 ms 3840 KB Output is correct
6 Correct 6 ms 2816 KB Output is correct
7 Correct 5 ms 2816 KB Output is correct
8 Correct 7 ms 2944 KB Output is correct
9 Correct 7 ms 2860 KB Output is correct
10 Correct 14 ms 3840 KB Output is correct
11 Correct 5 ms 2688 KB Output is correct
12 Correct 5 ms 2688 KB Output is correct
13 Correct 5 ms 2816 KB Output is correct
14 Correct 6 ms 2816 KB Output is correct
15 Correct 5 ms 2816 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 14532 KB Output is correct
2 Correct 404 ms 14860 KB Output is correct
3 Correct 410 ms 17752 KB Output is correct
4 Correct 364 ms 13572 KB Output is correct
5 Correct 365 ms 14684 KB Output is correct
6 Correct 381 ms 14500 KB Output is correct
7 Correct 385 ms 14808 KB Output is correct
8 Correct 390 ms 14860 KB Output is correct
9 Correct 333 ms 13028 KB Output is correct
10 Correct 326 ms 13020 KB Output is correct
11 Correct 164 ms 13432 KB Output is correct
12 Correct 378 ms 13124 KB Output is correct
13 Correct 391 ms 16076 KB Output is correct
14 Correct 424 ms 16256 KB Output is correct
15 Correct 392 ms 16132 KB Output is correct
16 Correct 385 ms 19532 KB Output is correct
17 Correct 417 ms 20008 KB Output is correct
18 Correct 412 ms 21248 KB Output is correct
19 Correct 401 ms 21204 KB Output is correct
20 Correct 408 ms 19628 KB Output is correct
21 Correct 395 ms 19960 KB Output is correct
22 Correct 461 ms 19568 KB Output is correct
23 Correct 176 ms 16484 KB Output is correct
24 Correct 467 ms 21636 KB Output is correct
25 Correct 19 ms 3328 KB Output is correct
26 Correct 4 ms 2688 KB Output is correct
27 Correct 5 ms 2688 KB Output is correct
28 Correct 21 ms 4736 KB Output is correct
29 Correct 15 ms 3840 KB Output is correct
30 Correct 6 ms 2816 KB Output is correct
31 Correct 5 ms 2816 KB Output is correct
32 Correct 7 ms 2944 KB Output is correct
33 Correct 7 ms 2860 KB Output is correct
34 Correct 14 ms 3840 KB Output is correct
35 Correct 5 ms 2688 KB Output is correct
36 Correct 5 ms 2688 KB Output is correct
37 Correct 5 ms 2816 KB Output is correct
38 Correct 6 ms 2816 KB Output is correct
39 Correct 5 ms 2816 KB Output is correct
40 Correct 352 ms 18680 KB Output is correct
41 Correct 367 ms 17612 KB Output is correct
42 Correct 397 ms 17700 KB Output is correct
43 Correct 196 ms 15864 KB Output is correct
44 Correct 203 ms 15984 KB Output is correct
45 Correct 405 ms 18240 KB Output is correct
46 Correct 401 ms 18032 KB Output is correct
47 Correct 380 ms 17640 KB Output is correct
48 Correct 239 ms 13816 KB Output is correct
49 Correct 331 ms 18332 KB Output is correct
50 Correct 399 ms 18152 KB Output is correct
51 Correct 415 ms 18296 KB Output is correct