oj.uz

Submission #25695

# Submission time Handle Problem Language Result Execution time Memory
25695 2017-06-23T15:11:35 Z gabrielsimoes Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 53556 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,pii> plii;
const int MAXN = 3e4+10;
const int BLK = 200;

#define dist first
#define index second.first
#define delta second.second

int N, M, X, Y;
vector<pii> v[MAXN];
ll d[MAXN][BLK];
map<pii, bool> ok;
priority_queue<plii, vector<plii>, greater<plii>> q;

ll dBig[MAXN];
int posBig[MAXN];

inline void proc(int i, int dx, ll dd) {
	if (dx < BLK) {
		if (d[i][dx] == -1 || dd < d[i][dx]) {
			d[i][dx] = dd;
			q.push({dd, {i, dx}});
		}
	} else {
		if (dBig[i] == -1 || dd < dBig[i]) {
			dBig[i] = dd;
			q.push({dd, {i, dx}});
		}
	}
}

inline void procBig(int cur, int dx, ll d0) {
	int i = cur, cnt = 0;
	while ((i-=dx) >= 0) proc(i, 0, d0 + (++cnt));
	i = cur, cnt = 0;
	while ((i+=dx) < N) proc(i, 0, d0 + (++cnt));
}

inline void procSmall(int cur, int dx, ll d0) {
	if (cur - dx >= 0) {
		proc(cur-dx, dx, d0+1);
		proc(cur-dx, 0, d0+1);
	}

	if (cur + dx < N) {
		proc(cur+dx, dx, d0+1);
		proc(cur+dx, 0, d0+1);	
	}
}

inline void proc0(int ix) {
	for (pii p : v[ix])
		proc(p.first<BLK?ix:p.second, p.first, d[ix][0]);
}
 
void dijkstra() {
	memset(d, -1, sizeof(d));
	memset(dBig, -1, sizeof(dBig));
	d[X][0] = 0; q.push({0,{X,0}});
	
	while (!q.empty()) {
		plii p = q.top(); q.pop();
		if (p.delta < BLK && d[p.index][p.delta] < p.dist) continue;
		else if (p.delta >= BLK && dBig[p.index] < p.dist) continue;

		if (p.delta == 0) proc0(p.index);
		else if (p.delta < BLK) procSmall(p.index, p.delta, p.dist);
		else procBig(posBig[p.index], p.delta, p.dist);
	}
}
 
int main()
{
	scanf("%d %d", &N, &M);
	for (int i = 0,a,b; i < M; i++) {
		scanf("%d %d", &a, &b);

		if (i == 0) X = a;
		else if (i == 1) Y = a;

		if (b != 0) v[a].push_back(pii(b,i));
		posBig[i] = a;
	}
	
	for (int i = 0; i < N; i++)
		sort(v[i].begin(), v[i].end()),
		v[i].resize(unique(v[i].begin(), v[i].end()) - v[i].begin());
 
	dijkstra();
	printf("%lld\n", d[Y][0]);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:79:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
                        ^
skyscraper.cpp:81:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a, &b);
                         ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 49972 KB Output is correct
2 Correct 0 ms 49972 KB Output is correct
3 Correct 6 ms 49972 KB Output is correct
4 Correct 0 ms 49972 KB Output is correct
5 Correct 3 ms 49972 KB Output is correct
6 Correct 3 ms 49972 KB Output is correct
7 Correct 6 ms 49972 KB Output is correct
8 Correct 3 ms 49972 KB Output is correct
9 Correct 3 ms 49972 KB Output is correct
10 Correct 3 ms 49972 KB Output is correct
11 Correct 6 ms 50108 KB Output is correct
12 Correct 6 ms 49972 KB Output is correct
13 Correct 6 ms 49972 KB Output is correct
14 Correct 9 ms 50108 KB Output is correct
15 Correct 0 ms 50108 KB Output is correct
16 Correct 3 ms 49972 KB Output is correct
17 Correct 6 ms 50112 KB Output is correct
18 Correct 3 ms 49972 KB Output is correct
19 Correct 13 ms 49972 KB Output is correct
20 Correct 9 ms 50104 KB Output is correct
21 Correct 9 ms 49972 KB Output is correct
22 Correct 3 ms 49972 KB Output is correct
23 Correct 0 ms 49972 KB Output is correct
24 Correct 3 ms 50104 KB Output is correct
25 Correct 3 ms 49972 KB Output is correct
26 Correct 6 ms 49972 KB Output is correct
27 Correct 0 ms 49972 KB Output is correct
28 Correct 3 ms 50104 KB Output is correct
29 Correct 16 ms 49972 KB Output is correct
30 Correct 13 ms 49972 KB Output is correct
31 Correct 16 ms 49972 KB Output is correct
32 Correct 16 ms 49972 KB Output is correct
33 Correct 26 ms 50104 KB Output is correct
34 Correct 19 ms 50108 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 49972 KB Output is correct
2 Correct 3 ms 49972 KB Output is correct
3 Correct 0 ms 49972 KB Output is correct
4 Correct 0 ms 49972 KB Output is correct
5 Correct 0 ms 49972 KB Output is correct
6 Correct 3 ms 49972 KB Output is correct
7 Correct 0 ms 49972 KB Output is correct
8 Correct 0 ms 49972 KB Output is correct
9 Correct 6 ms 49972 KB Output is correct
10 Correct 3 ms 49972 KB Output is correct
11 Correct 13 ms 50108 KB Output is correct
12 Correct 3 ms 49972 KB Output is correct
13 Correct 6 ms 49972 KB Output is correct
14 Correct 3 ms 50108 KB Output is correct
15 Correct 6 ms 50108 KB Output is correct
16 Correct 9 ms 49972 KB Output is correct
17 Correct 6 ms 50112 KB Output is correct
18 Correct 9 ms 49972 KB Output is correct
19 Correct 9 ms 49972 KB Output is correct
20 Correct 6 ms 50104 KB Output is correct
21 Correct 6 ms 49972 KB Output is correct
22 Correct 6 ms 49972 KB Output is correct
23 Correct 0 ms 49972 KB Output is correct
24 Correct 3 ms 50104 KB Output is correct
25 Correct 9 ms 49972 KB Output is correct
26 Correct 6 ms 49972 KB Output is correct
27 Correct 0 ms 49972 KB Output is correct
28 Correct 9 ms 50104 KB Output is correct
29 Correct 9 ms 49972 KB Output is correct
30 Correct 9 ms 49972 KB Output is correct
31 Correct 13 ms 49972 KB Output is correct
32 Correct 6 ms 49972 KB Output is correct
33 Correct 26 ms 50104 KB Output is correct
34 Correct 16 ms 50108 KB Output is correct
35 Correct 26 ms 51184 KB Output is correct
36 Correct 3 ms 50104 KB Output is correct
37 Correct 33 ms 51132 KB Output is correct
38 Correct 36 ms 51260 KB Output is correct
39 Correct 36 ms 51260 KB Output is correct
40 Correct 46 ms 51264 KB Output is correct
41 Correct 39 ms 51260 KB Output is correct
42 Correct 13 ms 50444 KB Output is correct
43 Correct 9 ms 50444 KB Output is correct
44 Correct 16 ms 50460 KB Output is correct
45 Correct 83 ms 51176 KB Output is correct
46 Correct 86 ms 51172 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 49972 KB Output is correct
2 Correct 3 ms 49972 KB Output is correct
3 Correct 6 ms 49972 KB Output is correct
4 Correct 9 ms 49972 KB Output is correct
5 Correct 0 ms 49972 KB Output is correct
6 Correct 6 ms 49972 KB Output is correct
7 Correct 9 ms 49972 KB Output is correct
8 Correct 6 ms 49972 KB Output is correct
9 Correct 0 ms 49972 KB Output is correct
10 Correct 0 ms 49972 KB Output is correct
11 Correct 3 ms 50108 KB Output is correct
12 Correct 6 ms 49972 KB Output is correct
13 Correct 0 ms 49972 KB Output is correct
14 Correct 13 ms 50108 KB Output is correct
15 Correct 3 ms 50108 KB Output is correct
16 Correct 6 ms 49972 KB Output is correct
17 Correct 6 ms 50112 KB Output is correct
18 Correct 3 ms 49972 KB Output is correct
19 Correct 3 ms 49972 KB Output is correct
20 Correct 6 ms 50104 KB Output is correct
21 Correct 6 ms 49972 KB Output is correct
22 Correct 0 ms 49972 KB Output is correct
23 Correct 6 ms 49972 KB Output is correct
24 Correct 16 ms 50104 KB Output is correct
25 Correct 6 ms 49972 KB Output is correct
26 Correct 6 ms 49972 KB Output is correct
27 Correct 6 ms 49972 KB Output is correct
28 Correct 3 ms 50104 KB Output is correct
29 Correct 9 ms 49972 KB Output is correct
30 Correct 9 ms 49972 KB Output is correct
31 Correct 9 ms 49972 KB Output is correct
32 Correct 6 ms 49972 KB Output is correct
33 Correct 23 ms 50104 KB Output is correct
34 Correct 23 ms 50108 KB Output is correct
35 Correct 29 ms 51184 KB Output is correct
36 Correct 9 ms 50104 KB Output is correct
37 Correct 36 ms 51132 KB Output is correct
38 Correct 46 ms 51260 KB Output is correct
39 Correct 36 ms 51260 KB Output is correct
40 Correct 29 ms 51264 KB Output is correct
41 Correct 36 ms 51260 KB Output is correct
42 Correct 16 ms 50444 KB Output is correct
43 Correct 13 ms 50444 KB Output is correct
44 Correct 13 ms 50460 KB Output is correct
45 Correct 96 ms 51176 KB Output is correct
46 Correct 86 ms 51172 KB Output is correct
47 Correct 149 ms 51252 KB Output is correct
48 Correct 16 ms 50500 KB Output is correct
49 Correct 9 ms 50500 KB Output is correct
50 Correct 6 ms 50368 KB Output is correct
51 Correct 103 ms 51456 KB Output is correct
52 Correct 96 ms 51460 KB Output is correct
53 Correct 43 ms 50632 KB Output is correct
54 Correct 3 ms 49972 KB Output is correct
55 Correct 16 ms 49972 KB Output is correct
56 Correct 16 ms 50896 KB Output is correct
57 Correct 116 ms 50104 KB Output is correct
58 Correct 26 ms 50440 KB Output is correct
59 Correct 29 ms 50440 KB Output is correct
60 Correct 33 ms 50448 KB Output is correct
61 Correct 26 ms 50464 KB Output is correct
62 Correct 86 ms 50896 KB Output is correct
63 Correct 96 ms 53556 KB Output is correct
64 Correct 103 ms 53500 KB Output is correct
65 Correct 626 ms 53540 KB Output is correct
66 Execution timed out 1000 ms 53480 KB Execution timed out
67 Halted 0 ms 0 KB -