oj.uz

Submission #47180

# Submission time Handle Problem Language Result Execution time Memory
47180 2018-04-28T14:27:33 Z platypus Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 134536 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);
	}
	//最短を求める
	LL dijkstra(V start, V finish) {
		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];
			if (vset[i] == finish) {
				return disti[i];
			}
		}
		abort();
	}
};

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;
	scanf("%d %d", &N, &M);
	using P = pair<int, int>;
	unordered_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;
		scanf("%d %d", &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)));
	}
	P endv{};
	for (int i = 0; i < len; ++i) {
		if (abs(i - (enb / enp)) == 0)
			endv = P(N, i * enp + enr);
	}
	LL ans = G.dijkstra(P(0, st), endv);
	if (ans >= LLONG_MAX / 9) {
		//cout << -1 << endl;
		printf("-1\n");
	}
	else {
		//cout << ans << endl;
		printf("%lld\n", ans);
	}
	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));
                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:119:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:127:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &b, &p);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 564 KB Output is correct
2 Correct 2 ms 564 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct
11 Correct 31 ms 1956 KB Output is correct
12 Correct 3 ms 1956 KB Output is correct
13 Correct 3 ms 1956 KB Output is correct
14 Correct 13 ms 2360 KB Output is correct
15 Correct 10 ms 2436 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2436 KB Output is correct
2 Correct 2 ms 2436 KB Output is correct
3 Correct 2 ms 2436 KB Output is correct
4 Correct 2 ms 2436 KB Output is correct
5 Correct 2 ms 2436 KB Output is correct
6 Correct 2 ms 2436 KB Output is correct
7 Correct 2 ms 2436 KB Output is correct
8 Correct 2 ms 2436 KB Output is correct
9 Correct 2 ms 2436 KB Output is correct
10 Correct 4 ms 2436 KB Output is correct
11 Correct 9 ms 2436 KB Output is correct
12 Correct 3 ms 2436 KB Output is correct
13 Correct 2 ms 2436 KB Output is correct
14 Correct 14 ms 2436 KB Output is correct
15 Correct 10 ms 2436 KB Output is correct
16 Correct 6 ms 2436 KB Output is correct
17 Correct 23 ms 4780 KB Output is correct
18 Correct 11 ms 4780 KB Output is correct
19 Correct 8 ms 4780 KB Output is correct
20 Correct 5 ms 4780 KB Output is correct
21 Correct 6 ms 4780 KB Output is correct
22 Correct 9 ms 4780 KB Output is correct
23 Correct 12 ms 4780 KB Output is correct
24 Correct 20 ms 4780 KB Output is correct
25 Correct 13 ms 4780 KB Output is correct
26 Correct 12 ms 4780 KB Output is correct
27 Correct 10 ms 4780 KB Output is correct
28 Correct 34 ms 6940 KB Output is correct
29 Correct 96 ms 17388 KB Output is correct
30 Correct 24 ms 17388 KB Output is correct
31 Correct 52 ms 17388 KB Output is correct
32 Correct 37 ms 17388 KB Output is correct
33 Correct 211 ms 33524 KB Output is correct
34 Correct 217 ms 33656 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 33656 KB Output is correct
2 Correct 2 ms 33656 KB Output is correct
3 Correct 2 ms 33656 KB Output is correct
4 Correct 2 ms 33656 KB Output is correct
5 Correct 2 ms 33656 KB Output is correct
6 Correct 2 ms 33656 KB Output is correct
7 Correct 2 ms 33656 KB Output is correct
8 Correct 2 ms 33656 KB Output is correct
9 Correct 3 ms 33656 KB Output is correct
10 Correct 5 ms 33656 KB Output is correct
11 Correct 8 ms 33656 KB Output is correct
12 Correct 3 ms 33656 KB Output is correct
13 Correct 3 ms 33656 KB Output is correct
14 Correct 10 ms 33656 KB Output is correct
15 Correct 9 ms 33656 KB Output is correct
16 Correct 6 ms 33656 KB Output is correct
17 Correct 24 ms 33656 KB Output is correct
18 Correct 12 ms 33656 KB Output is correct
19 Correct 8 ms 33656 KB Output is correct
20 Correct 5 ms 33656 KB Output is correct
21 Correct 5 ms 33656 KB Output is correct
22 Correct 40 ms 33656 KB Output is correct
23 Correct 11 ms 33656 KB Output is correct
24 Correct 21 ms 33656 KB Output is correct
25 Correct 13 ms 33656 KB Output is correct
26 Correct 11 ms 33656 KB Output is correct
27 Correct 12 ms 33656 KB Output is correct
28 Correct 39 ms 33656 KB Output is correct
29 Correct 94 ms 33656 KB Output is correct
30 Correct 24 ms 33656 KB Output is correct
31 Correct 50 ms 33656 KB Output is correct
32 Correct 35 ms 33656 KB Output is correct
33 Correct 215 ms 33728 KB Output is correct
34 Correct 204 ms 33728 KB Output is correct
35 Correct 230 ms 33728 KB Output is correct
36 Correct 31 ms 33728 KB Output is correct
37 Correct 410 ms 48884 KB Output is correct
38 Correct 395 ms 48884 KB Output is correct
39 Correct 378 ms 48884 KB Output is correct
40 Correct 419 ms 48884 KB Output is correct
41 Correct 388 ms 48884 KB Output is correct
42 Correct 20 ms 48884 KB Output is correct
43 Correct 16 ms 48884 KB Output is correct
44 Correct 11 ms 48884 KB Output is correct
45 Execution timed out 1084 ms 134344 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 134344 KB Output is correct
2 Correct 2 ms 134344 KB Output is correct
3 Correct 2 ms 134344 KB Output is correct
4 Correct 2 ms 134344 KB Output is correct
5 Correct 2 ms 134344 KB Output is correct
6 Correct 2 ms 134344 KB Output is correct
7 Correct 2 ms 134344 KB Output is correct
8 Correct 2 ms 134344 KB Output is correct
9 Correct 2 ms 134344 KB Output is correct
10 Correct 4 ms 134344 KB Output is correct
11 Correct 11 ms 134344 KB Output is correct
12 Correct 2 ms 134344 KB Output is correct
13 Correct 2 ms 134344 KB Output is correct
14 Correct 10 ms 134344 KB Output is correct
15 Correct 10 ms 134344 KB Output is correct
16 Correct 6 ms 134344 KB Output is correct
17 Correct 29 ms 134344 KB Output is correct
18 Correct 10 ms 134344 KB Output is correct
19 Correct 11 ms 134344 KB Output is correct
20 Correct 5 ms 134344 KB Output is correct
21 Correct 5 ms 134344 KB Output is correct
22 Correct 9 ms 134344 KB Output is correct
23 Correct 11 ms 134344 KB Output is correct
24 Correct 23 ms 134344 KB Output is correct
25 Correct 13 ms 134344 KB Output is correct
26 Correct 12 ms 134344 KB Output is correct
27 Correct 12 ms 134344 KB Output is correct
28 Correct 34 ms 134344 KB Output is correct
29 Correct 98 ms 134344 KB Output is correct
30 Correct 25 ms 134344 KB Output is correct
31 Correct 53 ms 134344 KB Output is correct
32 Correct 37 ms 134344 KB Output is correct
33 Correct 225 ms 134344 KB Output is correct
34 Correct 201 ms 134344 KB Output is correct
35 Correct 228 ms 134344 KB Output is correct
36 Correct 31 ms 134344 KB Output is correct
37 Correct 401 ms 134344 KB Output is correct
38 Correct 385 ms 134344 KB Output is correct
39 Correct 375 ms 134344 KB Output is correct
40 Correct 371 ms 134344 KB Output is correct
41 Correct 381 ms 134344 KB Output is correct
42 Correct 19 ms 134344 KB Output is correct
43 Correct 17 ms 134344 KB Output is correct
44 Correct 11 ms 134344 KB Output is correct
45 Execution timed out 1089 ms 134536 KB Time limit exceeded
46 Halted 0 ms 0 KB -