oj.uz

Submission #585360

# Submission time Handle Problem Language Result Execution time Memory
585360 2022-06-28T17:48:09 Z GusterGoose27 Jakarta Skyscrapers (APIO15_skyscraper) C++11
57 / 100
 1000 ms 31336 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef pair<int, int> pii;
 
const int MAXN = 3e4;
const int inf = 1e9;
vector<pii> edges[MAXN];
unordered_set<int> at[MAXN];
int n, m;
int dist[MAXN];
vector<int> jump_occs[MAXN+1];
int occ_pos[MAXN+1];
vector<int> valsat[MAXN];
 
void dijkstra(int s) {
	fill(dist, dist+n, inf);
	dist[s] = 0;
	priority_queue<pii> pq;
	pq.push(pii(0, s));
	while (!pq.empty()) {
		pii p = pq.top();
		pq.pop();
		int cur = p.second;
		if (dist[cur] < p.first) continue;
		for (pii e: edges[cur]) {
			if (dist[cur]+e.second < dist[e.first]) {
				dist[e.first] = dist[cur]+e.second;
				pq.push(pii(dist[e.first], e.first));
			}
		}
	}
}
 
int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m;
	int posf;
	int poss;
	for (int i = 0; i < m; i++) {
		int x, y; cin >> x >> y;
		if (i == 1) posf = x;
		if (i == 0) poss = x;
		jump_occs[y].push_back(x);
		occ_pos[y]++;
		//valsat[x].push_back(y);
		at[x].insert(y);
	}
	for (int i = n-1; i >= 0; i--) {
		for (int p: at[i]) {
			occ_pos[p]--;
			int cur = occ_pos[p];
			int psize = jump_occs[p].size();
			for (int j = i+p; j < n; j += p) {
				edges[i].push_back(pii(j, (j-i)/p));
				while (cur < psize && jump_occs[p][cur] < j) cur++;
				if (cur < psize && jump_occs[p][cur] == j) break;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int p: at[i]) {
			int cur = occ_pos[p];
			for (int j = i-p; j >= 0; j -= p) {
				edges[i].push_back(pii(j, (i-j)/p));
				while (cur >= 0 && jump_occs[p][cur] > j) cur--;
				if (cur >= 0 && jump_occs[p][cur] == j) break;
			}
			occ_pos[p]++;
		}
	}
	dijkstra(poss);
	cout << ((dist[posf] == inf) ? (-1) : dist[posf]) << "\n";
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:73:10: warning: 'poss' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |  dijkstra(poss);
      |  ~~~~~~~~^~~~~~
skyscraper.cpp:74:21: warning: 'posf' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |  cout << ((dist[posf] == inf) ? (-1) : dist[posf]) << "\n";
      |            ~~~~~~~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 2 ms 4052 KB Output is correct
10 Correct 4 ms 4052 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 5 ms 4204 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 3 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct
8 Correct 2 ms 4052 KB Output is correct
9 Correct 2 ms 4052 KB Output is correct
10 Correct 2 ms 4052 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 3 ms 4164 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 3 ms 4104 KB Output is correct
17 Correct 17 ms 4456 KB Output is correct
18 Correct 3 ms 4308 KB Output is correct
19 Correct 4 ms 4180 KB Output is correct
20 Correct 38 ms 25996 KB Output is correct
21 Correct 4 ms 4180 KB Output is correct
22 Correct 3 ms 4180 KB Output is correct
23 Correct 7 ms 4308 KB Output is correct
24 Correct 29 ms 4436 KB Output is correct
25 Correct 8 ms 4436 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 3 ms 4180 KB Output is correct
28 Correct 4 ms 4564 KB Output is correct
29 Correct 5 ms 4820 KB Output is correct
30 Correct 3 ms 4308 KB Output is correct
31 Correct 4 ms 4436 KB Output is correct
32 Correct 4 ms 4308 KB Output is correct
33 Correct 5 ms 5332 KB Output is correct
34 Correct 5 ms 5332 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 2 ms 4052 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 3 ms 4052 KB Output is correct
10 Correct 3 ms 4052 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 16 ms 4460 KB Output is correct
18 Correct 3 ms 4300 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 34 ms 26060 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 3 ms 4160 KB Output is correct
23 Correct 6 ms 4308 KB Output is correct
24 Correct 30 ms 4436 KB Output is correct
25 Correct 6 ms 4436 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 3 ms 4180 KB Output is correct
28 Correct 3 ms 4564 KB Output is correct
29 Correct 4 ms 4820 KB Output is correct
30 Correct 4 ms 4308 KB Output is correct
31 Correct 5 ms 4436 KB Output is correct
32 Correct 5 ms 4308 KB Output is correct
33 Correct 6 ms 5332 KB Output is correct
34 Correct 6 ms 5332 KB Output is correct
35 Correct 125 ms 6652 KB Output is correct
36 Correct 34 ms 4564 KB Output is correct
37 Correct 312 ms 7848 KB Output is correct
38 Correct 321 ms 7860 KB Output is correct
39 Correct 323 ms 7964 KB Output is correct
40 Correct 359 ms 7912 KB Output is correct
41 Correct 313 ms 7804 KB Output is correct
42 Correct 6 ms 4308 KB Output is correct
43 Correct 9 ms 4492 KB Output is correct
44 Correct 52 ms 31268 KB Output is correct
45 Correct 23 ms 9940 KB Output is correct
46 Correct 22 ms 9932 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 3984 KB Output is correct
5 Correct 2 ms 4052 KB Output is correct
6 Correct 2 ms 4052 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 2 ms 4052 KB Output is correct
9 Correct 2 ms 4052 KB Output is correct
10 Correct 2 ms 4052 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 18 ms 4452 KB Output is correct
18 Correct 3 ms 4308 KB Output is correct
19 Correct 3 ms 4180 KB Output is correct
20 Correct 34 ms 25948 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 3 ms 4180 KB Output is correct
23 Correct 7 ms 4308 KB Output is correct
24 Correct 27 ms 4480 KB Output is correct
25 Correct 8 ms 4436 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 3 ms 4180 KB Output is correct
28 Correct 4 ms 4564 KB Output is correct
29 Correct 5 ms 4820 KB Output is correct
30 Correct 3 ms 4308 KB Output is correct
31 Correct 4 ms 4476 KB Output is correct
32 Correct 6 ms 4308 KB Output is correct
33 Correct 6 ms 5332 KB Output is correct
34 Correct 5 ms 5332 KB Output is correct
35 Correct 128 ms 6712 KB Output is correct
36 Correct 26 ms 4564 KB Output is correct
37 Correct 312 ms 7836 KB Output is correct
38 Correct 315 ms 7852 KB Output is correct
39 Correct 313 ms 7968 KB Output is correct
40 Correct 365 ms 7880 KB Output is correct
41 Correct 321 ms 7804 KB Output is correct
42 Correct 7 ms 4436 KB Output is correct
43 Correct 6 ms 4416 KB Output is correct
44 Correct 47 ms 31336 KB Output is correct
45 Correct 27 ms 9896 KB Output is correct
46 Correct 24 ms 9872 KB Output is correct
47 Execution timed out 1089 ms 16336 KB Time limit exceeded
48 Halted 0 ms 0 KB -