oj.uz

Submission #59015

# Submission time Handle Problem Language Result Execution time Memory
59015 2018-07-20T06:39:19 Z YaDon4ick Commuter Pass (JOI18_commuter_pass) C++14
24 / 100
 2000 ms 22604 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;
	set < pair < ll, int > > st;
	for (int v = 0; v < n; v++)	
		st.insert({d[v], v});
	while(!st.empty())
	{
		pair < ll, int > p = *st.begin();
		st.erase(p);
		int v = p.second;
		for (auto e : g[v])
		{
			int to = e.first, cost = e.second;
			if (d[to] > d[v] + cost)
			{
				st.erase({d[to], to});
				d[to] = d[v] + cost;
				st.insert({d[to], to});
			}
		}
	}
	return d;	
}

ll sol(int s, int t)
{
	vector < ll > d3 = dijkstra(s), d4 = dijkstra(t);
	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);
	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), sol(t2, s2)) << endl;

	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:96: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:101: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
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2047 ms 22456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2037 ms 22604 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 22604 KB Output is correct
2 Correct 7 ms 22604 KB Output is correct
3 Correct 7 ms 22604 KB Output is correct
4 Correct 45 ms 22604 KB Output is correct
5 Correct 22 ms 22604 KB Output is correct
6 Correct 8 ms 22604 KB Output is correct
7 Correct 7 ms 22604 KB Output is correct
8 Correct 7 ms 22604 KB Output is correct
9 Correct 6 ms 22604 KB Output is correct
10 Correct 15 ms 22604 KB Output is correct
11 Correct 5 ms 22604 KB Output is correct
12 Correct 8 ms 22604 KB Output is correct
13 Correct 6 ms 22604 KB Output is correct
14 Correct 6 ms 22604 KB Output is correct
15 Correct 6 ms 22604 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2047 ms 22456 KB Time limit exceeded
2 Halted 0 ms 0 KB -