oj.uz

Submission #403005

# Submission time Handle Problem Language Result Execution time Memory
403005 2021-05-12T16:16:05 Z yoavL Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 118600 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>

#define upmax(a, b) a = max(a, b);
#define upmin(a, b) a = min(a, b);
#define pr(x) cout << x << endl;
#define wpr(x) cout << #x << ": " << x << endl;
#define rep(i, s, e) for(ll i = s; i < e; i++)
#define rep(i, e) for(ll i = 0; i < e; i++)

using namespace std;

using ll = unsigned short int;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pll = pair<ll, ll>;

const ll inf = 5e4;

ll n, m;
vvll d, have; // [place][sky ind]
vll s, p;
vb vis;

void bfs()
{
	deque<pll> q; // {place, sky ind}
	q.push_front({ s[0], 0 });
	d[s[0]][0] = 0;

	while (!q.empty()) {
		ll b = q.front().first;
		ll ind = q.front().second;
		//wpr(b);
		//wpr(ind);
		//cout << "dist: " << d[b][ind] << endl;
		q.pop_front();
		if (!vis[b]) {
			rep(i, have[b].size()) {
				if (d[b][have[b][i]] != inf) continue;
				d[b][have[b][i]] = d[b][ind];
				q.push_front({ b, have[b][i] });
			}
			vis[b] = true;
		}
		
		//have[b].clear();

		ll jump = p[ind];
		if (b - jump >= 0 && d[b-jump][ind] == inf) {
			d[b - jump][ind] = d[b][ind] + 1;
			q.push_back({ b - jump, ind });
		}


		
		if (b + jump < n && d[b + jump][ind] == inf) {
			d[b + jump][ind] = d[b][ind] + 1;
			q.push_back({ b + jump, ind });
		}
	}

}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> m;
	s.resize(m);
	p.resize(m);
	have.resize(n);
	rep(i, m) {
		cin >> s[i] >> p[i];
		have[s[i]].push_back(i);
	}

	

	d.resize(n, vll(m, inf));
	vis.resize(n, false);
	bfs();
	ll ans = d[s[1]][1];
	if (ans == inf) {
		pr("-1");
	}
	else pr(ans);
}

/*

5 3
0 2
1 1
4 1


*/

Compilation message

skyscraper.cpp:12: warning: "rep" redefined
   12 | #define rep(i, e) for(ll i = 0; i < e; i++)
      | 
skyscraper.cpp:11: note: this is the location of the previous definition
   11 | #define rep(i, s, e) for(ll i = s; i < e; i++)
      |

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 308 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 5 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 3 ms 2892 KB Output is correct
18 Correct 3 ms 3776 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 130 ms 8356 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 3 ms 3404 KB Output is correct
24 Correct 6 ms 7496 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 71 ms 8304 KB Output is correct
27 Correct 67 ms 8268 KB Output is correct
28 Correct 8 ms 8268 KB Output is correct
29 Correct 4 ms 3276 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 3 ms 2636 KB Output is correct
32 Correct 3 ms 2252 KB Output is correct
33 Correct 13 ms 8268 KB Output is correct
34 Correct 15 ms 8268 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 5 ms 700 KB Output is correct
14 Correct 2 ms 700 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 3 ms 2892 KB Output is correct
18 Correct 3 ms 3788 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 129 ms 8356 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 3 ms 3404 KB Output is correct
24 Correct 6 ms 7492 KB Output is correct
25 Correct 6 ms 8264 KB Output is correct
26 Correct 72 ms 8304 KB Output is correct
27 Correct 67 ms 8268 KB Output is correct
28 Correct 7 ms 8360 KB Output is correct
29 Correct 4 ms 3276 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 3 ms 2620 KB Output is correct
32 Correct 3 ms 2252 KB Output is correct
33 Correct 13 ms 8268 KB Output is correct
34 Correct 12 ms 8304 KB Output is correct
35 Correct 57 ms 73268 KB Output is correct
36 Correct 9 ms 10484 KB Output is correct
37 Correct 69 ms 74288 KB Output is correct
38 Correct 87 ms 118264 KB Output is correct
39 Correct 89 ms 118364 KB Output is correct
40 Correct 87 ms 118472 KB Output is correct
41 Correct 87 ms 118304 KB Output is correct
42 Execution timed out 1091 ms 118424 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 5 ms 716 KB Output is correct
14 Correct 1 ms 700 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 4 ms 2888 KB Output is correct
18 Correct 3 ms 3788 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 143 ms 8344 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 3 ms 3404 KB Output is correct
24 Correct 6 ms 7500 KB Output is correct
25 Correct 7 ms 8256 KB Output is correct
26 Correct 70 ms 8268 KB Output is correct
27 Correct 66 ms 8288 KB Output is correct
28 Correct 8 ms 8268 KB Output is correct
29 Correct 4 ms 3276 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 3 ms 2620 KB Output is correct
32 Correct 3 ms 2252 KB Output is correct
33 Correct 14 ms 8396 KB Output is correct
34 Correct 13 ms 8268 KB Output is correct
35 Correct 58 ms 73028 KB Output is correct
36 Correct 9 ms 10572 KB Output is correct
37 Correct 70 ms 74276 KB Output is correct
38 Correct 85 ms 118268 KB Output is correct
39 Correct 89 ms 118600 KB Output is correct
40 Correct 89 ms 118468 KB Output is correct
41 Correct 87 ms 118384 KB Output is correct
42 Execution timed out 1094 ms 118428 KB Time limit exceeded
43 Halted 0 ms 0 KB -