oj.uz

Submission #32896

# Submission time Handle Problem Language Result Execution time Memory
32896 2017-10-17T00:31:26 Z minimario Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 773 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 = 100;
const int INF = 1000000000;
int p[MAX], len[MAX]; // position, length
 
vector<pair<int, int> > g[MAX*SQRT+SQRT];
vector<int> powers[MAX]; // powers of doges at a given position
 
int dist[MAX*SQRT+SQRT];
 
priority_queue<pair<int, int> > pq;
int xd = 0;
void dijk(int i) {
	dist[i] = 0;
	//cout << i << " " << j << " " << 0 << endl;
	pq.push({0, i});
	while (!pq.empty()) {
		xd += 1;
		auto top = pq.top(); pq.pop();
		int d = -top.f;
		int loc = top.s;
		if (d > dist[loc]) {
			continue; 
		}
		//cout << loc.f << " " << loc.s << endl;
		for (auto i : g[loc]) {
			//cout << i.f.f << " " << i.f.s << endl;
			int d_new = (d + i.s);
			if (d_new < dist[i.f]) {
				dist[i.f] = 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*SQRT+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*SQRT+j].push_back({i*SQRT, 0});
		}
		for (int j : powers[i]) {
			if (j < SQRT) {
				g[i*SQRT].push_back({i*SQRT+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]*SQRT].push_back({j*SQRT, (j-p[i])/len[i]});
			}
			for (int j=p[i]-len[i]; j>=0; j-=len[i]) {
				g[p[i]*SQRT].push_back({j*SQRT, (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*SQRT+j].push_back({(i-j)*SQRT+j, 1}); }
			if (i+j < n) { g[i*SQRT+j].push_back({(i+j)*SQRT+j, 1}); }
		}
	}
	
	/*
	int ct = 0;
	for (int i=0; i<MAX; i++) {
		for (int j=0; j<SQRT; j++) {
			ct += g[i][j].size();
		}
	}
	cout << ct << endl;
	*/
	dijk(p[0]*SQRT);
	if (dist[p[1]*SQRT] == INF) { printf("%d\n", -1); }
	else { printf("%d\n", dist[p[1]*SQRT]); }
	//cout << xd << endl;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:58: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:60: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 19 ms 85004 KB Output is correct
2 Correct 23 ms 85004 KB Output is correct
3 Correct 19 ms 85004 KB Output is correct
4 Correct 16 ms 85004 KB Output is correct
5 Correct 16 ms 85004 KB Output is correct
6 Correct 23 ms 85004 KB Output is correct
7 Correct 23 ms 85004 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 85004 KB Output is correct
2 Correct 26 ms 85004 KB Output is correct
3 Correct 23 ms 85004 KB Output is correct
4 Correct 26 ms 85004 KB Output is correct
5 Correct 19 ms 85004 KB Output is correct
6 Correct 26 ms 85004 KB Output is correct
7 Correct 13 ms 85004 KB Output is correct
8 Correct 26 ms 85136 KB Output is correct
9 Correct 33 ms 85268 KB Output is correct
10 Correct 26 ms 85400 KB Output is correct
11 Correct 26 ms 85532 KB Output is correct
12 Correct 13 ms 85404 KB Output is correct
13 Correct 23 ms 85536 KB Output is correct
14 Correct 29 ms 85532 KB Output is correct
15 Correct 29 ms 85532 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 85004 KB Output is correct
2 Correct 16 ms 85004 KB Output is correct
3 Correct 16 ms 85004 KB Output is correct
4 Correct 29 ms 85004 KB Output is correct
5 Correct 36 ms 85004 KB Output is correct
6 Correct 19 ms 85004 KB Output is correct
7 Correct 33 ms 85004 KB Output is correct
8 Correct 23 ms 85136 KB Output is correct
9 Correct 19 ms 85268 KB Output is correct
10 Correct 19 ms 85400 KB Output is correct
11 Correct 23 ms 85532 KB Output is correct
12 Correct 26 ms 85404 KB Output is correct
13 Correct 23 ms 85536 KB Output is correct
14 Correct 19 ms 85532 KB Output is correct
15 Correct 16 ms 85532 KB Output is correct
16 Correct 23 ms 85928 KB Output is correct
17 Correct 39 ms 88436 KB Output is correct
18 Correct 59 ms 93056 KB Output is correct
19 Correct 53 ms 94244 KB Output is correct
20 Correct 53 ms 94376 KB Output is correct
21 Correct 26 ms 86852 KB Output is correct
22 Correct 49 ms 93320 KB Output is correct
23 Correct 59 ms 92396 KB Output is correct
24 Correct 43 ms 93848 KB Output is correct
25 Correct 49 ms 94376 KB Output is correct
26 Correct 56 ms 94244 KB Output is correct
27 Correct 56 ms 94244 KB Output is correct
28 Correct 49 ms 94376 KB Output is correct
29 Correct 53 ms 94244 KB Output is correct
30 Correct 46 ms 94244 KB Output is correct
31 Correct 59 ms 94244 KB Output is correct
32 Correct 59 ms 94244 KB Output is correct
33 Correct 89 ms 94244 KB Output is correct
34 Correct 93 ms 94244 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 85004 KB Output is correct
2 Correct 19 ms 85004 KB Output is correct
3 Correct 13 ms 85004 KB Output is correct
4 Correct 26 ms 85004 KB Output is correct
5 Correct 26 ms 85004 KB Output is correct
6 Correct 19 ms 85004 KB Output is correct
7 Correct 29 ms 85004 KB Output is correct
8 Correct 26 ms 85136 KB Output is correct
9 Correct 16 ms 85268 KB Output is correct
10 Correct 19 ms 85400 KB Output is correct
11 Correct 26 ms 85532 KB Output is correct
12 Correct 23 ms 85404 KB Output is correct
13 Correct 16 ms 85536 KB Output is correct
14 Correct 23 ms 85532 KB Output is correct
15 Correct 29 ms 85532 KB Output is correct
16 Correct 33 ms 85928 KB Output is correct
17 Correct 36 ms 88436 KB Output is correct
18 Correct 43 ms 93056 KB Output is correct
19 Correct 56 ms 94244 KB Output is correct
20 Correct 49 ms 94376 KB Output is correct
21 Correct 33 ms 86852 KB Output is correct
22 Correct 46 ms 93320 KB Output is correct
23 Correct 39 ms 92396 KB Output is correct
24 Correct 59 ms 93848 KB Output is correct
25 Correct 49 ms 94376 KB Output is correct
26 Correct 49 ms 94244 KB Output is correct
27 Correct 49 ms 94244 KB Output is correct
28 Correct 59 ms 94376 KB Output is correct
29 Correct 56 ms 94244 KB Output is correct
30 Correct 49 ms 94244 KB Output is correct
31 Correct 73 ms 94244 KB Output is correct
32 Correct 59 ms 94244 KB Output is correct
33 Correct 79 ms 94244 KB Output is correct
34 Correct 83 ms 94244 KB Output is correct
35 Correct 73 ms 92268 KB Output is correct
36 Correct 39 ms 90152 KB Output is correct
37 Correct 96 ms 95044 KB Output is correct
38 Correct 103 ms 95168 KB Output is correct
39 Correct 96 ms 95168 KB Output is correct
40 Correct 93 ms 95168 KB Output is correct
41 Correct 79 ms 95168 KB Output is correct
42 Correct 59 ms 94664 KB Output is correct
43 Correct 53 ms 94676 KB Output is correct
44 Correct 63 ms 94820 KB Output is correct
45 Correct 106 ms 97152 KB Output is correct
46 Correct 126 ms 97160 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 85004 KB Output is correct
2 Correct 29 ms 85004 KB Output is correct
3 Correct 16 ms 85004 KB Output is correct
4 Correct 23 ms 85004 KB Output is correct
5 Correct 16 ms 85004 KB Output is correct
6 Correct 23 ms 85004 KB Output is correct
7 Correct 9 ms 85004 KB Output is correct
8 Correct 16 ms 85136 KB Output is correct
9 Correct 19 ms 85268 KB Output is correct
10 Correct 19 ms 85400 KB Output is correct
11 Correct 26 ms 85532 KB Output is correct
12 Correct 23 ms 85404 KB Output is correct
13 Correct 19 ms 85536 KB Output is correct
14 Correct 26 ms 85532 KB Output is correct
15 Correct 16 ms 85532 KB Output is correct
16 Correct 23 ms 85928 KB Output is correct
17 Correct 46 ms 88436 KB Output is correct
18 Correct 53 ms 93056 KB Output is correct
19 Correct 66 ms 94244 KB Output is correct
20 Correct 46 ms 94376 KB Output is correct
21 Correct 33 ms 86852 KB Output is correct
22 Correct 53 ms 93320 KB Output is correct
23 Correct 63 ms 92396 KB Output is correct
24 Correct 56 ms 93848 KB Output is correct
25 Correct 49 ms 94376 KB Output is correct
26 Correct 69 ms 94244 KB Output is correct
27 Correct 49 ms 94244 KB Output is correct
28 Correct 49 ms 94376 KB Output is correct
29 Correct 69 ms 94244 KB Output is correct
30 Correct 46 ms 94244 KB Output is correct
31 Correct 59 ms 94244 KB Output is correct
32 Correct 63 ms 94244 KB Output is correct
33 Correct 83 ms 94244 KB Output is correct
34 Correct 86 ms 94244 KB Output is correct
35 Correct 66 ms 92268 KB Output is correct
36 Correct 39 ms 90152 KB Output is correct
37 Correct 86 ms 95044 KB Output is correct
38 Correct 99 ms 95168 KB Output is correct
39 Correct 83 ms 95168 KB Output is correct
40 Correct 83 ms 95168 KB Output is correct
41 Correct 96 ms 95168 KB Output is correct
42 Correct 56 ms 94664 KB Output is correct
43 Correct 59 ms 94676 KB Output is correct
44 Correct 66 ms 94820 KB Output is correct
45 Correct 116 ms 97152 KB Output is correct
46 Correct 123 ms 97160 KB Output is correct
47 Correct 423 ms 147364 KB Output is correct
48 Correct 386 ms 194436 KB Output is correct
49 Correct 453 ms 204200 KB Output is correct
50 Correct 543 ms 215684 KB Output is correct
51 Correct 683 ms 227028 KB Output is correct
52 Correct 619 ms 227032 KB Output is correct
53 Correct 569 ms 224924 KB Output is correct
54 Correct 539 ms 224132 KB Output is correct
55 Correct 583 ms 224264 KB Output is correct
56 Correct 606 ms 226112 KB Output is correct
57 Correct 773 ms 224396 KB Output is correct
58 Correct 596 ms 224608 KB Output is correct
59 Correct 609 ms 224556 KB Output is correct
60 Correct 613 ms 225032 KB Output is correct
61 Correct 649 ms 224844 KB Output is correct
62 Correct 733 ms 227828 KB Output is correct
63 Correct 653 ms 249268 KB Output is correct
64 Correct 689 ms 259548 KB Output is correct
65 Memory limit exceeded 499 ms 262144 KB Memory limit exceeded
66 Halted 0 ms 0 KB -