oj.uz

Submission #536017

# Submission time Handle Problem Language Result Execution time Memory
536017 2022-03-12T06:46:10 Z PoPularPlusPlus Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 582 ms 142200 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
 
//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);
 
void solve(){
	int n , m;
	cin >> n >> m;
	int rt = 50;
	vector<pair<int,int>> adj[n + 1][rt+1];
	vector<int> v[n];
	int s , e;
	for(int i = 0; i < m; i++){
		int b , p;
		cin >> b >> p;
		if(i == 0)s = b;
		if(i == 1)e = b;
		if(p <= rt)
			v[b].pb(p);
		if(p > rt){
			int pos = b , dis = 0;
			while(pos - p >= 0){
				pos -= p;
				dis++;
				adj[b][0].pb(mp(pos , dis));
			}
			pos = b;
			dis = 0;
			while(pos + p < n){
				pos += p;
				dis++;
				adj[b][0].pb(mp(pos , dis));
			}
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 1; j <= rt; j++){
			if(i - j >= 0){
				adj[i][j].pb(mp(i-j , 1));
			}
			if(i + j < n){
				adj[i][j].pb(mp(i+j , 1));
			}
		}
	}
	int dis[n][rt+1];
	for(int i = 0; i < n; i++){
		for(int j = 0; j <= rt; j++){
			dis[i][j] = 1e9;
		}
	}
	priority_queue< pair<int,pair<int,int>> , vector<pair<int,pair<int,int>>> , greater<pair<int,pair<int,int>>> > pq;
	dis[s][0] = 0;
	pq.push(mp(0 , mp(s , 0)));
	while(pq.size()){
		int di = pq.top().vf , pos = pq.top().vs.vf , pow = pq.top().vs.vs;
		//cout << di << ' ' << pos << ' ' << pow << '\n';
		pq.pop();
		//cout << pos << ' ' << pow << endl;
		if(dis[pos][pow] < di)continue;
		if(pow == 0){
			for(int i : v[pos]){
				pq.push(mp(di , mp(pos , i)));
			}
		}
		for(auto i : adj[pos][pow]){
			if(dis[i.vf][pow] > di + i.vs){
				dis[i.vf][pow] = di + i.vs;
				if(pow != 0 && dis[i.vf][0] > di + i.vs){
					dis[i.vf][0] = di + i.vs;
					pq.push(mp(di + i.vs,mp(i.vf , 0)));
				}
				pq.push(mp(di + i.vs , mp(i.vf , pow)));
			}
		}
	}
	cout << (dis[e][0] == 1e9 ? -1 : dis[e][0]) << '\n';
}
 
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Compilation message

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:8:30: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
    8 | #define mp(a,b) make_pair(a,b)
      |                              ^
skyscraper.cpp:27:6: note: 's' was declared here
   27 |  int s , e;
      |      ^
skyscraper.cpp:92:19: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |  cout << (dis[e][0] == 1e9 ? -1 : dis[e][0]) << '\n';
      |           ~~~~~~~~^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 584 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 6 ms 2624 KB Output is correct
18 Correct 9 ms 5460 KB Output is correct
19 Correct 10 ms 6228 KB Output is correct
20 Correct 11 ms 6356 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 10 ms 5568 KB Output is correct
23 Correct 13 ms 5076 KB Output is correct
24 Correct 13 ms 6108 KB Output is correct
25 Correct 12 ms 6276 KB Output is correct
26 Correct 13 ms 6284 KB Output is correct
27 Correct 16 ms 6356 KB Output is correct
28 Correct 12 ms 6380 KB Output is correct
29 Correct 18 ms 6240 KB Output is correct
30 Correct 13 ms 6212 KB Output is correct
31 Correct 16 ms 6304 KB Output is correct
32 Correct 14 ms 6272 KB Output is correct
33 Correct 30 ms 6620 KB Output is correct
34 Correct 33 ms 6688 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 572 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 584 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 7 ms 2632 KB Output is correct
18 Correct 10 ms 5496 KB Output is correct
19 Correct 11 ms 6260 KB Output is correct
20 Correct 11 ms 6256 KB Output is correct
21 Correct 2 ms 1480 KB Output is correct
22 Correct 9 ms 5612 KB Output is correct
23 Correct 9 ms 5140 KB Output is correct
24 Correct 12 ms 6092 KB Output is correct
25 Correct 12 ms 6228 KB Output is correct
26 Correct 13 ms 6292 KB Output is correct
27 Correct 11 ms 6332 KB Output is correct
28 Correct 17 ms 6304 KB Output is correct
29 Correct 26 ms 6336 KB Output is correct
30 Correct 15 ms 6292 KB Output is correct
31 Correct 16 ms 6312 KB Output is correct
32 Correct 14 ms 6228 KB Output is correct
33 Correct 27 ms 6740 KB Output is correct
34 Correct 25 ms 6728 KB Output is correct
35 Correct 22 ms 5312 KB Output is correct
36 Correct 9 ms 3668 KB Output is correct
37 Correct 35 ms 7508 KB Output is correct
38 Correct 35 ms 7640 KB Output is correct
39 Correct 33 ms 7508 KB Output is correct
40 Correct 36 ms 7636 KB Output is correct
41 Correct 32 ms 7644 KB Output is correct
42 Correct 20 ms 7124 KB Output is correct
43 Correct 23 ms 7112 KB Output is correct
44 Correct 19 ms 7164 KB Output is correct
45 Correct 44 ms 10332 KB Output is correct
46 Correct 44 ms 10252 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 584 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 6 ms 2516 KB Output is correct
18 Correct 10 ms 5548 KB Output is correct
19 Correct 10 ms 6324 KB Output is correct
20 Correct 11 ms 6356 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 15 ms 5564 KB Output is correct
23 Correct 9 ms 5076 KB Output is correct
24 Correct 12 ms 6100 KB Output is correct
25 Correct 11 ms 6228 KB Output is correct
26 Correct 13 ms 6384 KB Output is correct
27 Correct 12 ms 6356 KB Output is correct
28 Correct 13 ms 6356 KB Output is correct
29 Correct 22 ms 6344 KB Output is correct
30 Correct 13 ms 6228 KB Output is correct
31 Correct 17 ms 6192 KB Output is correct
32 Correct 14 ms 6228 KB Output is correct
33 Correct 26 ms 6740 KB Output is correct
34 Correct 27 ms 6724 KB Output is correct
35 Correct 20 ms 5320 KB Output is correct
36 Correct 8 ms 3628 KB Output is correct
37 Correct 36 ms 7500 KB Output is correct
38 Correct 38 ms 7548 KB Output is correct
39 Correct 39 ms 7624 KB Output is correct
40 Correct 37 ms 7520 KB Output is correct
41 Correct 29 ms 7628 KB Output is correct
42 Correct 17 ms 7152 KB Output is correct
43 Correct 17 ms 7120 KB Output is correct
44 Correct 18 ms 7156 KB Output is correct
45 Correct 36 ms 10280 KB Output is correct
46 Correct 37 ms 10244 KB Output is correct
47 Correct 222 ms 43260 KB Output is correct
48 Correct 135 ms 71288 KB Output is correct
49 Correct 144 ms 77468 KB Output is correct
50 Correct 164 ms 84800 KB Output is correct
51 Correct 240 ms 92676 KB Output is correct
52 Correct 240 ms 92972 KB Output is correct
53 Correct 201 ms 90352 KB Output is correct
54 Correct 189 ms 89856 KB Output is correct
55 Correct 161 ms 89908 KB Output is correct
56 Correct 168 ms 90944 KB Output is correct
57 Correct 353 ms 91168 KB Output is correct
58 Correct 183 ms 90600 KB Output is correct
59 Correct 183 ms 90824 KB Output is correct
60 Correct 207 ms 91424 KB Output is correct
61 Correct 196 ms 91024 KB Output is correct
62 Correct 226 ms 93320 KB Output is correct
63 Correct 261 ms 113080 KB Output is correct
64 Correct 269 ms 118856 KB Output is correct
65 Correct 294 ms 128104 KB Output is correct
66 Correct 563 ms 142200 KB Output is correct
67 Correct 582 ms 142088 KB Output is correct