oj.uz

Submission #843728

# Submission time Handle Problem Language Result Execution time Memory
843728 2023-09-04T13:28:05 Z Tob Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 39 ms 165044 KB 
#include <bits/stdc++.h>

#define ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef pair <ll, ll> pii;

const int N = 30007, B = 200, inf = 1e9;

int n, m;
int b[N], p[N], dis[N*B];
vector <pii> adj[N*B];

int En(int x, int y = 0) {return y*N + x;}

int main () {
	FIO;
	cin >> n >> m;
	
	for (int i = 1; i < 3; i++) {
		for (int j = 0; j < n; j++) {
			if (j-i >= 0) adj[En(j, i)].pb({En(j-i, i), 1});
			if (j+i < n) adj[En(j, i)].pb({En(j+i, i), 1});
			adj[En(j, i)].pb({j, 0});
		}
	}
	
	for (int i = 0; i < m; i++) {
		cin >> b[i] >> p[i];
		if (p[i] < B) adj[b[i]].pb({En(b[i], p[i]), 0});
		else {
			for (int j = b[i]-p[i], k = 1; j >= 0; j -= p[i], k++) adj[b[i]].pb({j, k});
			for (int j = b[i]+p[i], k = 1; j < n; j += p[i], k++) adj[b[i]].pb({j, k});
		}
	}
	
	fill(dis, dis+N*B, inf);
	set <pii> s; s.insert({0, b[0]});
	dis[b[0]] = 0;
	while (!s.empty()) {
		auto p = s.begin();
		int x = (*p).S;
		s.erase(p);
		for (auto it : adj[x]) {
			int y = it.F, w = it.S;
			if (dis[x] + w < dis[y]) {
				if (dis[y] != inf) s.erase({dis[y], y});
				dis[y] = dis[x] + w;
				s.insert({dis[y], y});
			}
		}
	}
	if (dis[b[1]] != inf) cout << dis[b[1]] << "\n";
	else cout << "-1\n";

	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 164700 KB Output is correct
2 Correct 34 ms 164736 KB Output is correct
3 Correct 35 ms 165044 KB Output is correct
4 Correct 34 ms 164700 KB Output is correct
5 Correct 36 ms 164744 KB Output is correct
6 Incorrect 36 ms 164700 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 164692 KB Output is correct
2 Correct 34 ms 164700 KB Output is correct
3 Correct 34 ms 164764 KB Output is correct
4 Correct 34 ms 164692 KB Output is correct
5 Correct 35 ms 164776 KB Output is correct
6 Incorrect 35 ms 164700 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 164696 KB Output is correct
2 Correct 34 ms 164864 KB Output is correct
3 Correct 34 ms 164700 KB Output is correct
4 Correct 35 ms 164708 KB Output is correct
5 Correct 34 ms 164748 KB Output is correct
6 Incorrect 34 ms 164692 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 164692 KB Output is correct
2 Correct 39 ms 164948 KB Output is correct
3 Correct 37 ms 164952 KB Output is correct
4 Correct 35 ms 164700 KB Output is correct
5 Correct 34 ms 164952 KB Output is correct
6 Incorrect 38 ms 164696 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 164700 KB Output is correct
2 Correct 34 ms 164692 KB Output is correct
3 Correct 35 ms 164864 KB Output is correct
4 Correct 38 ms 164748 KB Output is correct
5 Correct 34 ms 164700 KB Output is correct
6 Incorrect 34 ms 164828 KB Output isn't correct
7 Halted 0 ms 0 KB -