oj.uz

Submission #403054

# Submission time Handle Problem Language Result Execution time Memory
403054 2021-05-12T17:24:28 Z yoavL Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 118204 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;
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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 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 460 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 5 ms 1160 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 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 460 KB Output is correct
10 Correct 1 ms 716 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
16 Correct 2 ms 1484 KB Output is correct
17 Correct 5 ms 5964 KB Output is correct
18 Correct 7 ms 10928 KB Output is correct
19 Correct 7 ms 10700 KB Output is correct
20 Correct 149 ms 16472 KB Output is correct
21 Correct 2 ms 2764 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 12 ms 16452 KB Output is correct
26 Correct 100 ms 16368 KB Output is correct
27 Correct 66 ms 16432 KB Output is correct
28 Correct 13 ms 16460 KB Output is correct
29 Correct 10 ms 11468 KB Output is correct
30 Correct 6 ms 9200 KB Output is correct
31 Correct 9 ms 10828 KB Output is correct
32 Correct 9 ms 10456 KB Output is correct
33 Correct 18 ms 16332 KB Output is correct
34 Correct 22 ms 16332 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 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 460 KB Output is correct
10 Correct 2 ms 716 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 2 ms 1484 KB Output is correct
17 Correct 5 ms 6008 KB Output is correct
18 Correct 7 ms 10828 KB Output is correct
19 Correct 6 ms 10700 KB Output is correct
20 Correct 133 ms 16460 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 6 ms 10188 KB Output is correct
23 Correct 7 ms 9964 KB Output is correct
24 Correct 11 ms 15232 KB Output is correct
25 Correct 12 ms 16412 KB Output is correct
26 Correct 67 ms 16344 KB Output is correct
27 Correct 65 ms 16332 KB Output is correct
28 Correct 13 ms 16460 KB Output is correct
29 Correct 13 ms 11516 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 23 ms 16332 KB Output is correct
34 Correct 18 ms 16424 KB Output is correct
35 Correct 78 ms 78616 KB Output is correct
36 Correct 15 ms 14924 KB Output is correct
37 Correct 94 ms 81900 KB Output is correct
38 Correct 118 ms 117940 KB Output is correct
39 Correct 117 ms 118032 KB Output is correct
40 Correct 115 ms 118084 KB Output is correct
41 Correct 117 ms 118036 KB Output is correct
42 Execution timed out 1057 ms 118204 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 332 KB Output is correct
2 Correct 1 ms 204 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 460 KB Output is correct
10 Correct 1 ms 716 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
16 Correct 2 ms 1484 KB Output is correct
17 Correct 5 ms 5964 KB Output is correct
18 Correct 7 ms 10868 KB Output is correct
19 Correct 7 ms 10700 KB Output is correct
20 Correct 132 ms 16476 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 6 ms 10188 KB Output is correct
23 Correct 7 ms 9936 KB Output is correct
24 Correct 11 ms 15124 KB Output is correct
25 Correct 11 ms 16452 KB Output is correct
26 Correct 68 ms 16416 KB Output is correct
27 Correct 68 ms 16416 KB Output is correct
28 Correct 14 ms 16480 KB Output is correct
29 Correct 10 ms 11412 KB Output is correct
30 Correct 6 ms 9292 KB Output is correct
31 Correct 8 ms 10840 KB Output is correct
32 Correct 8 ms 10444 KB Output is correct
33 Correct 18 ms 16332 KB Output is correct
34 Correct 18 ms 16332 KB Output is correct
35 Correct 74 ms 78632 KB Output is correct
36 Correct 13 ms 14924 KB Output is correct
37 Correct 106 ms 81880 KB Output is correct
38 Correct 132 ms 117884 KB Output is correct
39 Correct 131 ms 118080 KB Output is correct
40 Correct 115 ms 118148 KB Output is correct
41 Correct 116 ms 118084 KB Output is correct
42 Execution timed out 1026 ms 118204 KB Time limit exceeded
43 Halted 0 ms 0 KB -