oj.uz

Submission #488239

# Submission time Handle Problem Language Result Execution time Memory
488239 2021-11-18T09:17:26 Z levsog2004 Evacuation plan (IZhO18_plan) C++14
35 / 100
 4000 ms 71896 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef  int  ll;
#define all(x) x.begin(),x.end()
#define al(a,n)  (a,a+n)
#define se second
#define fr first
#define m_p make_pair
const ll N = 100005;
const ll mod = 1000 * 1000 * 1000 + 7;
const ll inf = 1000000009;
ll n, m, k, z, t, x, y, ans, pat, a[N],c[N],dist[N],color[N];
vector<pair<ll, ll>> g[N];
map <ll, ll> mp[N];
pair<ll, ll> p;
void dfs(int v, int u, int pow)
{
	if (v == y)
	{
		pat = max(pat, pow);
		return;
	}	color[v] = pow;

	for (int i = 0; i < g[v].size(); ++i)
	{
		if (g[v][i].first != u && color[g[v][i].first]<pow)
		{
			dfs(g[v][i].first, v, min(pow, dist[g[v][i].first]));
		}
	}

}
int main()
{
	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		cin >> x >> y >> z;
		mp[x][y] = 1;
		mp[y][x] = 1;
		g[x].push_back({ y,z });
		g[y].push_back({ x,z });

	}
	cin >> k;
	priority_queue<pair<ll, ll>> q;
	for (int i = 0; i <= n; ++i)
		dist[i] = inf;
	for (int i = 0; i < k; ++i)
	{
		cin >> a[i];
		q.push({ 0,a[i] });
		dist[a[i]] = 0;
		c[a[i]] = 1;
	}
	while (q.size() > 0)
	{
		p = q.top();
		q.pop();
		x = p.first*-1;
		y = p.second;
		for (int i = 0; i < g[y].size(); ++i)
		{
			if (dist[g[y][i].first] > x + g[y][i].second)
			{
				q.push({-1*(x+g[y][i].second),g[y][i].first});
				dist[g[y][i].first] = x + g[y][i].second;
			}
		}
	}
	cin >> ans;
	for (int i = 0; i < ans; ++i)
	{
		cin >> x >> y;
		if (mp[x][y]!=1)
		{
			pat = -1;
			for (int j = 0; j <= n; ++j)
			{
				color[j] = -1;
			}
			color[x] = 1;
			dfs(x, x, dist[x]);
			cout << pat << endl;
		}
		else
			cout << min(dist[x], dist[y]) << endl;

	}
	return 0;
}

Compilation message

plan.cpp: In function 'void dfs(int, int, int)':
plan.cpp:37:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i = 0; i < g[v].size(); ++i)
      |                  ~~^~~~~~~~~~~~~
plan.cpp: In function 'int main()':
plan.cpp:75:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for (int i = 0; i < g[y].size(); ++i)
      |                   ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7244 KB Output is correct
2 Correct 8 ms 7500 KB Output is correct
3 Correct 6 ms 7500 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 7 ms 7500 KB Output is correct
6 Correct 6 ms 7500 KB Output is correct
7 Correct 3 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 7 ms 7500 KB Output is correct
10 Correct 7 ms 7500 KB Output is correct
11 Correct 6 ms 7500 KB Output is correct
12 Correct 6 ms 7500 KB Output is correct
13 Correct 7 ms 7500 KB Output is correct
14 Correct 6 ms 7500 KB Output is correct
15 Correct 6 ms 7500 KB Output is correct
16 Correct 366 ms 21548 KB Output is correct
17 Correct 1333 ms 71588 KB Output is correct
18 Correct 71 ms 12868 KB Output is correct
19 Correct 418 ms 22624 KB Output is correct
20 Correct 1328 ms 71488 KB Output is correct
21 Correct 605 ms 35460 KB Output is correct
22 Correct 339 ms 21196 KB Output is correct
23 Correct 1336 ms 71528 KB Output is correct
24 Correct 1336 ms 71884 KB Output is correct
25 Correct 1352 ms 71896 KB Output is correct
26 Correct 416 ms 23084 KB Output is correct
27 Correct 445 ms 22644 KB Output is correct
28 Correct 428 ms 22848 KB Output is correct
29 Correct 420 ms 22580 KB Output is correct
30 Correct 415 ms 22580 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7368 KB Output is correct
2 Correct 4 ms 7376 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 4 ms 7376 KB Output is correct
7 Correct 4 ms 7376 KB Output is correct
8 Correct 4 ms 7376 KB Output is correct
9 Correct 4 ms 7376 KB Output is correct
10 Correct 4 ms 7352 KB Output is correct

Subtask #4
0 / 19.0

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

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7244 KB Output is correct
2 Correct 8 ms 7500 KB Output is correct
3 Correct 6 ms 7500 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 7 ms 7500 KB Output is correct
6 Correct 6 ms 7500 KB Output is correct
7 Correct 3 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 7 ms 7500 KB Output is correct
10 Correct 7 ms 7500 KB Output is correct
11 Correct 6 ms 7500 KB Output is correct
12 Correct 6 ms 7500 KB Output is correct
13 Correct 7 ms 7500 KB Output is correct
14 Correct 6 ms 7500 KB Output is correct
15 Correct 6 ms 7500 KB Output is correct
16 Correct 366 ms 21548 KB Output is correct
17 Correct 1333 ms 71588 KB Output is correct
18 Correct 71 ms 12868 KB Output is correct
19 Correct 418 ms 22624 KB Output is correct
20 Correct 1328 ms 71488 KB Output is correct
21 Correct 605 ms 35460 KB Output is correct
22 Correct 339 ms 21196 KB Output is correct
23 Correct 1336 ms 71528 KB Output is correct
24 Correct 1336 ms 71884 KB Output is correct
25 Correct 1352 ms 71896 KB Output is correct
26 Correct 416 ms 23084 KB Output is correct
27 Correct 445 ms 22644 KB Output is correct
28 Correct 428 ms 22848 KB Output is correct
29 Correct 420 ms 22580 KB Output is correct
30 Correct 415 ms 22580 KB Output is correct
31 Correct 4 ms 7368 KB Output is correct
32 Correct 4 ms 7376 KB Output is correct
33 Correct 4 ms 7376 KB Output is correct
34 Correct 4 ms 7376 KB Output is correct
35 Correct 4 ms 7376 KB Output is correct
36 Correct 4 ms 7376 KB Output is correct
37 Correct 4 ms 7376 KB Output is correct
38 Correct 4 ms 7376 KB Output is correct
39 Correct 4 ms 7376 KB Output is correct
40 Correct 4 ms 7352 KB Output is correct
41 Execution timed out 4083 ms 38244 KB Time limit exceeded
42 Halted 0 ms 0 KB -