oj.uz

Submission #248517

# Submission time Handle Problem Language Result Execution time Memory
248517 2020-07-12T15:07:47 Z sahil_k Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 431 ms 262144 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <queue>
using namespace std;

int n, m;
set<int> inc[30100];
vector< pair<int, int> > adj[2000000];
int dist[2000000];
bool vis[2000000];
priority_queue< pair<int, int> > ord;
int main () {
	cin >> n >> m;
	int rt = sqrt(n);
	int start, end;
	for (int i=0; i<n; i++) {
		for (int j=1; j<rt; j++) {
			adj[i*rt+j].push_back({i*rt, 0});
			if (i-j >= 0) adj[i*rt+j].push_back({(i-j)*rt+j, 1});
			if (i+j < n) adj[i*rt+j].push_back({(i+j)*rt+j, 1});
		}
	}
	int bi, pi;
	for (int i=0; i<m; i++) {
		cin >> bi >> pi;
		if (i == 0) start = bi;
		if (i == 1) end = bi;
		if (pi < rt) {
			adj[bi*rt].push_back({bi*rt+pi, 0});
		} else {
			for (int j=1; j<n; j++) {
				if (bi-j*pi < 0 && bi+j*pi >= n) break;
				if (bi-j*pi >= 0) adj[bi*rt].push_back({(bi-j*pi)*rt, j});
				if (bi+j*pi < n) adj[bi*rt].push_back({(bi+j*pi)*rt, j});
			}
		}
	}
	for (int i=0; i<n*rt; i++) {
		dist[i] = 1e9;
		vis[i] = false;
	}
	dist[start*rt] = 0;
	ord.push({0, start*rt});
	while (ord.size() > 0) {
		pair<int, int> cur = ord.top();
		cur.first = -cur.first;
		ord.pop();
		if (cur.second == end*rt) {
			cout << cur.first << endl;
			return 0;
		}
		if (vis[cur.second]) continue;
		vis[cur.second] = true;
		for (auto i: adj[cur.second]) {
			if (!vis[i.first] && cur.first+i.second < dist[i.first]) {
				dist[i.first] = cur.first+i.second;
				ord.push({-dist[i.first], i.first});
			}
		}
	}
	cout << -1 << endl;
}

/*
int n, m;
set<int> inc[30100];
vector< pair<int, int> > adj[30100];
int dist[30100];
bool vis[30100];
priority_queue< pair<int, int> > ord;
int main () {
	cin >> n >> m;
	int bi, pi;
	int start, end;
	for (int i=0; i<m; i++) {
		cin >> bi >> pi;
		inc[bi].insert(pi);
		if (i == 0) start = bi;
		if (i == 1) end = bi;
	}
	for (int i=0; i<n; i++) {
		for (auto j: inc[i]) {
			for (int k=1; k<n; k++) {
				if (i-j*k < 0) break;
				if (inc[i-j*k].find(j) != inc[i-j*k].end()) {
					adj[i].push_back({i-j*k, k});
					break;
				}
				adj[i].push_back({i-j*k, k});
			}
			for (int k=1; k<n; k++) {
				if (i+j*k >= n) break;
				if (inc[i+j*k].find(j) != inc[i+j*k].end()) {
					adj[i].push_back({i+j*k, k});
					break;
				}
				adj[i].push_back({i+j*k, k});
			}
		}
	}
	for (int i=0; i<n; i++) {
		dist[i] = 1e16;
	} 

}
*/

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:18:13: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int start, end;
             ^~~
skyscraper.cpp:45:12: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
  dist[start*rt] = 0;
       ~~~~~^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 48768 KB Output is correct
2 Correct 24 ms 48768 KB Output is correct
3 Correct 27 ms 48640 KB Output is correct
4 Correct 25 ms 48760 KB Output is correct
5 Correct 26 ms 48760 KB Output is correct
6 Correct 25 ms 48768 KB Output is correct
7 Correct 26 ms 48768 KB Output is correct
8 Correct 26 ms 48760 KB Output is correct
9 Correct 25 ms 48768 KB Output is correct
10 Correct 27 ms 48768 KB Output is correct
11 Correct 27 ms 48768 KB Output is correct
12 Correct 27 ms 48768 KB Output is correct
13 Correct 26 ms 48768 KB Output is correct
14 Correct 26 ms 48760 KB Output is correct
15 Correct 27 ms 48768 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 48768 KB Output is correct
2 Correct 24 ms 48768 KB Output is correct
3 Correct 25 ms 48760 KB Output is correct
4 Correct 25 ms 48768 KB Output is correct
5 Correct 25 ms 48768 KB Output is correct
6 Correct 26 ms 48760 KB Output is correct
7 Correct 26 ms 48768 KB Output is correct
8 Correct 25 ms 48768 KB Output is correct
9 Correct 25 ms 48760 KB Output is correct
10 Correct 26 ms 48760 KB Output is correct
11 Correct 26 ms 48768 KB Output is correct
12 Correct 27 ms 48760 KB Output is correct
13 Correct 27 ms 48768 KB Output is correct
14 Correct 27 ms 48760 KB Output is correct
15 Correct 27 ms 48760 KB Output is correct
16 Correct 26 ms 48888 KB Output is correct
17 Correct 30 ms 49792 KB Output is correct
18 Correct 37 ms 52352 KB Output is correct
19 Correct 39 ms 53116 KB Output is correct
20 Correct 39 ms 53240 KB Output is correct
21 Correct 28 ms 49144 KB Output is correct
22 Correct 36 ms 52472 KB Output is correct
23 Correct 36 ms 51832 KB Output is correct
24 Correct 39 ms 52880 KB Output is correct
25 Correct 39 ms 53240 KB Output is correct
26 Correct 39 ms 53240 KB Output is correct
27 Correct 40 ms 53248 KB Output is correct
28 Correct 41 ms 53244 KB Output is correct
29 Correct 47 ms 53116 KB Output is correct
30 Correct 40 ms 53112 KB Output is correct
31 Correct 45 ms 53368 KB Output is correct
32 Correct 40 ms 53368 KB Output is correct
33 Correct 52 ms 53624 KB Output is correct
34 Correct 44 ms 53652 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 48768 KB Output is correct
2 Correct 24 ms 48768 KB Output is correct
3 Correct 26 ms 48768 KB Output is correct
4 Correct 25 ms 48768 KB Output is correct
5 Correct 25 ms 48768 KB Output is correct
6 Correct 25 ms 48768 KB Output is correct
7 Correct 25 ms 48760 KB Output is correct
8 Correct 25 ms 48768 KB Output is correct
9 Correct 26 ms 48768 KB Output is correct
10 Correct 26 ms 48760 KB Output is correct
11 Correct 26 ms 48760 KB Output is correct
12 Correct 26 ms 48768 KB Output is correct
13 Correct 26 ms 48760 KB Output is correct
14 Correct 26 ms 48768 KB Output is correct
15 Correct 26 ms 48768 KB Output is correct
16 Correct 26 ms 48896 KB Output is correct
17 Correct 29 ms 49784 KB Output is correct
18 Correct 36 ms 52352 KB Output is correct
19 Correct 40 ms 53112 KB Output is correct
20 Correct 39 ms 53156 KB Output is correct
21 Correct 26 ms 49144 KB Output is correct
22 Correct 37 ms 52472 KB Output is correct
23 Correct 36 ms 51968 KB Output is correct
24 Correct 39 ms 52864 KB Output is correct
25 Correct 40 ms 53240 KB Output is correct
26 Correct 39 ms 53240 KB Output is correct
27 Correct 39 ms 53240 KB Output is correct
28 Correct 39 ms 53240 KB Output is correct
29 Correct 45 ms 53112 KB Output is correct
30 Correct 40 ms 53112 KB Output is correct
31 Correct 44 ms 53240 KB Output is correct
32 Correct 43 ms 53368 KB Output is correct
33 Correct 60 ms 53752 KB Output is correct
34 Correct 45 ms 53624 KB Output is correct
35 Correct 54 ms 52216 KB Output is correct
36 Correct 35 ms 50680 KB Output is correct
37 Correct 54 ms 54520 KB Output is correct
38 Correct 64 ms 54520 KB Output is correct
39 Correct 62 ms 54520 KB Output is correct
40 Correct 62 ms 54520 KB Output is correct
41 Correct 62 ms 54552 KB Output is correct
42 Correct 56 ms 53752 KB Output is correct
43 Correct 61 ms 53836 KB Output is correct
44 Correct 56 ms 53748 KB Output is correct
45 Correct 77 ms 57468 KB Output is correct
46 Correct 64 ms 57336 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 48760 KB Output is correct
2 Correct 25 ms 48760 KB Output is correct
3 Correct 26 ms 48760 KB Output is correct
4 Correct 26 ms 48768 KB Output is correct
5 Correct 25 ms 48768 KB Output is correct
6 Correct 25 ms 48768 KB Output is correct
7 Correct 26 ms 48760 KB Output is correct
8 Correct 25 ms 48768 KB Output is correct
9 Correct 26 ms 48760 KB Output is correct
10 Correct 26 ms 48768 KB Output is correct
11 Correct 27 ms 48768 KB Output is correct
12 Correct 26 ms 48768 KB Output is correct
13 Correct 27 ms 48760 KB Output is correct
14 Correct 26 ms 48768 KB Output is correct
15 Correct 26 ms 48768 KB Output is correct
16 Correct 27 ms 48888 KB Output is correct
17 Correct 29 ms 49792 KB Output is correct
18 Correct 36 ms 52352 KB Output is correct
19 Correct 37 ms 53120 KB Output is correct
20 Correct 38 ms 53248 KB Output is correct
21 Correct 27 ms 49016 KB Output is correct
22 Correct 36 ms 52480 KB Output is correct
23 Correct 35 ms 51832 KB Output is correct
24 Correct 38 ms 52992 KB Output is correct
25 Correct 39 ms 53240 KB Output is correct
26 Correct 39 ms 53240 KB Output is correct
27 Correct 39 ms 53240 KB Output is correct
28 Correct 40 ms 53240 KB Output is correct
29 Correct 48 ms 53112 KB Output is correct
30 Correct 50 ms 53112 KB Output is correct
31 Correct 43 ms 53240 KB Output is correct
32 Correct 39 ms 53376 KB Output is correct
33 Correct 52 ms 53624 KB Output is correct
34 Correct 43 ms 53624 KB Output is correct
35 Correct 55 ms 52216 KB Output is correct
36 Correct 34 ms 50680 KB Output is correct
37 Correct 55 ms 54520 KB Output is correct
38 Correct 65 ms 54524 KB Output is correct
39 Correct 63 ms 54520 KB Output is correct
40 Correct 61 ms 54584 KB Output is correct
41 Correct 67 ms 54520 KB Output is correct
42 Correct 55 ms 53752 KB Output is correct
43 Correct 58 ms 53748 KB Output is correct
44 Correct 57 ms 53748 KB Output is correct
45 Correct 79 ms 57464 KB Output is correct
46 Correct 62 ms 57336 KB Output is correct
47 Correct 281 ms 124000 KB Output is correct
48 Runtime error 431 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Halted 0 ms 0 KB -