oj.uz

Submission #32893

# Submission time Handle Problem Language Result Execution time Memory
32893 2017-10-16T21:09:16 Z minimario Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 283 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

#define f first
#define s second

const int MAX = 30005;
const int SQRT = 175;
const int INF = 1000000000;
int p[MAX], len[MAX]; // position, length

vector<pair<pii, int> > g[MAX][SQRT];
vector<int> powers[MAX]; // powers of doges at a given position

int dist[MAX][SQRT];

priority_queue<pair<int, pair<int, int> > > pq;
int ct = 0;
void dijk(int i, int j) {
	dist[i][j] = 0;
	//cout << i << " " << j << " " << 0 << endl;
	pq.push({0, {i, j}});
	while (!pq.empty()) {
		auto top = pq.top(); pq.pop();
		ct++;
		int d = -top.f;
		pair<int, int> loc = top.s;
		if (d > dist[loc.f][loc.s]) {
			continue; 
		}
		//cout << loc.f << " " << loc.s << endl;
		for (auto i : g[loc.f][loc.s]) {
			//cout << i.f.f << " " << i.f.s << endl;
			int d_new = (d + i.s);
			if (d_new < dist[i.f.f][i.f.s]) {
				dist[i.f.f][i.f.s] = d_new;
				//cout << "came from: " << loc.f << " " << loc.s << endl;
				//cout << i.f.f << " " << i.f.s << " " << d_new << endl;

				pq.push({-d_new, i.f});

			}
		}

	}
}
int main() {
	//freopen("a.in", "r", stdin);
	//freopen("a.out", "w", stdout);
	for (int i=0; i<MAX; i++) {
		for (int j=0; j<SQRT; j++) {
			dist[i][j] = INF; 
		}
	}

	int n, m; scanf("%d %d", &n, &m);
	for (int i=0; i<m; i++) {
		scanf("%d %d", &p[i], &len[i]);
		powers[p[i]].push_back(len[i]);
	}

	for (int i=0; i<n; i++) {
		for (int j=1; j<SQRT; j++) {
			g[i][j].push_back({{i, 0}, 0});
		}
		for (int j : powers[i]) {
			if (j < SQRT) {
				g[i][0].push_back({{i, j}, 0});
			}
		}
	}
	for (int i=0; i<m; i++) {
		if (len[i] > SQRT) {
			for (int j=p[i]+len[i]; j<n; j+=len[i]) {
				g[p[i]][0].push_back({{j, 0}, (j-p[i])/len[i]});
			}
			for (int j=p[i]-len[i]; j>=0; j-=len[i]) {
				g[p[i]][0].push_back({{j, 0}, (p[i]-j)/len[i]});
			}
		}
	}

	for (int i=0; i<n; i++) {
		for (int j=1; j<SQRT; j++) {
			if (i-j >= 0) { g[i][j].push_back({{i-j, j}, 1}); }
			if (i+j < n) { g[i][j].push_back({{i+j, j}, 1}); }
		}
		/*
		if (p[i] - len[i] >= 0) {
			g[p[i]][len[i]].push_back({{p[i]-len[i], len[i]}, 1});
		}
		if (p[i] + len[i] < n) {
			g[p[i]][len[i]].push_back({{p[i]+len[i], len[i]}, 1});
		}
		*/
	}

	dijk(p[0], 0);
	if (dist[p[1]][0] == INF) { printf("%d\n", -1); }
	else { printf("%d\n", dist[p[1]][0]); }
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:59:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, m; scanf("%d %d", &n, &m);
                                  ^
skyscraper.cpp:61:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &p[i], &len[i]);
                                 ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 146536 KB Output is correct
2 Correct 39 ms 146536 KB Output is correct
3 Correct 49 ms 146536 KB Output is correct
4 Correct 43 ms 146536 KB Output is correct
5 Correct 43 ms 146668 KB Output is correct
6 Correct 46 ms 146668 KB Output is correct
7 Correct 39 ms 146668 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 146536 KB Output is correct
2 Correct 43 ms 146536 KB Output is correct
3 Correct 39 ms 146536 KB Output is correct
4 Correct 36 ms 146536 KB Output is correct
5 Correct 29 ms 146668 KB Output is correct
6 Correct 46 ms 146668 KB Output is correct
7 Correct 29 ms 146668 KB Output is correct
8 Correct 26 ms 146800 KB Output is correct
9 Correct 46 ms 146932 KB Output is correct
10 Correct 39 ms 147196 KB Output is correct
11 Correct 36 ms 147328 KB Output is correct
12 Correct 43 ms 147328 KB Output is correct
13 Correct 36 ms 147348 KB Output is correct
14 Correct 46 ms 147328 KB Output is correct
15 Correct 39 ms 147328 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 146536 KB Output is correct
2 Correct 33 ms 146536 KB Output is correct
3 Correct 46 ms 146536 KB Output is correct
4 Correct 39 ms 146536 KB Output is correct
5 Correct 36 ms 146668 KB Output is correct
6 Correct 43 ms 146668 KB Output is correct
7 Correct 49 ms 146668 KB Output is correct
8 Correct 53 ms 146800 KB Output is correct
9 Correct 43 ms 146932 KB Output is correct
10 Correct 36 ms 147196 KB Output is correct
11 Correct 33 ms 147328 KB Output is correct
12 Correct 36 ms 147328 KB Output is correct
13 Correct 43 ms 147348 KB Output is correct
14 Correct 39 ms 147328 KB Output is correct
15 Correct 36 ms 147328 KB Output is correct
16 Correct 23 ms 147988 KB Output is correct
17 Correct 56 ms 153796 KB Output is correct
18 Correct 69 ms 164752 KB Output is correct
19 Correct 89 ms 167392 KB Output is correct
20 Correct 93 ms 167524 KB Output is correct
21 Correct 46 ms 149968 KB Output is correct
22 Correct 86 ms 165016 KB Output is correct
23 Correct 83 ms 163172 KB Output is correct
24 Correct 96 ms 166468 KB Output is correct
25 Correct 93 ms 167524 KB Output is correct
26 Correct 96 ms 167524 KB Output is correct
27 Correct 96 ms 167528 KB Output is correct
28 Correct 103 ms 167524 KB Output is correct
29 Correct 113 ms 167392 KB Output is correct
30 Correct 99 ms 167392 KB Output is correct
31 Correct 109 ms 167392 KB Output is correct
32 Correct 103 ms 167392 KB Output is correct
33 Correct 129 ms 167524 KB Output is correct
34 Correct 119 ms 167524 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 146536 KB Output is correct
2 Correct 26 ms 146536 KB Output is correct
3 Correct 33 ms 146536 KB Output is correct
4 Correct 33 ms 146536 KB Output is correct
5 Correct 33 ms 146668 KB Output is correct
6 Correct 43 ms 146668 KB Output is correct
7 Correct 29 ms 146668 KB Output is correct
8 Correct 39 ms 146800 KB Output is correct
9 Correct 33 ms 146932 KB Output is correct
10 Correct 43 ms 147196 KB Output is correct
11 Correct 33 ms 147328 KB Output is correct
12 Correct 33 ms 147328 KB Output is correct
13 Correct 36 ms 147348 KB Output is correct
14 Correct 36 ms 147328 KB Output is correct
15 Correct 49 ms 147328 KB Output is correct
16 Correct 33 ms 147988 KB Output is correct
17 Correct 59 ms 153796 KB Output is correct
18 Correct 93 ms 164752 KB Output is correct
19 Correct 89 ms 167392 KB Output is correct
20 Correct 89 ms 167524 KB Output is correct
21 Correct 39 ms 149968 KB Output is correct
22 Correct 96 ms 165016 KB Output is correct
23 Correct 83 ms 163172 KB Output is correct
24 Correct 106 ms 166468 KB Output is correct
25 Correct 86 ms 167524 KB Output is correct
26 Correct 89 ms 167524 KB Output is correct
27 Correct 96 ms 167528 KB Output is correct
28 Correct 96 ms 167524 KB Output is correct
29 Correct 116 ms 167392 KB Output is correct
30 Correct 93 ms 167392 KB Output is correct
31 Correct 96 ms 167392 KB Output is correct
32 Correct 113 ms 167392 KB Output is correct
33 Correct 133 ms 167524 KB Output is correct
34 Correct 146 ms 167524 KB Output is correct
35 Correct 103 ms 162168 KB Output is correct
36 Correct 73 ms 157624 KB Output is correct
37 Correct 129 ms 168108 KB Output is correct
38 Correct 146 ms 168620 KB Output is correct
39 Correct 169 ms 168764 KB Output is correct
40 Correct 159 ms 168768 KB Output is correct
41 Correct 153 ms 168764 KB Output is correct
42 Correct 103 ms 167908 KB Output is correct
43 Correct 99 ms 167892 KB Output is correct
44 Correct 99 ms 168028 KB Output is correct
45 Correct 249 ms 170624 KB Output is correct
46 Correct 219 ms 170624 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 146536 KB Output is correct
2 Correct 29 ms 146536 KB Output is correct
3 Correct 26 ms 146536 KB Output is correct
4 Correct 53 ms 146536 KB Output is correct
5 Correct 43 ms 146668 KB Output is correct
6 Correct 39 ms 146668 KB Output is correct
7 Correct 43 ms 146668 KB Output is correct
8 Correct 43 ms 146800 KB Output is correct
9 Correct 36 ms 146932 KB Output is correct
10 Correct 46 ms 147196 KB Output is correct
11 Correct 39 ms 147328 KB Output is correct
12 Correct 33 ms 147328 KB Output is correct
13 Correct 43 ms 147348 KB Output is correct
14 Correct 29 ms 147328 KB Output is correct
15 Correct 46 ms 147328 KB Output is correct
16 Correct 49 ms 147988 KB Output is correct
17 Correct 49 ms 153796 KB Output is correct
18 Correct 89 ms 164752 KB Output is correct
19 Correct 96 ms 167392 KB Output is correct
20 Correct 79 ms 167524 KB Output is correct
21 Correct 43 ms 149968 KB Output is correct
22 Correct 86 ms 165016 KB Output is correct
23 Correct 89 ms 163172 KB Output is correct
24 Correct 106 ms 166468 KB Output is correct
25 Correct 93 ms 167524 KB Output is correct
26 Correct 119 ms 167524 KB Output is correct
27 Correct 109 ms 167528 KB Output is correct
28 Correct 89 ms 167524 KB Output is correct
29 Correct 126 ms 167392 KB Output is correct
30 Correct 103 ms 167392 KB Output is correct
31 Correct 129 ms 167392 KB Output is correct
32 Correct 109 ms 167392 KB Output is correct
33 Correct 146 ms 167524 KB Output is correct
34 Correct 159 ms 167524 KB Output is correct
35 Correct 166 ms 162168 KB Output is correct
36 Correct 86 ms 157624 KB Output is correct
37 Correct 169 ms 168108 KB Output is correct
38 Correct 153 ms 168620 KB Output is correct
39 Correct 156 ms 168764 KB Output is correct
40 Correct 176 ms 168768 KB Output is correct
41 Correct 159 ms 168764 KB Output is correct
42 Correct 126 ms 167908 KB Output is correct
43 Correct 99 ms 167892 KB Output is correct
44 Correct 99 ms 168028 KB Output is correct
45 Correct 243 ms 170624 KB Output is correct
46 Correct 223 ms 170624 KB Output is correct
47 Memory limit exceeded 283 ms 262144 KB Memory limit exceeded
48 Halted 0 ms 0 KB -