oj.uz

Submission #402994

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

#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 = 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 = 1e9;

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


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();
		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] });
		}
		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));
	bfs();
	ll ans = d[s[1]][1];
	if (ans == inf) ans = -1;
	pr(ans);
}

/*


*/

Compilation message

skyscraper.cpp:11: warning: "rep" redefined
   11 | #define rep(i, e) for(ll i = 0; i < e; i++)
      | 
skyscraper.cpp:10: note: this is the location of the previous definition
   10 | #define rep(i, s, e) for(ll i = s; i < e; i++)
      | 
skyscraper.cpp: In function 'void bfs()':
skyscraper.cpp:11:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define rep(i, e) for(ll i = 0; i < e; i++)
......
   43 |   rep(i, have[b].size()) {
      |       ~~~~~~~~~~~~~~~~~            
skyscraper.cpp:43:3: note: in expansion of macro 'rep'
   43 |   rep(i, have[b].size()) {
      |   ^~~

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 304 KB Output is correct
4 Correct 1 ms 316 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 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 2 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 6 ms 1084 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 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 312 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 7 ms 1100 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 1 ms 952 KB Output is correct
17 Correct 5 ms 5452 KB Output is correct
18 Correct 7 ms 7228 KB Output is correct
19 Correct 4 ms 4812 KB Output is correct
20 Correct 216 ms 16308 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 4 ms 5452 KB Output is correct
23 Correct 5 ms 6476 KB Output is correct
24 Correct 10 ms 14540 KB Output is correct
25 Correct 9 ms 16076 KB Output is correct
26 Correct 83 ms 16068 KB Output is correct
27 Correct 78 ms 16148 KB Output is correct
28 Correct 13 ms 16076 KB Output is correct
29 Correct 7 ms 6220 KB Output is correct
30 Correct 2 ms 1740 KB Output is correct
31 Correct 5 ms 4940 KB Output is correct
32 Correct 4 ms 4172 KB Output is correct
33 Correct 18 ms 16076 KB Output is correct
34 Correct 20 ms 16080 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 460 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 6 ms 1100 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 2 ms 956 KB Output is correct
17 Correct 5 ms 5580 KB Output is correct
18 Correct 5 ms 7116 KB Output is correct
19 Correct 4 ms 4732 KB Output is correct
20 Correct 201 ms 16312 KB Output is correct
21 Correct 2 ms 2116 KB Output is correct
22 Correct 4 ms 5452 KB Output is correct
23 Correct 5 ms 6476 KB Output is correct
24 Correct 10 ms 14540 KB Output is correct
25 Correct 10 ms 16156 KB Output is correct
26 Correct 84 ms 16076 KB Output is correct
27 Correct 79 ms 16076 KB Output is correct
28 Correct 12 ms 16204 KB Output is correct
29 Correct 7 ms 6220 KB Output is correct
30 Correct 2 ms 1740 KB Output is correct
31 Correct 5 ms 4940 KB Output is correct
32 Correct 4 ms 4172 KB Output is correct
33 Correct 18 ms 16076 KB Output is correct
34 Correct 18 ms 16156 KB Output is correct
35 Correct 96 ms 145788 KB Output is correct
36 Correct 14 ms 20712 KB Output is correct
37 Correct 109 ms 148164 KB Output is correct
38 Correct 146 ms 235760 KB Output is correct
39 Correct 144 ms 236188 KB Output is correct
40 Correct 146 ms 236228 KB Output is correct
41 Correct 145 ms 236036 KB Output is correct
42 Execution timed out 1112 ms 236228 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 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 460 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 6 ms 1100 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 5 ms 5452 KB Output is correct
18 Correct 5 ms 7116 KB Output is correct
19 Correct 3 ms 4812 KB Output is correct
20 Correct 200 ms 16184 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 4 ms 5452 KB Output is correct
23 Correct 5 ms 6476 KB Output is correct
24 Correct 10 ms 14540 KB Output is correct
25 Correct 10 ms 16072 KB Output is correct
26 Correct 84 ms 16076 KB Output is correct
27 Correct 79 ms 16148 KB Output is correct
28 Correct 12 ms 16076 KB Output is correct
29 Correct 7 ms 6220 KB Output is correct
30 Correct 2 ms 1848 KB Output is correct
31 Correct 5 ms 4940 KB Output is correct
32 Correct 4 ms 4172 KB Output is correct
33 Correct 18 ms 16076 KB Output is correct
34 Correct 18 ms 16116 KB Output is correct
35 Correct 94 ms 145636 KB Output is correct
36 Correct 14 ms 20684 KB Output is correct
37 Correct 109 ms 148108 KB Output is correct
38 Correct 146 ms 235764 KB Output is correct
39 Correct 145 ms 236112 KB Output is correct
40 Correct 145 ms 236096 KB Output is correct
41 Correct 143 ms 236100 KB Output is correct
42 Execution timed out 1108 ms 236232 KB Time limit exceeded
43 Halted 0 ms 0 KB -