oj.uz

답안 #874607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874607 2023-11-17T11:33:21 Z h4d1 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 1108 KB 
#include<bits/stdc++.h>
using namespace std;
const int inf = 2e9;

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int n, m;
	scanf("%d%d", &n, &m);
	pair<int, int> a[m];
	for(int i = 0; i < m; i++)
	{
		scanf("%d%d", &a[i].first, &a[i].second);
	}
	int s = a[0].first, t = a[1].first, adj[n];
	fill(adj, adj+n, m);
	sort(a, a+m);
	for(int i = 0; i < m; i++)
	{
		if(!i)
		{
			adj[a[i].first] = i;
		}
		else if(a[i].first != a[i-1].first)
		{
			adj[a[i].first] = i;
		}
	}

	int d[n];
	fill(d, d+n, inf);
	priority_queue<pair<int, int>> pq;
	pq.push({d[s]=0, s});
	while(pq.size())
	{
		int v = pq.top().second;
		pq.pop();
		for(int i = adj[v]; ((i < m)&&(a[i].first == v)); i++)
		{
			int j = a[i].second, x = 0;
			while((v+(x*j) < n) || (v-(x*j) >= 0))
			{
				if((v+(x*j) < n) && (d[v+(x*j)] > d[v]+x))
				{
					pq.push({d[v+(x*j)] = d[v]+x, v+(x*j)});
				}
				if((v-(x*j) >= 0) && (d[v-(x*j)] > d[v]+x))
				{
					pq.push({d[v-(x*j)] = d[v]+x, v-(x*j)});
				}
				x++;
			}
		}
	}
	printf("%d\n", d[t] != 2e9 ? d[t] : -1);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |   scanf("%d%d", &a[i].first, &a[i].second);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 412 KB Output is correct
17 Correct 19 ms 488 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 28 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 6 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 552 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 20 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 26 ms 348 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 536 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 154 ms 684 KB Output is correct
36 Correct 29 ms 348 KB Output is correct
37 Correct 94 ms 720 KB Output is correct
38 Correct 297 ms 852 KB Output is correct
39 Correct 284 ms 800 KB Output is correct
40 Correct 191 ms 1108 KB Output is correct
41 Correct 38 ms 860 KB Output is correct
42 Correct 60 ms 604 KB Output is correct
43 Correct 56 ms 604 KB Output is correct
44 Correct 60 ms 604 KB Output is correct
45 Correct 10 ms 860 KB Output is correct
46 Correct 11 ms 688 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 476 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 20 ms 488 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 5 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 4 ms 484 KB Output is correct
24 Correct 26 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 6 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 158 ms 700 KB Output is correct
36 Correct 29 ms 348 KB Output is correct
37 Correct 87 ms 604 KB Output is correct
38 Correct 292 ms 796 KB Output is correct
39 Correct 282 ms 732 KB Output is correct
40 Correct 192 ms 712 KB Output is correct
41 Correct 37 ms 756 KB Output is correct
42 Correct 59 ms 720 KB Output is correct
43 Correct 56 ms 704 KB Output is correct
44 Correct 60 ms 708 KB Output is correct
45 Correct 10 ms 860 KB Output is correct
46 Correct 10 ms 692 KB Output is correct
47 Execution timed out 1006 ms 856 KB Time limit exceeded
48 Halted 0 ms 0 KB -