oj.uz

Submission #32895

# Submission time Handle Problem Language Result Execution time Memory
32895 2017-10-17T00:30:18 Z minimario Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 636 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 = 125;
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 23 ms 105516 KB Output is correct
2 Correct 33 ms 105516 KB Output is correct
3 Correct 39 ms 105516 KB Output is correct
4 Correct 19 ms 105516 KB Output is correct
5 Correct 26 ms 105516 KB Output is correct
6 Correct 39 ms 105516 KB Output is correct
7 Correct 39 ms 105516 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 105516 KB Output is correct
2 Correct 26 ms 105516 KB Output is correct
3 Correct 33 ms 105516 KB Output is correct
4 Correct 36 ms 105516 KB Output is correct
5 Correct 33 ms 105516 KB Output is correct
6 Correct 29 ms 105516 KB Output is correct
7 Correct 33 ms 105516 KB Output is correct
8 Correct 26 ms 105648 KB Output is correct
9 Correct 36 ms 105780 KB Output is correct
10 Correct 26 ms 106044 KB Output is correct
11 Correct 26 ms 106044 KB Output is correct
12 Correct 29 ms 106044 KB Output is correct
13 Correct 33 ms 106044 KB Output is correct
14 Correct 33 ms 106044 KB Output is correct
15 Correct 39 ms 106044 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 105516 KB Output is correct
2 Correct 23 ms 105516 KB Output is correct
3 Correct 29 ms 105516 KB Output is correct
4 Correct 33 ms 105516 KB Output is correct
5 Correct 33 ms 105516 KB Output is correct
6 Correct 26 ms 105516 KB Output is correct
7 Correct 33 ms 105516 KB Output is correct
8 Correct 39 ms 105648 KB Output is correct
9 Correct 36 ms 105780 KB Output is correct
10 Correct 26 ms 106044 KB Output is correct
11 Correct 33 ms 106044 KB Output is correct
12 Correct 33 ms 106044 KB Output is correct
13 Correct 23 ms 106044 KB Output is correct
14 Correct 36 ms 106044 KB Output is correct
15 Correct 39 ms 106044 KB Output is correct
16 Correct 26 ms 106572 KB Output is correct
17 Correct 53 ms 109740 KB Output is correct
18 Correct 49 ms 115548 KB Output is correct
19 Correct 66 ms 117000 KB Output is correct
20 Correct 66 ms 117132 KB Output is correct
21 Correct 43 ms 107628 KB Output is correct
22 Correct 73 ms 115816 KB Output is correct
23 Correct 49 ms 114756 KB Output is correct
24 Correct 76 ms 116472 KB Output is correct
25 Correct 93 ms 117132 KB Output is correct
26 Correct 76 ms 117000 KB Output is correct
27 Correct 66 ms 117012 KB Output is correct
28 Correct 76 ms 117132 KB Output is correct
29 Correct 79 ms 117000 KB Output is correct
30 Correct 76 ms 117000 KB Output is correct
31 Correct 66 ms 117000 KB Output is correct
32 Correct 79 ms 117000 KB Output is correct
33 Correct 106 ms 117000 KB Output is correct
34 Correct 96 ms 117000 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 105516 KB Output is correct
2 Correct 26 ms 105516 KB Output is correct
3 Correct 26 ms 105516 KB Output is correct
4 Correct 33 ms 105516 KB Output is correct
5 Correct 19 ms 105516 KB Output is correct
6 Correct 33 ms 105516 KB Output is correct
7 Correct 36 ms 105516 KB Output is correct
8 Correct 26 ms 105648 KB Output is correct
9 Correct 26 ms 105780 KB Output is correct
10 Correct 23 ms 106044 KB Output is correct
11 Correct 29 ms 106044 KB Output is correct
12 Correct 19 ms 106044 KB Output is correct
13 Correct 26 ms 106044 KB Output is correct
14 Correct 26 ms 106044 KB Output is correct
15 Correct 36 ms 106044 KB Output is correct
16 Correct 23 ms 106572 KB Output is correct
17 Correct 53 ms 109740 KB Output is correct
18 Correct 56 ms 115548 KB Output is correct
19 Correct 59 ms 117000 KB Output is correct
20 Correct 73 ms 117132 KB Output is correct
21 Correct 33 ms 107628 KB Output is correct
22 Correct 56 ms 115816 KB Output is correct
23 Correct 49 ms 114756 KB Output is correct
24 Correct 63 ms 116472 KB Output is correct
25 Correct 56 ms 117132 KB Output is correct
26 Correct 73 ms 117000 KB Output is correct
27 Correct 69 ms 117012 KB Output is correct
28 Correct 73 ms 117132 KB Output is correct
29 Correct 89 ms 117000 KB Output is correct
30 Correct 63 ms 117000 KB Output is correct
31 Correct 56 ms 117000 KB Output is correct
32 Correct 63 ms 117000 KB Output is correct
33 Correct 89 ms 117000 KB Output is correct
34 Correct 99 ms 117000 KB Output is correct
35 Correct 76 ms 114228 KB Output is correct
36 Correct 43 ms 111852 KB Output is correct
37 Correct 113 ms 117688 KB Output is correct
38 Correct 109 ms 117924 KB Output is correct
39 Correct 103 ms 117924 KB Output is correct
40 Correct 119 ms 117924 KB Output is correct
41 Correct 109 ms 117924 KB Output is correct
42 Correct 76 ms 117452 KB Output is correct
43 Correct 73 ms 117364 KB Output is correct
44 Correct 89 ms 117552 KB Output is correct
45 Correct 149 ms 120036 KB Output is correct
46 Correct 149 ms 120032 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 105516 KB Output is correct
2 Correct 26 ms 105516 KB Output is correct
3 Correct 26 ms 105516 KB Output is correct
4 Correct 36 ms 105516 KB Output is correct
5 Correct 29 ms 105516 KB Output is correct
6 Correct 26 ms 105516 KB Output is correct
7 Correct 29 ms 105516 KB Output is correct
8 Correct 26 ms 105648 KB Output is correct
9 Correct 43 ms 105780 KB Output is correct
10 Correct 26 ms 106044 KB Output is correct
11 Correct 29 ms 106044 KB Output is correct
12 Correct 39 ms 106044 KB Output is correct
13 Correct 26 ms 106044 KB Output is correct
14 Correct 26 ms 106044 KB Output is correct
15 Correct 43 ms 106044 KB Output is correct
16 Correct 29 ms 106572 KB Output is correct
17 Correct 46 ms 109740 KB Output is correct
18 Correct 66 ms 115548 KB Output is correct
19 Correct 69 ms 117000 KB Output is correct
20 Correct 69 ms 117132 KB Output is correct
21 Correct 36 ms 107628 KB Output is correct
22 Correct 83 ms 115816 KB Output is correct
23 Correct 59 ms 114756 KB Output is correct
24 Correct 59 ms 116472 KB Output is correct
25 Correct 79 ms 117132 KB Output is correct
26 Correct 73 ms 117000 KB Output is correct
27 Correct 76 ms 117012 KB Output is correct
28 Correct 89 ms 117132 KB Output is correct
29 Correct 89 ms 117000 KB Output is correct
30 Correct 76 ms 117000 KB Output is correct
31 Correct 89 ms 117000 KB Output is correct
32 Correct 73 ms 117000 KB Output is correct
33 Correct 106 ms 117000 KB Output is correct
34 Correct 109 ms 117000 KB Output is correct
35 Correct 86 ms 114228 KB Output is correct
36 Correct 53 ms 111852 KB Output is correct
37 Correct 119 ms 117688 KB Output is correct
38 Correct 119 ms 117924 KB Output is correct
39 Correct 126 ms 117924 KB Output is correct
40 Correct 106 ms 117924 KB Output is correct
41 Correct 103 ms 117924 KB Output is correct
42 Correct 76 ms 117452 KB Output is correct
43 Correct 63 ms 117364 KB Output is correct
44 Correct 69 ms 117552 KB Output is correct
45 Correct 146 ms 120036 KB Output is correct
46 Correct 153 ms 120032 KB Output is correct
47 Correct 636 ms 181936 KB Output is correct
48 Correct 549 ms 242004 KB Output is correct
49 Correct 589 ms 254412 KB Output is correct
50 Memory limit exceeded 513 ms 262144 KB Memory limit exceeded
51 Halted 0 ms 0 KB -