oj.uz

답안 #403056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403056 2021-05-12T17:26:35 Z yoavL Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 118208 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;
const ll maxn = 2002;
const ll maxm = 30002;
ll n, m;
//vvll d, have; // [place][sky ind]
//vvll have;
vll have[maxn];
ll d[maxn][maxm];

ll s[maxm], p[maxm];
//vll s, p;
//vb vis;
bool vis[maxn];

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


inline 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 });
	}
}


inline 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];
				else continue;
				//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);
	}

	
	for (ll i = 0; i < n; i++) {
		vis[i] = false;
		for (ll j = 0; j < m; j++) {
			d[i][j] = inf;
		}
	}

	//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 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 844 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 5 ms 1100 KB Output is correct
13 Correct 5 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 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 844 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 5 ms 1100 KB Output is correct
13 Correct 5 ms 1100 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 2 ms 1484 KB Output is correct
17 Correct 5 ms 5964 KB Output is correct
18 Correct 7 ms 10956 KB Output is correct
19 Correct 6 ms 10700 KB Output is correct
20 Correct 143 ms 16472 KB Output is correct
21 Correct 2 ms 2892 KB Output is correct
22 Correct 6 ms 10188 KB Output is correct
23 Correct 7 ms 9932 KB Output is correct
24 Correct 11 ms 15180 KB Output is correct
25 Correct 14 ms 16460 KB Output is correct
26 Correct 75 ms 16420 KB Output is correct
27 Correct 66 ms 16332 KB Output is correct
28 Correct 13 ms 16460 KB Output is correct
29 Correct 10 ms 11472 KB Output is correct
30 Correct 6 ms 9292 KB Output is correct
31 Correct 8 ms 10828 KB Output is correct
32 Correct 8 ms 10444 KB Output is correct
33 Correct 19 ms 16440 KB Output is correct
34 Correct 18 ms 16332 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 844 KB Output is correct
11 Correct 2 ms 1164 KB Output is correct
12 Correct 5 ms 1100 KB Output is correct
13 Correct 5 ms 1212 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 1484 KB Output is correct
17 Correct 8 ms 6036 KB Output is correct
18 Correct 7 ms 10848 KB Output is correct
19 Correct 6 ms 10700 KB Output is correct
20 Correct 173 ms 16476 KB Output is correct
21 Correct 3 ms 2892 KB Output is correct
22 Correct 10 ms 10200 KB Output is correct
23 Correct 9 ms 9932 KB Output is correct
24 Correct 12 ms 15192 KB Output is correct
25 Correct 11 ms 16348 KB Output is correct
26 Correct 69 ms 16332 KB Output is correct
27 Correct 69 ms 16332 KB Output is correct
28 Correct 14 ms 16460 KB Output is correct
29 Correct 9 ms 11468 KB Output is correct
30 Correct 6 ms 9292 KB Output is correct
31 Correct 8 ms 10828 KB Output is correct
32 Correct 7 ms 10444 KB Output is correct
33 Correct 18 ms 16436 KB Output is correct
34 Correct 18 ms 16440 KB Output is correct
35 Correct 73 ms 78568 KB Output is correct
36 Correct 13 ms 14928 KB Output is correct
37 Correct 91 ms 81816 KB Output is correct
38 Correct 116 ms 117876 KB Output is correct
39 Correct 117 ms 118080 KB Output is correct
40 Correct 123 ms 118164 KB Output is correct
41 Correct 111 ms 118104 KB Output is correct
42 Execution timed out 1051 ms 118208 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 844 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 5 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 1484 KB Output is correct
17 Correct 6 ms 5964 KB Output is correct
18 Correct 8 ms 10956 KB Output is correct
19 Correct 6 ms 10700 KB Output is correct
20 Correct 140 ms 16580 KB Output is correct
21 Correct 2 ms 2892 KB Output is correct
22 Correct 6 ms 10152 KB Output is correct
23 Correct 8 ms 9932 KB Output is correct
24 Correct 11 ms 15180 KB Output is correct
25 Correct 12 ms 16436 KB Output is correct
26 Correct 68 ms 16416 KB Output is correct
27 Correct 68 ms 16420 KB Output is correct
28 Correct 15 ms 16460 KB Output is correct
29 Correct 10 ms 11468 KB Output is correct
30 Correct 8 ms 9192 KB Output is correct
31 Correct 9 ms 10860 KB Output is correct
32 Correct 8 ms 10444 KB Output is correct
33 Correct 18 ms 16432 KB Output is correct
34 Correct 17 ms 16436 KB Output is correct
35 Correct 79 ms 78652 KB Output is correct
36 Correct 14 ms 14924 KB Output is correct
37 Correct 100 ms 81900 KB Output is correct
38 Correct 114 ms 117872 KB Output is correct
39 Correct 113 ms 118120 KB Output is correct
40 Correct 114 ms 118148 KB Output is correct
41 Correct 123 ms 118084 KB Output is correct
42 Execution timed out 1071 ms 118204 KB Time limit exceeded
43 Halted 0 ms 0 KB -