oj.uz

답안 #403044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403044 2021-05-12T17:13:33 Z yoavL Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 118252 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;

queue<pll> q; // {place, sky ind}


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



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


void bfs()
{
	q.push({ 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();
		if (!vis[b]) {
			rep(i, have[b].size()) {
				//if (d[b][have[b][i]] != inf) continue;
				if(d[b][have[b][i]] == inf) d[b][have[b][i]] = d[b][ind];
				//q.push({ b, have[b][i] });
				make(b, have[b][i]);
				
			}
			vis[b] = true;
		}
		make(b, ind);
		//make()
	}

}

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

# 결과 실행 시간 메모리 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 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 740 KB Output is correct
13 Correct 6 ms 748 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 1 ms 716 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 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 6 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 3788 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 150 ms 8336 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 5 ms 7372 KB Output is correct
25 Correct 6 ms 8268 KB Output is correct
26 Correct 82 ms 8268 KB Output is correct
27 Correct 77 ms 8268 KB Output is correct
28 Correct 7 ms 8340 KB Output is correct
29 Correct 5 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 14 ms 8292 KB Output is correct
34 Correct 14 ms 8292 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 332 KB Output is correct
11 Correct 2 ms 708 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 6 ms 732 KB Output is correct
14 Correct 1 ms 716 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 145 ms 8340 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 7372 KB Output is correct
25 Correct 5 ms 8232 KB Output is correct
26 Correct 82 ms 8292 KB Output is correct
27 Correct 79 ms 8276 KB Output is correct
28 Correct 7 ms 8268 KB Output is correct
29 Correct 5 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 14 ms 8268 KB Output is correct
34 Correct 14 ms 8268 KB Output is correct
35 Correct 57 ms 72932 KB Output is correct
36 Correct 8 ms 10444 KB Output is correct
37 Correct 77 ms 74112 KB Output is correct
38 Correct 90 ms 118040 KB Output is correct
39 Correct 92 ms 118120 KB Output is correct
40 Correct 92 ms 118212 KB Output is correct
41 Correct 91 ms 118208 KB Output is correct
42 Execution timed out 1097 ms 118252 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 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 6 ms 732 KB Output is correct
14 Correct 1 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 3788 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 145 ms 8340 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 5 ms 7500 KB Output is correct
25 Correct 5 ms 8268 KB Output is correct
26 Correct 82 ms 8276 KB Output is correct
27 Correct 78 ms 8268 KB Output is correct
28 Correct 6 ms 8268 KB Output is correct
29 Correct 5 ms 3276 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 3 ms 2732 KB Output is correct
32 Correct 3 ms 2252 KB Output is correct
33 Correct 13 ms 8292 KB Output is correct
34 Correct 14 ms 8292 KB Output is correct
35 Correct 56 ms 72908 KB Output is correct
36 Correct 8 ms 10444 KB Output is correct
37 Correct 76 ms 74100 KB Output is correct
38 Correct 90 ms 118036 KB Output is correct
39 Correct 92 ms 118148 KB Output is correct
40 Correct 87 ms 118212 KB Output is correct
41 Correct 88 ms 118144 KB Output is correct
42 Execution timed out 1092 ms 118168 KB Time limit exceeded
43 Halted 0 ms 0 KB -