Submission #531387

# Submission time Handle Problem Language Result Execution time Memory
531387 2022-02-28T14:57:56 Z lunchbox Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
377 ms 262148 KB
#include <bits/stdc++.h>
using namespace std;

#define N	30000
#define INF	0x3f3f3f3f

vector<int> ed[N];
vector<pair<int, int>> ej[N];

bool find(int j, int d) {
	auto it = lower_bound(ed[j].begin(), ed[j].end(), d);

	return it != ed[j].end() && *it == d;
}

int main() {
	static int dd[N];
	int n, m, i, j, d, s, t;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,int>>> pq;

	scanf("%d%d", &n, &m);
	s = t = -1;
	for (i = 0; i < m; i++) {
		scanf("%d%d", &j, &d);
		if (i == 0)
			s = j;
		else if (i == 1)
			t = j;
		ed[j].push_back(d);
	}
	for (i = 0; i < n; i++)
		sort(ed[i].begin(), ed[i].end());
	for (i = 0; i < n; i++) {
		for (int d : ed[i]) {
			for (j = i + d; j < n; j += d) {
				ej[i].push_back({j, (j - i) / d});
				if (find(j, d))
					break;
			}
			for (j = i - d; j >= 0; j -= d) {
				ej[i].push_back({j, (i - j) / d});
				if (find(j, d))
					break;	
			}
		}
	}
	memset(dd, 0x3f, n * sizeof *dd);
	dd[s] = 0;
	pq.push({0, s});
	while (!pq.empty()) {
		i = pq.top().second;
		pq.pop();
		for (auto [j, w] : ej[i]) {
			d = dd[i] + w;
			if (d < dd[j]) {
				dd[j] = d;
				pq.push({d, j});
			}
		}
	}
	printf("%d\n", dd[t] == INF ? -1 : dd[t]);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf("%d%d", &j, &d);
      |   ~~~~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 2 ms 1700 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1612 KB Output is correct
7 Correct 1 ms 1612 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1612 KB Output is correct
7 Correct 1 ms 1604 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 2 ms 1612 KB Output is correct
10 Correct 1 ms 1612 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 5 ms 3904 KB Output is correct
13 Correct 1 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 1740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1612 KB Output is correct
7 Correct 1 ms 1612 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 1 ms 1612 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 5 ms 3872 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 1740 KB Output is correct
16 Correct 2 ms 1740 KB Output is correct
17 Correct 3 ms 1840 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1740 KB Output is correct
20 Correct 2 ms 1740 KB Output is correct
21 Correct 1 ms 1708 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 2 ms 1740 KB Output is correct
24 Correct 3 ms 1868 KB Output is correct
25 Correct 3 ms 1868 KB Output is correct
26 Correct 68 ms 34704 KB Output is correct
27 Correct 60 ms 34720 KB Output is correct
28 Correct 2 ms 1996 KB Output is correct
29 Correct 6 ms 2508 KB Output is correct
30 Correct 2 ms 1996 KB Output is correct
31 Correct 3 ms 2124 KB Output is correct
32 Correct 2 ms 1996 KB Output is correct
33 Correct 8 ms 3148 KB Output is correct
34 Correct 7 ms 3148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1612 KB Output is correct
7 Correct 1 ms 1612 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 5 ms 3904 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 1 ms 1740 KB Output is correct
16 Correct 1 ms 1740 KB Output is correct
17 Correct 3 ms 1848 KB Output is correct
18 Correct 2 ms 1708 KB Output is correct
19 Correct 1 ms 1740 KB Output is correct
20 Correct 2 ms 1740 KB Output is correct
21 Correct 2 ms 1740 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 2 ms 1740 KB Output is correct
24 Correct 2 ms 1844 KB Output is correct
25 Correct 3 ms 1848 KB Output is correct
26 Correct 66 ms 34720 KB Output is correct
27 Correct 64 ms 34728 KB Output is correct
28 Correct 2 ms 1996 KB Output is correct
29 Correct 4 ms 2508 KB Output is correct
30 Correct 2 ms 1948 KB Output is correct
31 Correct 3 ms 2124 KB Output is correct
32 Correct 2 ms 1996 KB Output is correct
33 Correct 6 ms 3248 KB Output is correct
34 Correct 6 ms 3148 KB Output is correct
35 Correct 10 ms 3132 KB Output is correct
36 Correct 3 ms 1868 KB Output is correct
37 Correct 11 ms 4040 KB Output is correct
38 Correct 15 ms 3916 KB Output is correct
39 Correct 14 ms 3916 KB Output is correct
40 Correct 15 ms 3848 KB Output is correct
41 Correct 14 ms 3888 KB Output is correct
42 Runtime error 339 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1616 KB Output is correct
2 Correct 1 ms 1700 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 2 ms 1704 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 2 ms 1612 KB Output is correct
7 Correct 1 ms 1612 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 1 ms 1612 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 5 ms 3904 KB Output is correct
13 Correct 3 ms 1740 KB Output is correct
14 Correct 3 ms 1740 KB Output is correct
15 Correct 3 ms 1712 KB Output is correct
16 Correct 3 ms 1740 KB Output is correct
17 Correct 3 ms 1860 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 1 ms 1740 KB Output is correct
20 Correct 2 ms 1740 KB Output is correct
21 Correct 1 ms 1740 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 3 ms 1712 KB Output is correct
24 Correct 3 ms 1868 KB Output is correct
25 Correct 2 ms 1868 KB Output is correct
26 Correct 71 ms 34776 KB Output is correct
27 Correct 65 ms 34680 KB Output is correct
28 Correct 2 ms 1976 KB Output is correct
29 Correct 4 ms 2508 KB Output is correct
30 Correct 2 ms 1996 KB Output is correct
31 Correct 3 ms 2124 KB Output is correct
32 Correct 6 ms 1996 KB Output is correct
33 Correct 8 ms 3148 KB Output is correct
34 Correct 7 ms 3148 KB Output is correct
35 Correct 11 ms 3148 KB Output is correct
36 Correct 4 ms 1868 KB Output is correct
37 Correct 12 ms 4016 KB Output is correct
38 Correct 17 ms 3924 KB Output is correct
39 Correct 16 ms 3888 KB Output is correct
40 Correct 17 ms 3864 KB Output is correct
41 Correct 15 ms 3944 KB Output is correct
42 Runtime error 377 ms 262148 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -