oj.uz

Submission #977885

# Submission time Handle Problem Language Result Execution time Memory
977885 2024-05-08T13:10:35 Z SmuggingSpun Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 24 ms 1240 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];
	bitset<LIM>vis;
	void solve(){
		vis.reset();
		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(!vis.test(u)){
				vis.set(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];
	bitset<LIM>vis;
	vector<int>pos[LIM];
	void solve(){
		vis.reset();
		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, 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(!vis.test(u)){
				vis.set(u);
				for(int& index : pos[u]){
					for(int v = u - p[index], cnt = 1; v > -1; v -= p[index], cnt++){
						if(minimize(d[v], d[u] + cnt)){
							pq.emplace(d[v], v);
						}
					}
					for(int v = u + p[index], cnt = 1; v < n; v += p[index], cnt++){
						if(minimize(d[v], d[u]) + cnt){
							pq.emplace(d[v], v);
						}
					}
				}
			}
		}
		cout << (d[b[1]] == d[LIM - 1] ? -1 : d[b[1]]);
	}
}
namespace sub5{
	void solve(){
		
	}
}
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:36:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   36 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'void sub4::solve()':
skyscraper.cpp:64:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |    auto [w, u] = pq.top();
      |         ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:93:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 412 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 20 ms 600 KB Output is correct
12 Correct 19 ms 348 KB Output is correct
13 Correct 19 ms 344 KB Output is correct
14 Correct 20 ms 604 KB Output is correct
15 Correct 20 ms 656 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 508 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 21 ms 604 KB Output is correct
12 Correct 19 ms 580 KB Output is correct
13 Correct 19 ms 544 KB Output is correct
14 Correct 20 ms 604 KB Output is correct
15 Correct 20 ms 760 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 16 ms 604 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 24 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 17 ms 348 KB Output is correct
25 Correct 21 ms 348 KB Output is correct
26 Correct 19 ms 344 KB Output is correct
27 Correct 19 ms 344 KB Output is correct
28 Correct 19 ms 548 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 20 ms 660 KB Output is correct
34 Correct 21 ms 660 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 21 ms 604 KB Output is correct
12 Correct 18 ms 348 KB Output is correct
13 Correct 19 ms 500 KB Output is correct
14 Correct 20 ms 604 KB Output is correct
15 Correct 20 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 15 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 24 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 17 ms 712 KB Output is correct
25 Correct 19 ms 604 KB Output is correct
26 Correct 19 ms 348 KB Output is correct
27 Correct 19 ms 600 KB Output is correct
28 Correct 19 ms 348 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 19 ms 652 KB Output is correct
34 Correct 21 ms 604 KB Output is correct
35 Incorrect 12 ms 1240 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 21 ms 604 KB Output is correct
12 Correct 19 ms 596 KB Output is correct
13 Correct 19 ms 576 KB Output is correct
14 Correct 20 ms 656 KB Output is correct
15 Correct 20 ms 656 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 15 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 496 KB Output is correct
20 Correct 24 ms 348 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 17 ms 576 KB Output is correct
25 Correct 19 ms 604 KB Output is correct
26 Correct 19 ms 344 KB Output is correct
27 Correct 19 ms 580 KB Output is correct
28 Correct 20 ms 348 KB Output is correct
29 Correct 3 ms 344 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 20 ms 604 KB Output is correct
34 Correct 21 ms 660 KB Output is correct
35 Incorrect 14 ms 1240 KB Output isn't correct
36 Halted 0 ms 0 KB -