oj.uz

답안 #1114114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114114 2024-11-18T08:05:33 Z raspy Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 839 ms 107092 KB 
#include <bits/stdc++.h>
 
#define int long long
#define vi vector<int>
#define ii pair<int, int>
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define P 31
#define mod 1'000'000'007
#define inf 1'000'000'000'000
#define pb push_back
#define str string
#define sz(x) (x).size()
#define vvi vector<vi>
#define fun function
#define oopt cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define file freopen("problemname.in", "r", stdin); freopen("pr.out", "w", stdout);
#define dbg(v) cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
 
using namespace std;
template <class T, int SZ> using arr = array<T, SZ>;
 
int b[30001];
int power[30001];
set<int> pravi[30001];
vector<ii> graf[30001];
int ob[30001];
int obp[201][30001];

void solve()
{
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < 30001; i++)
	{
		ob[i] = inf;
		for (int j = 0; j < 201; j++)
			obp[j][i] = inf;
	}
	for (int i = 0; i < m; i++)
	{
		cin >> b[i] >> power[i];
		if (power[i] > 200)
		{
			for (int j = 1; j*j <= n; j++)
			{
				if (b[i]+power[i]*j < n)
					graf[b[i]].pb({b[i]+power[i]*j, j});
				if (b[i]-power[i]*j >= 0)
					graf[b[i]].pb({b[i]-power[i]*j, j});
			}
		}
		else
		{
			pravi[b[i]].insert(power[i]);
		}
	}
	priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> pq;
	if (power[0] > 200)
	{
		pq.push({0, b[0], -1});
		ob[b[0]] = 0;
	}
	else
	{
		pq.push({0, b[0], power[0]});
		obp[power[0]][b[0]] = 0;
	}
	while (pq.size())
	{
		auto [d, pos, pow] = pq.top();
		pq.pop();
		if (pos == b[1])
		{
			cout << d << "\n";
			return;
		}
		if (pow > 200 || pow == -1)
		{
			if (ob[pos] < d) continue;
			for (auto [p, w] : graf[pos])
			{
				if (ob[p] > d+w)
				{
					ob[p] = d+w;
					pq.push({d+w, p, -1});
				}
			}
			for (int p : pravi[pos])
			{
				if (obp[p][pos] > d)
				{
					obp[p][pos] = d;
					pq.push({d, pos, p});
				}
			}
		}
		else
		{
			if (obp[pow][pos] < d) continue;
			if (pos-pow >= 0 && obp[pow][pos-pow] > d+1)
			{
				obp[pow][pos-pow] = d+1;
				pq.push({d+1, pos-pow, pow});
			}
			if (pos+pow < n && obp[pow][pos+pow] > d+1)
			{
				obp[pow][pos+pow] = d+1;
				pq.push({d+1, pos+pow, pow});
			}
			if (ob[pos] > d)
			{
				ob[pos] = d;
				pq.push({d, pos, -1});
			}
			for (int p : pravi[pos])
			{
				if (obp[p][pos] > d)
				{
					obp[p][pos] = d;
					pq.push({d, pos, p});
				}
			}
		}
	}
	cout << -1 << "\n";
}

signed main()
{
	oopt;
	int t = 1;
	// cin >> t;
	while (t--)
		solve();
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 50000 KB Output is correct
2 Correct 10 ms 50000 KB Output is correct
3 Correct 14 ms 50000 KB Output is correct
4 Correct 12 ms 50000 KB Output is correct
5 Correct 20 ms 50000 KB Output is correct
6 Correct 23 ms 50000 KB Output is correct
7 Correct 32 ms 49992 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 50172 KB Output is correct
2 Correct 23 ms 50000 KB Output is correct
3 Correct 26 ms 50000 KB Output is correct
4 Correct 21 ms 49968 KB Output is correct
5 Correct 23 ms 50000 KB Output is correct
6 Correct 26 ms 50000 KB Output is correct
7 Correct 22 ms 50000 KB Output is correct
8 Correct 22 ms 49932 KB Output is correct
9 Correct 20 ms 50000 KB Output is correct
10 Correct 21 ms 50000 KB Output is correct
11 Correct 29 ms 49992 KB Output is correct
12 Correct 22 ms 50000 KB Output is correct
13 Correct 27 ms 49884 KB Output is correct
14 Correct 28 ms 50004 KB Output is correct
15 Correct 28 ms 50000 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 50000 KB Output is correct
2 Correct 22 ms 50000 KB Output is correct
3 Correct 22 ms 50000 KB Output is correct
4 Correct 17 ms 50000 KB Output is correct
5 Correct 24 ms 50000 KB Output is correct
6 Correct 20 ms 49992 KB Output is correct
7 Correct 27 ms 49840 KB Output is correct
8 Correct 21 ms 50000 KB Output is correct
9 Correct 19 ms 50000 KB Output is correct
10 Correct 22 ms 50000 KB Output is correct
11 Correct 20 ms 50044 KB Output is correct
12 Correct 20 ms 50000 KB Output is correct
13 Correct 17 ms 50000 KB Output is correct
14 Correct 18 ms 50000 KB Output is correct
15 Correct 21 ms 50160 KB Output is correct
16 Correct 21 ms 50020 KB Output is correct
17 Correct 22 ms 50000 KB Output is correct
18 Correct 25 ms 50008 KB Output is correct
19 Correct 24 ms 50000 KB Output is correct
20 Correct 25 ms 50012 KB Output is correct
21 Correct 25 ms 49964 KB Output is correct
22 Correct 20 ms 50000 KB Output is correct
23 Correct 28 ms 49852 KB Output is correct
24 Correct 32 ms 50000 KB Output is correct
25 Correct 28 ms 49912 KB Output is correct
26 Correct 28 ms 50064 KB Output is correct
27 Correct 28 ms 50000 KB Output is correct
28 Correct 25 ms 50168 KB Output is correct
29 Correct 29 ms 50000 KB Output is correct
30 Correct 23 ms 50168 KB Output is correct
31 Correct 21 ms 50000 KB Output is correct
32 Correct 24 ms 50000 KB Output is correct
33 Correct 31 ms 50000 KB Output is correct
34 Correct 26 ms 50000 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 50000 KB Output is correct
2 Correct 22 ms 49800 KB Output is correct
3 Correct 27 ms 49860 KB Output is correct
4 Correct 26 ms 49992 KB Output is correct
5 Correct 27 ms 50000 KB Output is correct
6 Correct 27 ms 49992 KB Output is correct
7 Correct 33 ms 50000 KB Output is correct
8 Correct 29 ms 50000 KB Output is correct
9 Correct 25 ms 49804 KB Output is correct
10 Correct 28 ms 50000 KB Output is correct
11 Correct 29 ms 50000 KB Output is correct
12 Correct 20 ms 50000 KB Output is correct
13 Correct 21 ms 50012 KB Output is correct
14 Correct 25 ms 50000 KB Output is correct
15 Correct 25 ms 50000 KB Output is correct
16 Correct 26 ms 50000 KB Output is correct
17 Correct 27 ms 49996 KB Output is correct
18 Correct 23 ms 50000 KB Output is correct
19 Correct 22 ms 49992 KB Output is correct
20 Correct 28 ms 49992 KB Output is correct
21 Correct 28 ms 50036 KB Output is correct
22 Correct 31 ms 49992 KB Output is correct
23 Correct 28 ms 50000 KB Output is correct
24 Correct 26 ms 49992 KB Output is correct
25 Correct 27 ms 50032 KB Output is correct
26 Correct 23 ms 49992 KB Output is correct
27 Correct 27 ms 50000 KB Output is correct
28 Correct 28 ms 49992 KB Output is correct
29 Correct 31 ms 50000 KB Output is correct
30 Correct 31 ms 50000 KB Output is correct
31 Correct 29 ms 49972 KB Output is correct
32 Correct 25 ms 49872 KB Output is correct
33 Correct 41 ms 50004 KB Output is correct
34 Correct 32 ms 49992 KB Output is correct
35 Correct 33 ms 51240 KB Output is correct
36 Correct 29 ms 50012 KB Output is correct
37 Correct 35 ms 51916 KB Output is correct
38 Correct 35 ms 51784 KB Output is correct
39 Correct 29 ms 51536 KB Output is correct
40 Correct 30 ms 51528 KB Output is correct
41 Correct 31 ms 51784 KB Output is correct
42 Correct 28 ms 50436 KB Output is correct
43 Correct 29 ms 50484 KB Output is correct
44 Correct 31 ms 50512 KB Output is correct
45 Correct 116 ms 54088 KB Output is correct
46 Correct 89 ms 54360 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 50000 KB Output is correct
2 Correct 22 ms 50000 KB Output is correct
3 Correct 26 ms 49992 KB Output is correct
4 Correct 30 ms 49888 KB Output is correct
5 Correct 28 ms 49992 KB Output is correct
6 Correct 25 ms 49992 KB Output is correct
7 Correct 24 ms 50000 KB Output is correct
8 Correct 23 ms 50000 KB Output is correct
9 Correct 29 ms 49992 KB Output is correct
10 Correct 23 ms 50000 KB Output is correct
11 Correct 24 ms 50000 KB Output is correct
12 Correct 23 ms 49876 KB Output is correct
13 Correct 23 ms 50016 KB Output is correct
14 Correct 27 ms 50232 KB Output is correct
15 Correct 26 ms 49992 KB Output is correct
16 Correct 19 ms 50000 KB Output is correct
17 Correct 23 ms 50000 KB Output is correct
18 Correct 21 ms 50000 KB Output is correct
19 Correct 17 ms 49924 KB Output is correct
20 Correct 24 ms 50168 KB Output is correct
21 Correct 24 ms 50000 KB Output is correct
22 Correct 20 ms 49860 KB Output is correct
23 Correct 21 ms 50172 KB Output is correct
24 Correct 20 ms 50144 KB Output is correct
25 Correct 11 ms 50064 KB Output is correct
26 Correct 13 ms 50016 KB Output is correct
27 Correct 14 ms 50000 KB Output is correct
28 Correct 17 ms 50000 KB Output is correct
29 Correct 32 ms 50000 KB Output is correct
30 Correct 23 ms 49816 KB Output is correct
31 Correct 19 ms 50000 KB Output is correct
32 Correct 16 ms 50000 KB Output is correct
33 Correct 33 ms 50000 KB Output is correct
34 Correct 26 ms 50192 KB Output is correct
35 Correct 27 ms 51536 KB Output is correct
36 Correct 20 ms 50000 KB Output is correct
37 Correct 33 ms 51792 KB Output is correct
38 Correct 31 ms 51764 KB Output is correct
39 Correct 31 ms 51460 KB Output is correct
40 Correct 34 ms 51736 KB Output is correct
41 Correct 32 ms 52040 KB Output is correct
42 Correct 26 ms 50256 KB Output is correct
43 Correct 34 ms 50256 KB Output is correct
44 Correct 30 ms 50520 KB Output is correct
45 Correct 105 ms 54088 KB Output is correct
46 Correct 89 ms 54096 KB Output is correct
47 Correct 41 ms 58080 KB Output is correct
48 Correct 34 ms 52340 KB Output is correct
49 Correct 34 ms 52148 KB Output is correct
50 Correct 33 ms 51536 KB Output is correct
51 Correct 45 ms 54092 KB Output is correct
52 Correct 40 ms 54084 KB Output is correct
53 Correct 34 ms 50504 KB Output is correct
54 Correct 29 ms 50000 KB Output is correct
55 Correct 27 ms 49992 KB Output is correct
56 Correct 34 ms 51740 KB Output is correct
57 Correct 25 ms 49992 KB Output is correct
58 Correct 28 ms 50512 KB Output is correct
59 Correct 25 ms 50256 KB Output is correct
60 Correct 29 ms 50760 KB Output is correct
61 Correct 31 ms 50764 KB Output is correct
62 Correct 49 ms 54600 KB Output is correct
63 Correct 103 ms 98812 KB Output is correct
64 Correct 123 ms 107092 KB Output is correct
65 Correct 328 ms 100452 KB Output is correct
66 Correct 839 ms 82480 KB Output is correct
67 Correct 493 ms 82684 KB Output is correct