oj.uz

답안 #977953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977953 2024-05-08T14:30:42 Z SmuggingSpun Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 153 ms 67896 KB 
#include<bits/stdc++.h>
#define taskname "skyscraper"
using namespace std;
typedef long long ll;
template<class T>bool minimize(T& a, T b){
	if(a > b){
		a = b;
		return true;
	}
	return false;
}
const int lim = 3e4 + 5;
int n, m, b[lim], p[lim];
namespace sub1{
	void solve(){
		if(m == 2){
			return void(cout << (abs(b[0] - b[1]) % p[0] == 0 ? abs(b[0] - b[1]) / p[0] : -1));
		}
		int ans = (abs(b[0] - b[1]) % p[0] == 0 ? abs(b[0] - b[1]) / p[0] : INT_MAX);
		if(abs(b[0] - b[2]) % p[0] == 0 && abs(b[2] - b[1]) % p[2] == 0){
			minimize(ans, abs(b[0] - b[2]) / p[0] + abs(b[2] - b[1]) / p[2]);
		}
		cout << (ans == INT_MAX ? -1 : ans);
	}
}
namespace sub23{
	const int LIM = 2e3 + 5;
	int d[LIM];
	void solve(){
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
		memset(d, 0x0f, sizeof(d));
		pq.emplace(d[0] = 0, 0);
		while(!pq.empty()){
			auto [w, u] = pq.top();
			pq.pop();
			if(w == d[u]){
				for(int v = 0; v < m; v++){
					if(abs(b[u] - b[v]) % p[u] == 0 && minimize(d[v], w + abs(b[u] - b[v]) / p[u])){
						pq.emplace(d[v], v);
					}
				}
			}
		}
		cout << (d[1] == d[LIM - 1] ? -1 : d[1]);
	}
}
namespace sub4{
	const int LIM = 2e3 + 5;
	int d[LIM];
	vector<int>pos[LIM];
	void solve(){
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
		memset(d, 0x0f, sizeof(d));
		pq.emplace(d[b[0]] = 0, b[0]);
		for(int i = 0; i < m; i++){
			pos[b[i]].emplace_back(i);
		}
		while(!pq.empty()){
			auto [w, u] = pq.top();
			pq.pop();
			if(u == b[1]){
				return void(cout << w);
			}
			if(w == d[u]){
				for(int& index : pos[u]){
					for(int v = u - p[index], cnt = 1; v > -1; v -= p[index], cnt++){
						if(minimize(d[v], w + cnt)){
							pq.emplace(d[v], v);
						}
					}
					for(int v = u + p[index], cnt = 1; v < n; v += p[index], cnt++){
						if(minimize(d[v], w + cnt)){
							pq.emplace(d[v], v);
						}
					}
				}
			}
		}
		cout << -1;
	}
}
namespace sub5{
	vector<int>pai[lim];
	vector<pair<int, int>>e[lim];
	int d[lim];
	bool exist(int p, int v){
		auto it = lower_bound(pai[p].begin(), pai[p].end(), v);
		return it != pai[p].end() && *it == v;
	}
	void solve(){
		for(int i = 0; i < m; i++){
			pai[b[i]].emplace_back(p[i]);
		}
		for(int i = 0; i < n; i++){
			sort(pai[i].begin(), pai[i].end());
			pai[i].resize(unique(pai[i].begin(), pai[i].end()) - pai[i].begin());
		}
		for(int i = 0; i < n; i++){
			for(int& jump : pai[i]){
				for(int v = i - jump, cnt = 1; v > -1; v -= jump, cnt++){
					e[i].emplace_back(v, cnt);
					if(exist(v, jump)){
						break;
					}
				}
				for(int v = i + jump, cnt = 1; v < n; v += jump, cnt++){
					e[i].emplace_back(v, cnt);
					if(exist(v, jump)){
						break;
					}
				}
			}
		}
		memset(d, 0x0f, sizeof(d));
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
		pq.emplace(d[b[0]] = 0, b[0]);
		while(!pq.empty()){
			auto [w, u] = pq.top();
			pq.pop();
			if(u == b[1]){
				return void(cout << w);
			}
			if(w == d[u]){
				for(auto& [ev, ew] : e[u]){
					if(minimize(d[ev], w + ew)){
						pq.emplace(d[ev], ev);
					}
				}
			}
		}
		cout << -1;
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		cin >> b[i] >> p[i];
	}
	if(n <= 10 && m <= 3){
		sub1::solve();
	}
	else if(n <= 2000 && m <= 2000){
		sub23::solve();
	}
	else if(n <= 2000){
		sub4::solve();
	}
	else{
		sub5::solve();
	}
}

Compilation message

skyscraper.cpp: In function 'void sub23::solve()':
skyscraper.cpp:34:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'void sub4::solve()':
skyscraper.cpp:59:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'void sub5::solve()':
skyscraper.cpp:118:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  118 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp:124:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  124 |     for(auto& [ev, ew] : e[u]){
      |               ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:137:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 2140 KB Output is correct
11 Correct 21 ms 2012 KB Output is correct
12 Correct 19 ms 2236 KB Output is correct
13 Correct 19 ms 1884 KB Output is correct
14 Correct 22 ms 2060 KB Output is correct
15 Correct 21 ms 2136 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 2132 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 21 ms 2012 KB Output is correct
12 Correct 18 ms 1880 KB Output is correct
13 Correct 20 ms 1984 KB Output is correct
14 Correct 21 ms 1884 KB Output is correct
15 Correct 20 ms 2056 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 16 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 24 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 5 ms 1880 KB Output is correct
24 Correct 17 ms 1884 KB Output is correct
25 Correct 19 ms 1884 KB Output is correct
26 Correct 19 ms 1884 KB Output is correct
27 Correct 19 ms 1880 KB Output is correct
28 Correct 19 ms 1880 KB Output is correct
29 Correct 4 ms 1884 KB Output is correct
30 Correct 1 ms 1944 KB Output is correct
31 Correct 3 ms 2036 KB Output is correct
32 Correct 3 ms 1884 KB Output is correct
33 Correct 20 ms 1884 KB Output is correct
34 Correct 20 ms 1884 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 21 ms 2012 KB Output is correct
12 Correct 20 ms 1880 KB Output is correct
13 Correct 19 ms 1884 KB Output is correct
14 Correct 20 ms 1884 KB Output is correct
15 Correct 20 ms 1884 KB Output is correct
16 Correct 2 ms 1884 KB Output is correct
17 Correct 17 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 24 ms 1984 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1880 KB Output is correct
23 Correct 5 ms 1884 KB Output is correct
24 Correct 18 ms 1980 KB Output is correct
25 Correct 19 ms 2036 KB Output is correct
26 Correct 19 ms 1880 KB Output is correct
27 Correct 19 ms 1972 KB Output is correct
28 Correct 20 ms 1884 KB Output is correct
29 Correct 4 ms 1884 KB Output is correct
30 Correct 1 ms 1884 KB Output is correct
31 Correct 3 ms 2136 KB Output is correct
32 Correct 2 ms 1888 KB Output is correct
33 Correct 20 ms 2060 KB Output is correct
34 Correct 21 ms 1888 KB Output is correct
35 Correct 5 ms 2396 KB Output is correct
36 Correct 3 ms 1880 KB Output is correct
37 Correct 4 ms 2392 KB Output is correct
38 Correct 5 ms 2328 KB Output is correct
39 Correct 5 ms 2140 KB Output is correct
40 Correct 5 ms 2328 KB Output is correct
41 Correct 8 ms 2396 KB Output is correct
42 Correct 4 ms 2396 KB Output is correct
43 Correct 4 ms 2384 KB Output is correct
44 Correct 153 ms 2392 KB Output is correct
45 Correct 6 ms 2396 KB Output is correct
46 Correct 6 ms 2396 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 2136 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 2136 KB Output is correct
11 Correct 21 ms 2012 KB Output is correct
12 Correct 18 ms 1880 KB Output is correct
13 Correct 19 ms 1884 KB Output is correct
14 Correct 21 ms 2040 KB Output is correct
15 Correct 20 ms 1884 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 16 ms 1880 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 23 ms 1884 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 6 ms 1880 KB Output is correct
24 Correct 18 ms 1980 KB Output is correct
25 Correct 19 ms 1884 KB Output is correct
26 Correct 20 ms 1984 KB Output is correct
27 Correct 19 ms 2236 KB Output is correct
28 Correct 20 ms 1884 KB Output is correct
29 Correct 4 ms 1972 KB Output is correct
30 Correct 1 ms 1884 KB Output is correct
31 Correct 3 ms 1944 KB Output is correct
32 Correct 2 ms 1884 KB Output is correct
33 Correct 20 ms 1952 KB Output is correct
34 Correct 20 ms 1880 KB Output is correct
35 Correct 5 ms 2396 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 4 ms 2396 KB Output is correct
38 Correct 5 ms 2392 KB Output is correct
39 Correct 6 ms 2396 KB Output is correct
40 Correct 5 ms 2396 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 6 ms 2256 KB Output is correct
43 Correct 4 ms 2396 KB Output is correct
44 Correct 152 ms 2396 KB Output is correct
45 Correct 7 ms 2392 KB Output is correct
46 Correct 6 ms 2396 KB Output is correct
47 Correct 26 ms 11500 KB Output is correct
48 Correct 11 ms 4824 KB Output is correct
49 Correct 9 ms 4104 KB Output is correct
50 Correct 8 ms 3928 KB Output is correct
51 Correct 20 ms 6896 KB Output is correct
52 Correct 25 ms 7256 KB Output is correct
53 Correct 9 ms 3796 KB Output is correct
54 Correct 2 ms 2396 KB Output is correct
55 Correct 3 ms 2772 KB Output is correct
56 Correct 8 ms 3932 KB Output is correct
57 Correct 10 ms 10768 KB Output is correct
58 Correct 6 ms 3540 KB Output is correct
59 Correct 7 ms 3796 KB Output is correct
60 Correct 8 ms 4568 KB Output is correct
61 Correct 8 ms 3808 KB Output is correct
62 Correct 19 ms 8648 KB Output is correct
63 Correct 45 ms 25120 KB Output is correct
64 Correct 47 ms 28368 KB Output is correct
65 Correct 62 ms 37836 KB Output is correct
66 Correct 121 ms 67896 KB Output is correct
67 Correct 93 ms 67816 KB Output is correct