oj.uz

Submission #977921

# Submission time Handle Problem Language Result Execution time Memory
977921 2024-05-08T13:59:01 Z SmuggingSpun Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 20052 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{
	const int SIZE = 100;
	vector<int>pos[lim];
	vector<vector<int>>e[SIZE];
	int d[lim];
	void solve(){
		for(int i = 1; i < SIZE; i++){
			e[i].resize(i);
		}
		for(int i = 0; i < m; i++){
			pos[b[i]].emplace_back(i);
			for(int j = 1; j < SIZE; j++){
				e[j][b[i] % j].emplace_back(b[i]);
			}
		}
		for(int i = 0; i < n; i++){
			sort(pos[i].begin(), pos[i].end());
			pos[i].resize(unique(pos[i].begin(), pos[i].end()) - pos[i].begin());
		}
		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]);
		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]){
					if(p[index] < SIZE){
						for(int& v : e[p[index]][u % p[index]]){
							if(minimize(d[v], w + abs(v - u) / p[index])){
								pq.emplace(d[v], v);
							}
						}
					}
					else{
						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;
	}
}
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){
		sub5::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:105:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  105 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:140:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  140 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 0 ms 1272 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1136 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 20 ms 1116 KB Output is correct
12 Correct 19 ms 1280 KB Output is correct
13 Correct 18 ms 1112 KB Output is correct
14 Correct 20 ms 1112 KB Output is correct
15 Correct 20 ms 1112 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 2 ms 1272 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 21 ms 1116 KB Output is correct
12 Correct 19 ms 1116 KB Output is correct
13 Correct 19 ms 1116 KB Output is correct
14 Correct 22 ms 1116 KB Output is correct
15 Correct 21 ms 1272 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 17 ms 1308 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 24 ms 1296 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 5 ms 1116 KB Output is correct
24 Correct 17 ms 1116 KB Output is correct
25 Correct 20 ms 1304 KB Output is correct
26 Correct 19 ms 1112 KB Output is correct
27 Correct 19 ms 1116 KB Output is correct
28 Correct 20 ms 1244 KB Output is correct
29 Correct 4 ms 1116 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 3 ms 1116 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 20 ms 1116 KB Output is correct
34 Correct 20 ms 1116 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1256 KB Output is correct
11 Correct 22 ms 1116 KB Output is correct
12 Correct 19 ms 1116 KB Output is correct
13 Correct 18 ms 1280 KB Output is correct
14 Correct 22 ms 1116 KB Output is correct
15 Correct 20 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 16 ms 1308 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 24 ms 1116 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 5 ms 1248 KB Output is correct
24 Correct 18 ms 1116 KB Output is correct
25 Correct 19 ms 1116 KB Output is correct
26 Correct 19 ms 1116 KB Output is correct
27 Correct 20 ms 1284 KB Output is correct
28 Correct 19 ms 1116 KB Output is correct
29 Correct 4 ms 1116 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 20 ms 1356 KB Output is correct
34 Correct 21 ms 1268 KB Output is correct
35 Correct 44 ms 17540 KB Output is correct
36 Correct 8 ms 4440 KB Output is correct
37 Correct 35 ms 13736 KB Output is correct
38 Correct 57 ms 20048 KB Output is correct
39 Correct 38 ms 19800 KB Output is correct
40 Correct 38 ms 19796 KB Output is correct
41 Correct 39 ms 19804 KB Output is correct
42 Correct 27 ms 14684 KB Output is correct
43 Correct 25 ms 14428 KB Output is correct
44 Execution timed out 1094 ms 15332 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1368 KB Output is correct
11 Correct 21 ms 1116 KB Output is correct
12 Correct 18 ms 1116 KB Output is correct
13 Correct 18 ms 1280 KB Output is correct
14 Correct 20 ms 1116 KB Output is correct
15 Correct 20 ms 1352 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 16 ms 1304 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 23 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 5 ms 1116 KB Output is correct
24 Correct 17 ms 1116 KB Output is correct
25 Correct 18 ms 1112 KB Output is correct
26 Correct 19 ms 1116 KB Output is correct
27 Correct 18 ms 1248 KB Output is correct
28 Correct 19 ms 1116 KB Output is correct
29 Correct 4 ms 1112 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 20 ms 1116 KB Output is correct
34 Correct 20 ms 1340 KB Output is correct
35 Correct 45 ms 17492 KB Output is correct
36 Correct 8 ms 4440 KB Output is correct
37 Correct 31 ms 13696 KB Output is correct
38 Correct 46 ms 20052 KB Output is correct
39 Correct 38 ms 19792 KB Output is correct
40 Correct 39 ms 19792 KB Output is correct
41 Correct 41 ms 19976 KB Output is correct
42 Correct 26 ms 14684 KB Output is correct
43 Correct 25 ms 14644 KB Output is correct
44 Execution timed out 1049 ms 15452 KB Time limit exceeded
45 Halted 0 ms 0 KB -