oj.uz

Submission #536019

# Submission time Handle Problem Language Result Execution time Memory
536019 2022-03-12T06:47:22 Z PoPularPlusPlus Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 435 ms 105536 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 = 25;
	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 0 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 212 KB Output is correct
5 Correct 0 ms 212 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 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 4 ms 1492 KB Output is correct
18 Correct 6 ms 2900 KB Output is correct
19 Correct 7 ms 3368 KB Output is correct
20 Correct 7 ms 3412 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 8 ms 3028 KB Output is correct
23 Correct 6 ms 2772 KB Output is correct
24 Correct 8 ms 3204 KB Output is correct
25 Correct 7 ms 3284 KB Output is correct
26 Correct 9 ms 3448 KB Output is correct
27 Correct 7 ms 3424 KB Output is correct
28 Correct 7 ms 3412 KB Output is correct
29 Correct 17 ms 3796 KB Output is correct
30 Correct 10 ms 3412 KB Output is correct
31 Correct 8 ms 3744 KB Output is correct
32 Correct 10 ms 3540 KB Output is correct
33 Correct 16 ms 4276 KB Output is correct
34 Correct 22 ms 4180 KB Output is correct

Subtask #4
21.0 / 21.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 6 ms 1492 KB Output is correct
18 Correct 7 ms 2900 KB Output is correct
19 Correct 6 ms 3284 KB Output is correct
20 Correct 7 ms 3420 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 6 ms 3036 KB Output is correct
23 Correct 6 ms 2792 KB Output is correct
24 Correct 8 ms 3312 KB Output is correct
25 Correct 7 ms 3284 KB Output is correct
26 Correct 7 ms 3412 KB Output is correct
27 Correct 7 ms 3420 KB Output is correct
28 Correct 8 ms 3476 KB Output is correct
29 Correct 16 ms 3816 KB Output is correct
30 Correct 9 ms 3460 KB Output is correct
31 Correct 8 ms 3796 KB Output is correct
32 Correct 8 ms 3540 KB Output is correct
33 Correct 15 ms 4264 KB Output is correct
34 Correct 14 ms 4272 KB Output is correct
35 Correct 20 ms 3180 KB Output is correct
36 Correct 5 ms 2004 KB Output is correct
37 Correct 24 ms 4860 KB Output is correct
38 Correct 32 ms 4636 KB Output is correct
39 Correct 24 ms 4636 KB Output is correct
40 Correct 24 ms 4624 KB Output is correct
41 Correct 23 ms 4692 KB Output is correct
42 Correct 15 ms 4120 KB Output is correct
43 Correct 13 ms 3992 KB Output is correct
44 Correct 13 ms 4008 KB Output is correct
45 Correct 24 ms 7604 KB Output is correct
46 Correct 25 ms 7752 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 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 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 472 KB Output is correct
13 Correct 1 ms 472 KB Output is correct
14 Correct 1 ms 480 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 5 ms 1512 KB Output is correct
18 Correct 7 ms 3016 KB Output is correct
19 Correct 6 ms 3364 KB Output is correct
20 Correct 7 ms 3404 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 6 ms 3028 KB Output is correct
23 Correct 6 ms 2772 KB Output is correct
24 Correct 8 ms 3284 KB Output is correct
25 Correct 7 ms 3304 KB Output is correct
26 Correct 9 ms 3412 KB Output is correct
27 Correct 7 ms 3412 KB Output is correct
28 Correct 8 ms 3412 KB Output is correct
29 Correct 14 ms 3796 KB Output is correct
30 Correct 10 ms 3412 KB Output is correct
31 Correct 8 ms 3796 KB Output is correct
32 Correct 8 ms 3540 KB Output is correct
33 Correct 15 ms 4180 KB Output is correct
34 Correct 14 ms 4276 KB Output is correct
35 Correct 17 ms 3284 KB Output is correct
36 Correct 6 ms 2084 KB Output is correct
37 Correct 22 ms 4820 KB Output is correct
38 Correct 31 ms 4632 KB Output is correct
39 Correct 36 ms 4564 KB Output is correct
40 Correct 33 ms 4672 KB Output is correct
41 Correct 25 ms 4688 KB Output is correct
42 Correct 14 ms 4040 KB Output is correct
43 Correct 17 ms 3952 KB Output is correct
44 Correct 12 ms 3988 KB Output is correct
45 Correct 24 ms 7636 KB Output is correct
46 Correct 23 ms 7724 KB Output is correct
47 Correct 144 ms 25748 KB Output is correct
48 Correct 84 ms 37120 KB Output is correct
49 Correct 102 ms 40080 KB Output is correct
50 Correct 90 ms 43636 KB Output is correct
51 Correct 156 ms 48604 KB Output is correct
52 Correct 205 ms 48704 KB Output is correct
53 Correct 118 ms 45936 KB Output is correct
54 Correct 87 ms 45808 KB Output is correct
55 Correct 96 ms 45744 KB Output is correct
56 Correct 98 ms 46752 KB Output is correct
57 Correct 293 ms 56236 KB Output is correct
58 Correct 106 ms 46536 KB Output is correct
59 Correct 111 ms 46696 KB Output is correct
60 Correct 124 ms 47336 KB Output is correct
61 Correct 118 ms 46732 KB Output is correct
62 Correct 124 ms 49344 KB Output is correct
63 Correct 188 ms 68796 KB Output is correct
64 Correct 167 ms 74440 KB Output is correct
65 Correct 214 ms 83952 KB Output is correct
66 Correct 357 ms 105460 KB Output is correct
67 Correct 435 ms 105536 KB Output is correct