oj.uz

Submission #517030

# Submission time Handle Problem Language Result Execution time Memory
517030 2022-01-22T11:55:41 Z Drew_ Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 91 ms 52128 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second

#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cerr << "[" << #x << "]: " << x << "\n";

using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using pl = pair<ll, ll>;

constexpr ld PI = 4*atan((ld)1);
constexpr int MAX = 30069;
constexpr int SQ = 200;	
constexpr int inf = 1e9 + 69;

int n, m;
int cost[MAX][SQ];

int b[MAX], p[MAX];
vector<int> adj[MAX];	

int main()
{
	fastio;

	for (int i = 0; i < MAX; ++i)
		for (int j = 0; j < SQ; ++j)
			cost[i][j] = inf;

	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		cin >> b[i] >> p[i];
		adj[b[i]].pb(p[i]);
	}

	const auto valid = [&](int pos) -> bool
	{
		return 0 <= pos && pos < n;
	};

	priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> pq;
	
	cost[b[0]][0] = 0;
	if (p[0] < SQ)
		cost[b[0]][p[0]] = 0;

	pq.push({0, b[0], p[0]});

	while (!pq.empty())
	{
		auto [c, pos, mov] = pq.top();
		pq.pop();

		if (cost[pos][mov] < c)
			continue;

		if (mov < SQ)
		{		
			if (cost[pos][0] > cost[pos][mov])
				cost[pos][0] = cost[pos][mov];
			if (valid(pos - mov) && cost[pos - mov][mov] > 1 + c)
				cost[pos - mov][mov] = 1 + c, pq.push({1 + c, pos - mov, mov});
			if (valid(pos + mov) && cost[pos + mov][mov] > 1 + c)
				cost[pos + mov][mov] = 1 + c, pq.push({1 + c, pos + mov, mov});
		}


		for (int x : adj[pos])
		{
			if (x < SQ)
			{
				if (valid(pos - x) && cost[pos - x][x] > 1 + c)
					cost[pos - x][x] = 1 + c, pq.push({1 + c, pos - x, x});
				if (valid(pos + x) && cost[pos + x] > 1 + cost[pos])
					cost[pos + x][x] = 1 + c, pq.push({1 + c, pos + x, x});
			}
			else
			{
				for (int i = pos, ctr = c; i >= 0; i -= x, ++ctr)
				{
					if (cost[i][0] > ctr)
						cost[i][0] = ctr, pq.push({ctr, i, x});
				}
				for (int i = pos, ctr = c; i < n; i += x, ++ctr)
				{
					if (cost[i][0] > ctr)
						cost[i][0] = ctr, pq.push({ctr, i, x});
				}
			}
		}
		adj[pos].clear();
	}

	// for (int i = 0; i < n; ++i)
	// 	cerr << cost[i] << " \n"[i == n-1];

	cout << (cost[b[1]][0] == inf ? -1 : cost[b[1]][0]) << '\n';

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24464 KB Output is correct
2 Correct 12 ms 24524 KB Output is correct
3 Correct 12 ms 24452 KB Output is correct
4 Correct 11 ms 24508 KB Output is correct
5 Correct 12 ms 24512 KB Output is correct
6 Correct 13 ms 24524 KB Output is correct
7 Correct 11 ms 24524 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24524 KB Output is correct
2 Correct 11 ms 24524 KB Output is correct
3 Correct 11 ms 24456 KB Output is correct
4 Correct 11 ms 24544 KB Output is correct
5 Correct 13 ms 24524 KB Output is correct
6 Correct 12 ms 24556 KB Output is correct
7 Correct 11 ms 24484 KB Output is correct
8 Correct 12 ms 24524 KB Output is correct
9 Correct 11 ms 24524 KB Output is correct
10 Correct 12 ms 24488 KB Output is correct
11 Correct 13 ms 24608 KB Output is correct
12 Correct 13 ms 24652 KB Output is correct
13 Correct 13 ms 24560 KB Output is correct
14 Correct 13 ms 24652 KB Output is correct
15 Correct 12 ms 24684 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24532 KB Output is correct
2 Correct 12 ms 24524 KB Output is correct
3 Correct 12 ms 24536 KB Output is correct
4 Correct 11 ms 24548 KB Output is correct
5 Correct 13 ms 24548 KB Output is correct
6 Correct 12 ms 24524 KB Output is correct
7 Correct 12 ms 24496 KB Output is correct
8 Correct 12 ms 24496 KB Output is correct
9 Correct 13 ms 24524 KB Output is correct
10 Correct 16 ms 24512 KB Output is correct
11 Correct 14 ms 24568 KB Output is correct
12 Correct 13 ms 24652 KB Output is correct
13 Correct 13 ms 24568 KB Output is correct
14 Correct 13 ms 24568 KB Output is correct
15 Correct 13 ms 24652 KB Output is correct
16 Correct 12 ms 24472 KB Output is correct
17 Correct 19 ms 24568 KB Output is correct
18 Correct 13 ms 24564 KB Output is correct
19 Correct 11 ms 24524 KB Output is correct
20 Correct 12 ms 24572 KB Output is correct
21 Correct 12 ms 24588 KB Output is correct
22 Correct 12 ms 24560 KB Output is correct
23 Correct 13 ms 24560 KB Output is correct
24 Correct 14 ms 24572 KB Output is correct
25 Correct 13 ms 24552 KB Output is correct
26 Correct 13 ms 24652 KB Output is correct
27 Correct 13 ms 24552 KB Output is correct
28 Correct 13 ms 24652 KB Output is correct
29 Correct 18 ms 24524 KB Output is correct
30 Correct 25 ms 24524 KB Output is correct
31 Correct 15 ms 24524 KB Output is correct
32 Correct 14 ms 24524 KB Output is correct
33 Correct 26 ms 24696 KB Output is correct
34 Correct 25 ms 24696 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24524 KB Output is correct
2 Correct 12 ms 24524 KB Output is correct
3 Correct 13 ms 24504 KB Output is correct
4 Correct 12 ms 24540 KB Output is correct
5 Correct 12 ms 24560 KB Output is correct
6 Correct 12 ms 24524 KB Output is correct
7 Correct 12 ms 24560 KB Output is correct
8 Correct 12 ms 24524 KB Output is correct
9 Correct 11 ms 24524 KB Output is correct
10 Correct 14 ms 24524 KB Output is correct
11 Correct 14 ms 24568 KB Output is correct
12 Correct 12 ms 24560 KB Output is correct
13 Correct 13 ms 24652 KB Output is correct
14 Correct 12 ms 24552 KB Output is correct
15 Correct 13 ms 24628 KB Output is correct
16 Correct 12 ms 24560 KB Output is correct
17 Correct 13 ms 24644 KB Output is correct
18 Correct 12 ms 24524 KB Output is correct
19 Correct 11 ms 24524 KB Output is correct
20 Correct 12 ms 24572 KB Output is correct
21 Correct 11 ms 24564 KB Output is correct
22 Correct 12 ms 24564 KB Output is correct
23 Correct 12 ms 24564 KB Output is correct
24 Correct 16 ms 24652 KB Output is correct
25 Correct 13 ms 24524 KB Output is correct
26 Correct 13 ms 24652 KB Output is correct
27 Correct 13 ms 24652 KB Output is correct
28 Correct 14 ms 24620 KB Output is correct
29 Correct 18 ms 24524 KB Output is correct
30 Correct 13 ms 24524 KB Output is correct
31 Correct 16 ms 24560 KB Output is correct
32 Correct 14 ms 24544 KB Output is correct
33 Correct 28 ms 24652 KB Output is correct
34 Correct 25 ms 24696 KB Output is correct
35 Correct 24 ms 25292 KB Output is correct
36 Correct 14 ms 24652 KB Output is correct
37 Correct 31 ms 25308 KB Output is correct
38 Correct 30 ms 25400 KB Output is correct
39 Correct 30 ms 25412 KB Output is correct
40 Correct 35 ms 25420 KB Output is correct
41 Correct 30 ms 25472 KB Output is correct
42 Correct 19 ms 25652 KB Output is correct
43 Correct 19 ms 25676 KB Output is correct
44 Correct 19 ms 25704 KB Output is correct
45 Correct 74 ms 26084 KB Output is correct
46 Correct 77 ms 26056 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24512 KB Output is correct
2 Correct 11 ms 24468 KB Output is correct
3 Correct 12 ms 24520 KB Output is correct
4 Correct 14 ms 24524 KB Output is correct
5 Correct 12 ms 24524 KB Output is correct
6 Correct 15 ms 24568 KB Output is correct
7 Correct 12 ms 24556 KB Output is correct
8 Correct 14 ms 24524 KB Output is correct
9 Correct 12 ms 24476 KB Output is correct
10 Correct 14 ms 24548 KB Output is correct
11 Correct 12 ms 24536 KB Output is correct
12 Correct 13 ms 24524 KB Output is correct
13 Correct 12 ms 24564 KB Output is correct
14 Correct 13 ms 24696 KB Output is correct
15 Correct 14 ms 24652 KB Output is correct
16 Correct 14 ms 24544 KB Output is correct
17 Correct 14 ms 24588 KB Output is correct
18 Correct 14 ms 24524 KB Output is correct
19 Correct 13 ms 24480 KB Output is correct
20 Correct 12 ms 24652 KB Output is correct
21 Correct 12 ms 24548 KB Output is correct
22 Correct 14 ms 24612 KB Output is correct
23 Correct 13 ms 24564 KB Output is correct
24 Correct 14 ms 24568 KB Output is correct
25 Correct 12 ms 24568 KB Output is correct
26 Correct 13 ms 24652 KB Output is correct
27 Correct 13 ms 24564 KB Output is correct
28 Correct 13 ms 24600 KB Output is correct
29 Correct 18 ms 24508 KB Output is correct
30 Correct 15 ms 24584 KB Output is correct
31 Correct 15 ms 24524 KB Output is correct
32 Correct 14 ms 24524 KB Output is correct
33 Correct 25 ms 24652 KB Output is correct
34 Correct 25 ms 24652 KB Output is correct
35 Correct 25 ms 25328 KB Output is correct
36 Correct 16 ms 24624 KB Output is correct
37 Correct 32 ms 25292 KB Output is correct
38 Correct 33 ms 25472 KB Output is correct
39 Correct 30 ms 25408 KB Output is correct
40 Correct 32 ms 25464 KB Output is correct
41 Correct 30 ms 25412 KB Output is correct
42 Correct 19 ms 25668 KB Output is correct
43 Correct 18 ms 25712 KB Output is correct
44 Correct 21 ms 25696 KB Output is correct
45 Correct 81 ms 26088 KB Output is correct
46 Correct 75 ms 26056 KB Output is correct
47 Correct 91 ms 25732 KB Output is correct
48 Correct 17 ms 25340 KB Output is correct
49 Correct 16 ms 25292 KB Output is correct
50 Correct 15 ms 25088 KB Output is correct
51 Runtime error 47 ms 52128 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -