oj.uz

답안 #402998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402998 2021-05-12T16:08:14 Z yoavL Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 243536 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;
vvb 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][ind]) continue;
		vis[b][ind] = true;
		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));
	vis.resize(n, vb(m, 0));
	bfs();
	ll ans = d[s[1]][1];
	if (ans == inf) ans = -1;
	pr(ans);
}

/*

5 3
0 2
1 1
4 1


*/

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++)
......
   45 |   rep(i, have[b].size()) {
      |       ~~~~~~~~~~~~~~~~~            
skyscraper.cpp:45:3: note: in expansion of macro 'rep'
   45 |   rep(i, have[b].size()) {
      |   ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 272 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 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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 7 ms 1100 KB Output is correct
14 Correct 3 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 5708 KB Output is correct
18 Correct 6 ms 7500 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 219 ms 16912 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 5 ms 5708 KB Output is correct
23 Correct 4 ms 6732 KB Output is correct
24 Correct 10 ms 15052 KB Output is correct
25 Correct 12 ms 16692 KB Output is correct
26 Correct 94 ms 16684 KB Output is correct
27 Correct 90 ms 16744 KB Output is correct
28 Correct 12 ms 16716 KB Output is correct
29 Correct 9 ms 6580 KB Output is correct
30 Correct 3 ms 1868 KB Output is correct
31 Correct 5 ms 5196 KB Output is correct
32 Correct 4 ms 4428 KB Output is correct
33 Correct 20 ms 16716 KB Output is correct
34 Correct 19 ms 16744 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 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 1196 KB Output is correct
13 Correct 6 ms 1196 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 972 KB Output is correct
17 Correct 6 ms 5708 KB Output is correct
18 Correct 5 ms 7432 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 215 ms 16792 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 4 ms 5708 KB Output is correct
23 Correct 5 ms 6732 KB Output is correct
24 Correct 11 ms 15080 KB Output is correct
25 Correct 10 ms 16716 KB Output is correct
26 Correct 94 ms 16716 KB Output is correct
27 Correct 89 ms 16744 KB Output is correct
28 Correct 11 ms 16716 KB Output is correct
29 Correct 9 ms 6576 KB Output is correct
30 Correct 3 ms 1868 KB Output is correct
31 Correct 5 ms 5196 KB Output is correct
32 Correct 5 ms 4428 KB Output is correct
33 Correct 19 ms 16716 KB Output is correct
34 Correct 18 ms 16756 KB Output is correct
35 Correct 105 ms 149940 KB Output is correct
36 Correct 14 ms 21276 KB Output is correct
37 Correct 118 ms 152600 KB Output is correct
38 Correct 157 ms 242928 KB Output is correct
39 Correct 157 ms 243400 KB Output is correct
40 Correct 155 ms 243268 KB Output is correct
41 Correct 153 ms 243264 KB Output is correct
42 Execution timed out 1102 ms 243432 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 3 ms 1100 KB Output is correct
12 Correct 6 ms 1192 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 3 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 6 ms 5708 KB Output is correct
18 Correct 5 ms 7500 KB Output is correct
19 Correct 5 ms 4940 KB Output is correct
20 Correct 228 ms 16792 KB Output is correct
21 Correct 2 ms 2248 KB Output is correct
22 Correct 4 ms 5708 KB Output is correct
23 Correct 5 ms 6732 KB Output is correct
24 Correct 10 ms 15052 KB Output is correct
25 Correct 10 ms 16716 KB Output is correct
26 Correct 95 ms 16712 KB Output is correct
27 Correct 87 ms 16716 KB Output is correct
28 Correct 13 ms 16740 KB Output is correct
29 Correct 8 ms 6572 KB Output is correct
30 Correct 3 ms 1868 KB Output is correct
31 Correct 5 ms 5196 KB Output is correct
32 Correct 5 ms 4428 KB Output is correct
33 Correct 19 ms 16748 KB Output is correct
34 Correct 20 ms 16752 KB Output is correct
35 Correct 113 ms 149964 KB Output is correct
36 Correct 17 ms 21324 KB Output is correct
37 Correct 124 ms 152596 KB Output is correct
38 Correct 150 ms 242972 KB Output is correct
39 Correct 156 ms 243396 KB Output is correct
40 Correct 176 ms 243276 KB Output is correct
41 Correct 151 ms 243168 KB Output is correct
42 Execution timed out 1103 ms 243536 KB Time limit exceeded
43 Halted 0 ms 0 KB -