oj.uz

Submission #47171

# Submission time Handle Problem Language Result Execution time Memory
47171 2018-04-28T13:25:16 Z platypus Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 134584 KB 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;

namespace std {
	template <>
	class hash<std::pair<int, int>> {
	public:
		size_t operator()(const std::pair<int, int>& x) const {
			//return hash<int>()(x.first) ^ hash<int>()(x.second);
			return (size_t)(x.second ^ x.first + 0x9e3779b9 + (x.second << 6) + (x.second >> 2));
		}
	};
}

//Vは比較可能な値にする
template <typename V>
class Graph {
private:
	//unordered_map<V, vector<pair<V, LL>>>edge;
	vector<pair<pair<V, V>, LL>>raw;
	vector<V>vset;
public:
	//from->toへcostの辺を張る
	void addEdge(V from, V to, LL cost) {
		//edge[from].push_back(make_pair(to, cost));
		raw.push_back(make_pair(make_pair(from, to), cost));
		vset.push_back(from);
		vset.push_back(to);
	}
	//v1とv2間にcostの辺を張る
	void addUndirectedEdge(V v1, V v2, LL cost) {
		//edge[v1].push_back(make_pair(v2, cost));
		//edge[v2].push_back(make_pair(v1, cost));
		raw.push_back(make_pair(make_pair(v1, v2), cost));
		raw.push_back(make_pair(make_pair(v2, v1), cost));
		vset.push_back(v1);
		vset.push_back(v2);
	}
	//最短を求める
	void dijkstra(V start, map<V, LL>&dist) {
		sort(vset.begin(), vset.end());
		vset.erase(unique(vset.begin(), vset.end()), vset.end());
		int vnum = vset.size();
		vector<LL>disti(vnum, LLONG_MAX / 9);
		unordered_map<V, int>inv;
		for (int i = 0; i < vnum; ++i) {
			inv[vset[i]] = i;
		}
		vector<vector<pair<int, LL>>>edgei(vnum);
		for (auto& e : raw) {
			edgei[inv[e.first.first]].push_back(make_pair(inv[e.first.second], e.second));
		}
		//dist[start] = 0;
		//priority_queue<pair<LL, V>, vector<pair<LL, V>>, greater<pair<LL, V>>>que;
		disti[inv[start]] = 0;
		priority_queue<pair<LL, int>, vector<pair<LL, int>>, greater<pair<LL, int>>>que;
		que.push(make_pair(0LL, inv[start]));
		while (!que.empty()) {
			auto q = que.top();
			que.pop();
			int now = q.second;
			LL dis = q.first;
			if (disti[now] < dis) continue;
			for (auto e : edgei[now]) {
				int nxt = e.first;
				LL cost = e.second;
				if (/*!disti.count(nxt)  ||*/ disti[nxt] > disti[now] + cost) {
					disti[nxt] = disti[now] + cost;
					que.push(make_pair(disti[nxt], nxt));
				}
			}
		}
		for (int i = 0; i < vnum; ++i) {
			dist[vset[i]] = disti[i];
		}
	}
};

int N, M;

int mceil(int a, int b) {
	if (a == 0)return 0;
	return (a - 1) / b + 1;
}

int main(void)
{
	cin >> N >> M;
	using P = pair<int, int>;
	map<P, vector<int>>mp;
	int st = -1;
	int enb = -1, enp = -1, enr = -1;
	for (int i = 0; i < M; ++i) {
		int b, p;
		cin >> b >> p;
		if (i == 0)st = b;
		if (i == 1) {
			enb = b;
			enp = p;
			enr = b % p;
		}
		int rem = b % p;
		mp[make_pair(p, rem)].push_back(b);
	}
	Graph<P>G;
	for (auto elm : mp) {
		int p = elm.first.first;
		int rem = elm.first.second;
		auto& v = elm.second;
		int len = mceil(N - rem, p);
		vector<LL>dist(len, INT_MAX);
		for (int x : v)dist[x / p] = 0;
		/*for (int i = 1; i < len; ++i) {
			dist[i] = min(dist[i - 1] + 1, dist[i]);
		}
		for (int i = len - 1; i > 0; --i) {
			dist[i - 1] = min(dist[i] + 1, dist[i - 1]);
		}*/
		for (int i = 0; i < len; ++i) {
			if (dist[i] < INT_MAX)G.addEdge(P(0, i * p + rem), P(p, i * p + rem), dist[i]);
			G.addEdge(P(p, i * p + rem), P(0, i * p + rem), 0LL);
		}
		for (int i = 1; i < len; ++i) {
			G.addUndirectedEdge(P(p, (i - 1)*p + rem), P(p, i*p + rem), 1LL);
		}
	}
	int len = mceil(N - enr, enp);
	for (int i = 0; i < len; ++i) {
		if (abs(i - (enb / enp)) == 0)
			G.addEdge(P(0, i * enp + enr), P(N, i * enp + enr), abs(i - (enb / enp)));
	}
	map<P, LL> dist;
	G.dijkstra(P(0, st), dist);
	LL ans = LLONG_MAX;
	for (int i = 0; i < len; ++i) {
		if (abs(i - (enb / enp)) == 0 && dist.count(P(N, i * enp + enr)))
			ans = min(ans, dist[P(N, i * enp + enr)]);
	}
	if (ans >= LLONG_MAX / 9) {
		cout << -1 << endl;
	}
	else {
		cout << ans << endl;
	}
	return 0;
}

Compilation message

skyscraper.cpp: In member function 'std::size_t std::hash<std::pair<int, int> >::operator()(const std::pair<int, int>&) const':
skyscraper.cpp:36:70: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
    return (size_t)(x.second ^ x.first + 0x9e3779b9 + (x.second << 6) + (x.second >> 2));
                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 292 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 624 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 624 KB Output is correct
4 Correct 2 ms 624 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 5 ms 1276 KB Output is correct
11 Correct 9 ms 2108 KB Output is correct
12 Correct 3 ms 2108 KB Output is correct
13 Correct 3 ms 2108 KB Output is correct
14 Correct 11 ms 2748 KB Output is correct
15 Correct 12 ms 2748 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2748 KB Output is correct
2 Correct 2 ms 2748 KB Output is correct
3 Correct 2 ms 2748 KB Output is correct
4 Correct 2 ms 2748 KB Output is correct
5 Correct 2 ms 2748 KB Output is correct
6 Correct 2 ms 2748 KB Output is correct
7 Correct 2 ms 2748 KB Output is correct
8 Correct 2 ms 2748 KB Output is correct
9 Correct 3 ms 2748 KB Output is correct
10 Correct 4 ms 2748 KB Output is correct
11 Correct 10 ms 2748 KB Output is correct
12 Correct 4 ms 2748 KB Output is correct
13 Correct 3 ms 2748 KB Output is correct
14 Correct 11 ms 2748 KB Output is correct
15 Correct 12 ms 2748 KB Output is correct
16 Correct 9 ms 2748 KB Output is correct
17 Correct 34 ms 5808 KB Output is correct
18 Correct 12 ms 5808 KB Output is correct
19 Correct 9 ms 5808 KB Output is correct
20 Correct 7 ms 5808 KB Output is correct
21 Correct 8 ms 5808 KB Output is correct
22 Correct 11 ms 5808 KB Output is correct
23 Correct 15 ms 5808 KB Output is correct
24 Correct 25 ms 5808 KB Output is correct
25 Correct 17 ms 5808 KB Output is correct
26 Correct 14 ms 5808 KB Output is correct
27 Correct 13 ms 5808 KB Output is correct
28 Correct 41 ms 8464 KB Output is correct
29 Correct 113 ms 21388 KB Output is correct
30 Correct 31 ms 21388 KB Output is correct
31 Correct 68 ms 21388 KB Output is correct
32 Correct 44 ms 21388 KB Output is correct
33 Correct 232 ms 41204 KB Output is correct
34 Correct 232 ms 41264 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 41264 KB Output is correct
2 Correct 2 ms 41264 KB Output is correct
3 Correct 2 ms 41264 KB Output is correct
4 Correct 2 ms 41264 KB Output is correct
5 Correct 2 ms 41264 KB Output is correct
6 Correct 2 ms 41264 KB Output is correct
7 Correct 2 ms 41264 KB Output is correct
8 Correct 2 ms 41264 KB Output is correct
9 Correct 2 ms 41264 KB Output is correct
10 Correct 4 ms 41264 KB Output is correct
11 Correct 9 ms 41264 KB Output is correct
12 Correct 3 ms 41264 KB Output is correct
13 Correct 3 ms 41264 KB Output is correct
14 Correct 11 ms 41264 KB Output is correct
15 Correct 12 ms 41264 KB Output is correct
16 Correct 7 ms 41264 KB Output is correct
17 Correct 26 ms 41264 KB Output is correct
18 Correct 12 ms 41264 KB Output is correct
19 Correct 9 ms 41264 KB Output is correct
20 Correct 7 ms 41264 KB Output is correct
21 Correct 6 ms 41264 KB Output is correct
22 Correct 11 ms 41264 KB Output is correct
23 Correct 13 ms 41264 KB Output is correct
24 Correct 29 ms 41264 KB Output is correct
25 Correct 16 ms 41264 KB Output is correct
26 Correct 15 ms 41264 KB Output is correct
27 Correct 13 ms 41264 KB Output is correct
28 Correct 44 ms 41264 KB Output is correct
29 Correct 113 ms 41264 KB Output is correct
30 Correct 30 ms 41264 KB Output is correct
31 Correct 64 ms 41264 KB Output is correct
32 Correct 44 ms 41264 KB Output is correct
33 Correct 235 ms 41344 KB Output is correct
34 Correct 235 ms 41344 KB Output is correct
35 Correct 257 ms 41344 KB Output is correct
36 Correct 39 ms 41344 KB Output is correct
37 Correct 441 ms 59212 KB Output is correct
38 Correct 440 ms 59212 KB Output is correct
39 Correct 487 ms 59212 KB Output is correct
40 Correct 433 ms 59212 KB Output is correct
41 Correct 455 ms 59212 KB Output is correct
42 Correct 31 ms 59212 KB Output is correct
43 Correct 28 ms 59212 KB Output is correct
44 Correct 26 ms 59212 KB Output is correct
45 Execution timed out 1084 ms 134364 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 134364 KB Output is correct
2 Correct 3 ms 134364 KB Output is correct
3 Correct 2 ms 134364 KB Output is correct
4 Correct 2 ms 134364 KB Output is correct
5 Correct 2 ms 134364 KB Output is correct
6 Correct 2 ms 134364 KB Output is correct
7 Correct 2 ms 134364 KB Output is correct
8 Correct 2 ms 134364 KB Output is correct
9 Correct 2 ms 134364 KB Output is correct
10 Correct 4 ms 134364 KB Output is correct
11 Correct 9 ms 134364 KB Output is correct
12 Correct 3 ms 134364 KB Output is correct
13 Correct 3 ms 134364 KB Output is correct
14 Correct 11 ms 134364 KB Output is correct
15 Correct 11 ms 134364 KB Output is correct
16 Correct 7 ms 134364 KB Output is correct
17 Correct 30 ms 134364 KB Output is correct
18 Correct 12 ms 134364 KB Output is correct
19 Correct 9 ms 134364 KB Output is correct
20 Correct 7 ms 134364 KB Output is correct
21 Correct 6 ms 134364 KB Output is correct
22 Correct 11 ms 134364 KB Output is correct
23 Correct 13 ms 134364 KB Output is correct
24 Correct 26 ms 134364 KB Output is correct
25 Correct 23 ms 134364 KB Output is correct
26 Correct 18 ms 134364 KB Output is correct
27 Correct 13 ms 134364 KB Output is correct
28 Correct 42 ms 134364 KB Output is correct
29 Correct 126 ms 134364 KB Output is correct
30 Correct 42 ms 134364 KB Output is correct
31 Correct 71 ms 134364 KB Output is correct
32 Correct 45 ms 134364 KB Output is correct
33 Correct 254 ms 134364 KB Output is correct
34 Correct 247 ms 134364 KB Output is correct
35 Correct 260 ms 134364 KB Output is correct
36 Correct 38 ms 134364 KB Output is correct
37 Correct 467 ms 134364 KB Output is correct
38 Correct 467 ms 134364 KB Output is correct
39 Correct 455 ms 134364 KB Output is correct
40 Correct 430 ms 134364 KB Output is correct
41 Correct 446 ms 134364 KB Output is correct
42 Correct 30 ms 134364 KB Output is correct
43 Correct 28 ms 134364 KB Output is correct
44 Correct 31 ms 134364 KB Output is correct
45 Execution timed out 1085 ms 134584 KB Time limit exceeded
46 Halted 0 ms 0 KB -