oj.uz

Submission #59016

# Submission time Handle Problem Language Result Execution time Memory
59016 2018-07-20T06:47:00 Z YaDon4ick Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 861 ms 28388 KB 
//By Don4ick
//#define _GLIBCXX_DEBUG

#include <bits/stdc++.h>

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;

#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qwer1234

const double PI = acos(-1.0);
const int DIR = 4;
const int X[] = {1, 0, -1, 0};
const int Y[] = {0, 1, 0, -1};

const int N = (int)1e5 + 228;
const ll INF = (ll)1e18 + 228;

using namespace std;

int n, m;
vector < pair < int, int > > g[N]; 
vector < ll > d1, d2;
vector < int > p;
ll dist;

vector < ll > dijkstra(int start)
{
	vector < ll > d(n, INF);
	d[start] = 0;
	priority_queue < pair < ll, int > > q;
	for (int v = 0; v < n; v++)	
		q.push({-d[v], v});
	vector < bool > was(n);
	while(!q.empty())
	{
		pair < ll, int > p = q.top();
		q.pop();
		int v = p.second;
	    if (was[v])
	    	continue;
		was[v] = true;
		for (auto e : g[v])
		{
			int to = e.first, cost = e.second;
			if (d[to] > d[v] + cost)
			{
				d[to] = d[v] + cost;
				q.push({-d[to], to});
			}
		}
	}
	return d;	
}

ll sol(int s, int t, const vector < ll > & d3, const vector < ll > & d4)
{
	vector < ll > dp(n, INF);
	ll res = d3[t];
	for (int i = (int)n - 1; i >= 0; i--)
	{
		int v = p[i];
		if (d1[v] + d2[v] != dist)
			continue;
		dp[v] = d4[v];
		for (auto e : g[v])
		{
			int to = e.first, cost = e.second;
			if (d1[v] + cost + d2[to] != dist)
				continue;
			dp[v] = min(dp[v], dp[to]);			
		}	
		res = min(res, dp[v] + d3[v]);
	}	
	return res;
} 

bool cmp(int x, int y)
{
	return  d1[x] < d1[y];
}

int main()
{
	//ios_base::sync_with_stdio(false);
	//cin.tie(NULL);
	//cout.tie(NULL);

	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	//~read
	int s1, t1, s2, t2;
	scanf("%d%d\n%d%d\n%d%d", &n, &m, &s1, &t1, &s2, &t2);
	s1--, t1--, s2--, t2--;
	forn(i, m)
	{
		int v, u, c;
		scanf("%d%d%d", &v, &u, &c);
		v--, u--;
		g[v].pb({u, c});
		g[u].pb({v, c});
	}
	//~solve
	d1 = dijkstra(s1), d2 = dijkstra(t1);
	vector < ll > d3 = dijkstra(s2), d4 = dijkstra(t2);
	dist = d1[t1];
	p = vector < int > (n);
	for (int i = 0; i < n; i++)
		p[i] = i;
	sort(all(p), &cmp);
	cout << min(sol(s2, t2, d3, d4), sol(t2, s2, d4, d3)) << endl;

	return 0;
}

Compilation message

commuter_pass.cpp: In function 'std::vector<long long int> dijkstra(int)':
commuter_pass.cpp:44:6: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
      if (was[v])
      ^~
commuter_pass.cpp:46:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   was[v] = true;
   ^~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d\n%d%d\n%d%d", &n, &m, &s1, &t1, &s2, &t2);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &v, &u, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 719 ms 19012 KB Output is correct
2 Correct 640 ms 22292 KB Output is correct
3 Correct 590 ms 24732 KB Output is correct
4 Correct 642 ms 25416 KB Output is correct
5 Correct 565 ms 25416 KB Output is correct
6 Correct 642 ms 25416 KB Output is correct
7 Correct 580 ms 25416 KB Output is correct
8 Correct 622 ms 25416 KB Output is correct
9 Correct 662 ms 25416 KB Output is correct
10 Correct 557 ms 25416 KB Output is correct
11 Correct 355 ms 25416 KB Output is correct
12 Correct 552 ms 25416 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 665 ms 25416 KB Output is correct
2 Correct 682 ms 27516 KB Output is correct
3 Correct 780 ms 27676 KB Output is correct
4 Correct 717 ms 27676 KB Output is correct
5 Correct 861 ms 27696 KB Output is correct
6 Correct 739 ms 27696 KB Output is correct
7 Correct 770 ms 27704 KB Output is correct
8 Correct 628 ms 27704 KB Output is correct
9 Correct 597 ms 27704 KB Output is correct
10 Correct 769 ms 27712 KB Output is correct
11 Correct 356 ms 27712 KB Output is correct
12 Correct 624 ms 27712 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27712 KB Output is correct
2 Correct 5 ms 27712 KB Output is correct
3 Correct 5 ms 27712 KB Output is correct
4 Correct 40 ms 27712 KB Output is correct
5 Correct 17 ms 27712 KB Output is correct
6 Correct 6 ms 27712 KB Output is correct
7 Correct 6 ms 27712 KB Output is correct
8 Correct 8 ms 27712 KB Output is correct
9 Correct 4 ms 27712 KB Output is correct
10 Correct 23 ms 27712 KB Output is correct
11 Correct 6 ms 27712 KB Output is correct
12 Correct 5 ms 27712 KB Output is correct
13 Correct 7 ms 27712 KB Output is correct
14 Correct 7 ms 27712 KB Output is correct
15 Correct 7 ms 27712 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 719 ms 19012 KB Output is correct
2 Correct 640 ms 22292 KB Output is correct
3 Correct 590 ms 24732 KB Output is correct
4 Correct 642 ms 25416 KB Output is correct
5 Correct 565 ms 25416 KB Output is correct
6 Correct 642 ms 25416 KB Output is correct
7 Correct 580 ms 25416 KB Output is correct
8 Correct 622 ms 25416 KB Output is correct
9 Correct 662 ms 25416 KB Output is correct
10 Correct 557 ms 25416 KB Output is correct
11 Correct 355 ms 25416 KB Output is correct
12 Correct 552 ms 25416 KB Output is correct
13 Correct 665 ms 25416 KB Output is correct
14 Correct 682 ms 27516 KB Output is correct
15 Correct 780 ms 27676 KB Output is correct
16 Correct 717 ms 27676 KB Output is correct
17 Correct 861 ms 27696 KB Output is correct
18 Correct 739 ms 27696 KB Output is correct
19 Correct 770 ms 27704 KB Output is correct
20 Correct 628 ms 27704 KB Output is correct
21 Correct 597 ms 27704 KB Output is correct
22 Correct 769 ms 27712 KB Output is correct
23 Correct 356 ms 27712 KB Output is correct
24 Correct 624 ms 27712 KB Output is correct
25 Correct 15 ms 27712 KB Output is correct
26 Correct 5 ms 27712 KB Output is correct
27 Correct 5 ms 27712 KB Output is correct
28 Correct 40 ms 27712 KB Output is correct
29 Correct 17 ms 27712 KB Output is correct
30 Correct 6 ms 27712 KB Output is correct
31 Correct 6 ms 27712 KB Output is correct
32 Correct 8 ms 27712 KB Output is correct
33 Correct 4 ms 27712 KB Output is correct
34 Correct 23 ms 27712 KB Output is correct
35 Correct 6 ms 27712 KB Output is correct
36 Correct 5 ms 27712 KB Output is correct
37 Correct 7 ms 27712 KB Output is correct
38 Correct 7 ms 27712 KB Output is correct
39 Correct 7 ms 27712 KB Output is correct
40 Correct 679 ms 28048 KB Output is correct
41 Correct 590 ms 28048 KB Output is correct
42 Correct 560 ms 28048 KB Output is correct
43 Correct 380 ms 28048 KB Output is correct
44 Correct 367 ms 28048 KB Output is correct
45 Correct 604 ms 28048 KB Output is correct
46 Correct 732 ms 28048 KB Output is correct
47 Correct 569 ms 28248 KB Output is correct
48 Correct 364 ms 28248 KB Output is correct
49 Correct 616 ms 28388 KB Output is correct
50 Correct 659 ms 28388 KB Output is correct
51 Correct 547 ms 28388 KB Output is correct