oj.uz

답안 #695123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695123 2023-02-04T18:24:59 Z Cyber_Wolf Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 229 ms 262144 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//Jakarta Skyscraper

const lg N  = 30005;

lg dist[N], in_queue[N];
vector<pair<lg, lg>> adj[N];
vector<lg> b(N), p(N);

void dijkstra(lg src)
{
	priority_queue<array<lg, 2>> pq;
	pq.push({0, src});
	in_queue[src] = 1;
	memset(dist, 0x3f, sizeof(dist));
	dist[src] = 0;
	while(pq.size())
	{
		lg x = pq.top()[1];
		in_queue[x] = 0;
		pq.pop();
		for(auto [it, c] : adj[x])
		{
			if(dist[it] > dist[x]+c)
			{
				dist[it] = dist[x]+c;
				if(!in_queue[it])	pq.push({-dist[it], it});
				in_queue[it] = true;
			}
		}
	}
	return;
}


int main()
{
	fastio;
	lg n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++)
	{
		cin >> b[i] >> p[i];
	} 
	for(int i = 0; i < m; i++)
	{
		lg x = b[i]+p[i], z = 1;
		while(x < n)
		{
			adj[b[i]].push_back({x, z});
			z++;
			x += p[i];
		}
		x = b[i]-p[i];
		z = 1;
		while(x >= 0)
		{
			adj[b[i]].push_back({x, z});
			z++;
			x -= p[i];
		}
	}
	dijkstra(b[0]);
	if(dist[b[1]] == dist[N-1])
	{
		cout << "-1\n";
		return 0;
	}
	cout << dist[b[1]] << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1732 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1744 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 6 ms 5712 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 6 ms 5712 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 2 ms 2132 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 68 ms 65928 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1876 KB Output is correct
24 Correct 2 ms 2004 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 83 ms 67520 KB Output is correct
27 Correct 80 ms 67272 KB Output is correct
28 Correct 2 ms 2132 KB Output is correct
29 Correct 3 ms 3156 KB Output is correct
30 Correct 2 ms 2132 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2260 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 4 ms 4176 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 6 ms 5712 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 2 ms 2260 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 67 ms 65972 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1876 KB Output is correct
24 Correct 2 ms 2004 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 84 ms 67516 KB Output is correct
27 Correct 82 ms 67292 KB Output is correct
28 Correct 3 ms 2132 KB Output is correct
29 Correct 2 ms 3156 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2260 KB Output is correct
33 Correct 3 ms 4308 KB Output is correct
34 Correct 4 ms 4176 KB Output is correct
35 Correct 9 ms 4820 KB Output is correct
36 Correct 2 ms 2176 KB Output is correct
37 Correct 11 ms 8192 KB Output is correct
38 Correct 10 ms 6960 KB Output is correct
39 Correct 12 ms 7296 KB Output is correct
40 Correct 10 ms 6996 KB Output is correct
41 Correct 11 ms 6760 KB Output is correct
42 Runtime error 229 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1668 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 6 ms 5708 KB Output is correct
13 Correct 5 ms 5712 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 2 ms 2132 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 69 ms 65948 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1876 KB Output is correct
24 Correct 2 ms 2004 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 84 ms 67504 KB Output is correct
27 Correct 81 ms 67240 KB Output is correct
28 Correct 2 ms 2132 KB Output is correct
29 Correct 2 ms 3156 KB Output is correct
30 Correct 2 ms 2260 KB Output is correct
31 Correct 2 ms 2516 KB Output is correct
32 Correct 2 ms 2260 KB Output is correct
33 Correct 3 ms 4308 KB Output is correct
34 Correct 4 ms 4176 KB Output is correct
35 Correct 9 ms 4720 KB Output is correct
36 Correct 3 ms 2132 KB Output is correct
37 Correct 10 ms 8276 KB Output is correct
38 Correct 11 ms 6888 KB Output is correct
39 Correct 11 ms 7268 KB Output is correct
40 Correct 11 ms 7124 KB Output is correct
41 Correct 12 ms 6868 KB Output is correct
42 Runtime error 227 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -