oj.uz

답안 #389748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
389748 2021-04-14T12:43:36 Z milleniumEeee Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 616 ms 262148 KB 
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pii pair<int, int>
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define fastInp ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
 
const int MAXN = 30005;
const int SHIFT = 50000;
const int S = 175;
const int INF = 1e9;
 
int pos[MAXN], p[MAXN];
int n, m;
 
struct node {
	int v, pw, cost;
	node () {
		
	}
	node (int v_, int pw_, int cost_) {
		v = v_;
		pw = pw_;
		cost = cost_;
	}
};
 
struct Compare_node {
	bool operator () (node const &p1, node const &p2) {
		if (p1.cost != p2.cost) {
			return p1.cost < p2.cost;			
		}
		if (p1.v != p2.v) {
			return p1.v < p2.v;
		}
		return p1.pw < p2.pw;
	}
};
 
vector <int> big[MAXN];
vector <int> small[MAXN];
vector <node> g[MAXN][S];
int dist[MAXN][S];
 
bool in(int pos) {
	return 0 <= pos && pos < n;
}
 
signed main() {
	fastInp;
	cin >> n >> m;
	set <int> all_small;
	for (int i = 0; i < m; i++) {
		cin >> pos[i] >> p[i];
		if (p[i] >= S) {
			big[pos[i]].pb(p[i]);
		} else {
			small[pos[i]].pb(p[i]);
			all_small.insert(p[i]);
		}
	}
	// node -> v pw cost
	for (int i = 0; i < n; i++) {
		for (int val : all_small) {
			if (in(i - val)) {
				g[i][val].pb(node(i - val, val, 1));
			}
			if (in(i + val)) {
				g[i][val].pb(node(i + val, val, 1));
			}
		}
		sort(all(small[i]));
		small[i].erase(unique(all(small[i])), small[i].end());
		for (int val : small[i]) {
			g[i][0].pb(node(i, val, 0));
		}
	}
	set <node, Compare_node> pq;
	vector <bool> used(MAXN, false);
	memset(dist, -1, sizeof(dist));
	pq.insert(node(pos[0], 0, 0));
	dist[pos[0]][0] = 0;
	
	auto ers = [&](int v, int pw) {
		//auto it = pq.lower_bound(node(v, pw, -INF));
		//if (it != pq.end() && it->v == v && it->pw == pw) {
			//pq.erase(it);
		//}
	};
	
	while (!pq.empty()) {
		int v = pq.begin()->v;
		int pw = pq.begin()->pw;
		int cost = pq.begin()->cost;
		pq.erase(pq.begin());
		if (cost > dist[v][pw]) {
			continue;
		}
		if (!used[v]) { // впервые добрались до v
			used[v] = 1;
			for (int el : big[v]) {
				for (int to = v % el; to < n; to += el) {
					int c = abs(v - to) / el;
					if (dist[to][0] == -1 || dist[to][0] > cost + c) {
						dist[to][0] = cost + c;
						ers(to, 0);
						pq.insert(node(to, 0, dist[to][0]));
					}
				}
			}
		}
		// change our pw
		if (dist[v][0] == -1 || dist[v][0] > dist[v][pw]) {
			dist[v][0] = dist[v][pw];
			ers(v, 0);
			pq.insert(node(v, 0, dist[v][pw]));
		}
		for (auto el : g[v][pw]) {
			int new_v = el.v;
			int new_pw = el.pw;			
			int c = el.cost;
			if (dist[new_v][new_pw] == -1 || dist[new_v][new_pw] > dist[v][pw] + c) {
				dist[new_v][new_pw] = dist[v][pw] + c;
				ers(new_v, new_pw);
				pq.insert(node(new_v, new_pw, dist[new_v][new_pw]));
			}
		}
	}
	cout << dist[pos[1]][0] << endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 145592 KB Output is correct
2 Correct 80 ms 145476 KB Output is correct
3 Correct 79 ms 145496 KB Output is correct
4 Correct 83 ms 145480 KB Output is correct
5 Correct 81 ms 145476 KB Output is correct
6 Correct 80 ms 145544 KB Output is correct
7 Correct 80 ms 145476 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 145464 KB Output is correct
2 Correct 84 ms 145468 KB Output is correct
3 Correct 81 ms 145468 KB Output is correct
4 Correct 83 ms 145560 KB Output is correct
5 Correct 81 ms 145524 KB Output is correct
6 Correct 79 ms 145604 KB Output is correct
7 Correct 80 ms 145476 KB Output is correct
8 Correct 84 ms 145604 KB Output is correct
9 Correct 81 ms 145604 KB Output is correct
10 Correct 83 ms 145840 KB Output is correct
11 Correct 84 ms 145908 KB Output is correct
12 Correct 85 ms 145656 KB Output is correct
13 Correct 81 ms 145576 KB Output is correct
14 Correct 83 ms 145924 KB Output is correct
15 Correct 83 ms 145860 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 145568 KB Output is correct
2 Correct 81 ms 145496 KB Output is correct
3 Correct 81 ms 145480 KB Output is correct
4 Correct 80 ms 145536 KB Output is correct
5 Correct 93 ms 145560 KB Output is correct
6 Correct 86 ms 145476 KB Output is correct
7 Correct 80 ms 145560 KB Output is correct
8 Correct 80 ms 145544 KB Output is correct
9 Correct 80 ms 145620 KB Output is correct
10 Correct 81 ms 145792 KB Output is correct
11 Correct 84 ms 145864 KB Output is correct
12 Correct 80 ms 145660 KB Output is correct
13 Correct 81 ms 145544 KB Output is correct
14 Correct 87 ms 146040 KB Output is correct
15 Correct 89 ms 145944 KB Output is correct
16 Correct 83 ms 146476 KB Output is correct
17 Correct 99 ms 149696 KB Output is correct
18 Correct 95 ms 149956 KB Output is correct
19 Correct 89 ms 147952 KB Output is correct
20 Correct 82 ms 145780 KB Output is correct
21 Correct 92 ms 146532 KB Output is correct
22 Correct 92 ms 148548 KB Output is correct
23 Correct 95 ms 149072 KB Output is correct
24 Correct 108 ms 152152 KB Output is correct
25 Correct 82 ms 145756 KB Output is correct
26 Correct 100 ms 151120 KB Output is correct
27 Correct 89 ms 148172 KB Output is correct
28 Correct 121 ms 151108 KB Output is correct
29 Correct 108 ms 147544 KB Output is correct
30 Correct 84 ms 146060 KB Output is correct
31 Correct 88 ms 146620 KB Output is correct
32 Correct 100 ms 146348 KB Output is correct
33 Correct 116 ms 149760 KB Output is correct
34 Correct 137 ms 149700 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 145476 KB Output is correct
2 Correct 83 ms 145448 KB Output is correct
3 Correct 84 ms 145544 KB Output is correct
4 Correct 84 ms 145560 KB Output is correct
5 Correct 83 ms 145452 KB Output is correct
6 Correct 85 ms 145516 KB Output is correct
7 Correct 92 ms 145532 KB Output is correct
8 Correct 85 ms 145568 KB Output is correct
9 Correct 87 ms 145568 KB Output is correct
10 Correct 85 ms 145788 KB Output is correct
11 Correct 89 ms 145912 KB Output is correct
12 Correct 87 ms 145588 KB Output is correct
13 Correct 87 ms 145544 KB Output is correct
14 Correct 95 ms 145904 KB Output is correct
15 Correct 87 ms 145896 KB Output is correct
16 Correct 88 ms 146424 KB Output is correct
17 Correct 104 ms 149712 KB Output is correct
18 Correct 99 ms 149956 KB Output is correct
19 Correct 92 ms 148088 KB Output is correct
20 Correct 87 ms 145712 KB Output is correct
21 Correct 83 ms 146560 KB Output is correct
22 Correct 90 ms 148548 KB Output is correct
23 Correct 94 ms 149116 KB Output is correct
24 Correct 123 ms 152136 KB Output is correct
25 Correct 82 ms 145732 KB Output is correct
26 Correct 100 ms 151108 KB Output is correct
27 Correct 90 ms 148140 KB Output is correct
28 Correct 106 ms 151044 KB Output is correct
29 Correct 120 ms 147560 KB Output is correct
30 Correct 85 ms 146132 KB Output is correct
31 Correct 93 ms 146576 KB Output is correct
32 Correct 88 ms 146348 KB Output is correct
33 Correct 119 ms 149720 KB Output is correct
34 Correct 117 ms 149720 KB Output is correct
35 Correct 152 ms 154024 KB Output is correct
36 Correct 119 ms 151264 KB Output is correct
37 Correct 170 ms 156984 KB Output is correct
38 Correct 161 ms 157340 KB Output is correct
39 Correct 163 ms 157324 KB Output is correct
40 Correct 164 ms 157280 KB Output is correct
41 Correct 169 ms 157296 KB Output is correct
42 Correct 108 ms 151372 KB Output is correct
43 Correct 96 ms 148460 KB Output is correct
44 Correct 86 ms 146036 KB Output is correct
45 Correct 205 ms 158332 KB Output is correct
46 Correct 206 ms 158244 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 145516 KB Output is correct
2 Correct 79 ms 145496 KB Output is correct
3 Correct 80 ms 145476 KB Output is correct
4 Correct 86 ms 145476 KB Output is correct
5 Correct 82 ms 145492 KB Output is correct
6 Correct 90 ms 145536 KB Output is correct
7 Correct 81 ms 145552 KB Output is correct
8 Correct 87 ms 145540 KB Output is correct
9 Correct 90 ms 145608 KB Output is correct
10 Correct 80 ms 145748 KB Output is correct
11 Correct 91 ms 145936 KB Output is correct
12 Correct 80 ms 145604 KB Output is correct
13 Correct 79 ms 145604 KB Output is correct
14 Correct 90 ms 145820 KB Output is correct
15 Correct 90 ms 145872 KB Output is correct
16 Correct 84 ms 146476 KB Output is correct
17 Correct 113 ms 149688 KB Output is correct
18 Correct 101 ms 149984 KB Output is correct
19 Correct 86 ms 148036 KB Output is correct
20 Correct 81 ms 145680 KB Output is correct
21 Correct 85 ms 146568 KB Output is correct
22 Correct 92 ms 148564 KB Output is correct
23 Correct 101 ms 149132 KB Output is correct
24 Correct 120 ms 152208 KB Output is correct
25 Correct 88 ms 145732 KB Output is correct
26 Correct 108 ms 151072 KB Output is correct
27 Correct 94 ms 148088 KB Output is correct
28 Correct 112 ms 151004 KB Output is correct
29 Correct 108 ms 147628 KB Output is correct
30 Correct 90 ms 146148 KB Output is correct
31 Correct 94 ms 146680 KB Output is correct
32 Correct 92 ms 146408 KB Output is correct
33 Correct 116 ms 149760 KB Output is correct
34 Correct 119 ms 149744 KB Output is correct
35 Correct 134 ms 154060 KB Output is correct
36 Correct 108 ms 151224 KB Output is correct
37 Correct 201 ms 156888 KB Output is correct
38 Correct 175 ms 157324 KB Output is correct
39 Correct 167 ms 157256 KB Output is correct
40 Correct 172 ms 157344 KB Output is correct
41 Correct 165 ms 157252 KB Output is correct
42 Correct 112 ms 151416 KB Output is correct
43 Correct 98 ms 148392 KB Output is correct
44 Correct 91 ms 146020 KB Output is correct
45 Correct 203 ms 158328 KB Output is correct
46 Correct 204 ms 158276 KB Output is correct
47 Correct 616 ms 214780 KB Output is correct
48 Correct 378 ms 225372 KB Output is correct
49 Correct 380 ms 209692 KB Output is correct
50 Correct 296 ms 204500 KB Output is correct
51 Correct 568 ms 250064 KB Output is correct
52 Runtime error 471 ms 262148 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -