oj.uz

Submission #536020

# Submission time Handle Problem Language Result Execution time Memory
536020 2022-03-12T06:48:17 Z PoPularPlusPlus Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 226 ms 84668 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 = 10;
	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 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 396 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 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 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 3 ms 1364 KB Output is correct
19 Correct 3 ms 1620 KB Output is correct
20 Correct 3 ms 1620 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 3 ms 1492 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 3 ms 1620 KB Output is correct
26 Correct 3 ms 1620 KB Output is correct
27 Correct 3 ms 1560 KB Output is correct
28 Correct 3 ms 1748 KB Output is correct
29 Correct 6 ms 2260 KB Output is correct
30 Correct 3 ms 1748 KB Output is correct
31 Correct 4 ms 2004 KB Output is correct
32 Correct 4 ms 1748 KB Output is correct
33 Correct 8 ms 2772 KB Output is correct
34 Correct 8 ms 2900 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 3 ms 1364 KB Output is correct
19 Correct 3 ms 1620 KB Output is correct
20 Correct 3 ms 1620 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 1364 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 3 ms 1620 KB Output is correct
26 Correct 3 ms 1620 KB Output is correct
27 Correct 3 ms 1620 KB Output is correct
28 Correct 4 ms 1620 KB Output is correct
29 Correct 5 ms 2260 KB Output is correct
30 Correct 5 ms 1748 KB Output is correct
31 Correct 4 ms 2004 KB Output is correct
32 Correct 4 ms 1748 KB Output is correct
33 Correct 8 ms 2744 KB Output is correct
34 Correct 8 ms 2900 KB Output is correct
35 Correct 10 ms 2132 KB Output is correct
36 Correct 3 ms 1108 KB Output is correct
37 Correct 13 ms 3540 KB Output is correct
38 Correct 13 ms 3156 KB Output is correct
39 Correct 15 ms 3216 KB Output is correct
40 Correct 14 ms 3156 KB Output is correct
41 Correct 13 ms 3116 KB Output is correct
42 Correct 9 ms 2260 KB Output is correct
43 Correct 9 ms 2248 KB Output is correct
44 Correct 12 ms 2200 KB Output is correct
45 Correct 15 ms 6132 KB Output is correct
46 Correct 15 ms 5972 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 2 ms 1364 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 3 ms 1620 KB Output is correct
21 Correct 1 ms 584 KB Output is correct
22 Correct 2 ms 1496 KB Output is correct
23 Correct 3 ms 1376 KB Output is correct
24 Correct 4 ms 1632 KB Output is correct
25 Correct 3 ms 1632 KB Output is correct
26 Correct 3 ms 1632 KB Output is correct
27 Correct 3 ms 1680 KB Output is correct
28 Correct 4 ms 1760 KB Output is correct
29 Correct 5 ms 2260 KB Output is correct
30 Correct 4 ms 1872 KB Output is correct
31 Correct 4 ms 2004 KB Output is correct
32 Correct 4 ms 1868 KB Output is correct
33 Correct 7 ms 2772 KB Output is correct
34 Correct 8 ms 2900 KB Output is correct
35 Correct 10 ms 2132 KB Output is correct
36 Correct 3 ms 1108 KB Output is correct
37 Correct 13 ms 3584 KB Output is correct
38 Correct 13 ms 3156 KB Output is correct
39 Correct 13 ms 3140 KB Output is correct
40 Correct 13 ms 3156 KB Output is correct
41 Correct 13 ms 3156 KB Output is correct
42 Correct 9 ms 2260 KB Output is correct
43 Correct 9 ms 2200 KB Output is correct
44 Correct 10 ms 2200 KB Output is correct
45 Correct 16 ms 6052 KB Output is correct
46 Correct 15 ms 5972 KB Output is correct
47 Correct 67 ms 16252 KB Output is correct
48 Correct 33 ms 16884 KB Output is correct
49 Correct 36 ms 17740 KB Output is correct
50 Correct 35 ms 19276 KB Output is correct
51 Correct 78 ms 22756 KB Output is correct
52 Correct 82 ms 22972 KB Output is correct
53 Correct 46 ms 19548 KB Output is correct
54 Correct 33 ms 19328 KB Output is correct
55 Correct 35 ms 19420 KB Output is correct
56 Correct 41 ms 20376 KB Output is correct
57 Correct 148 ms 46452 KB Output is correct
58 Correct 42 ms 20144 KB Output is correct
59 Correct 50 ms 20624 KB Output is correct
60 Correct 53 ms 21172 KB Output is correct
61 Correct 50 ms 20496 KB Output is correct
62 Correct 62 ms 23384 KB Output is correct
63 Correct 99 ms 42440 KB Output is correct
64 Correct 107 ms 47996 KB Output is correct
65 Correct 133 ms 57476 KB Output is correct
66 Correct 224 ms 84336 KB Output is correct
67 Correct 226 ms 84668 KB Output is correct