oj.uz

Submission #535926

# Submission time Handle Problem Language Result Execution time Memory
535926 2022-03-11T20:38:26 Z PoPularPlusPlus Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 593 ms 262144 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 = 250;
	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 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 3 ms 1236 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 3 ms 1236 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 20 ms 11336 KB Output is correct
18 Correct 48 ms 26040 KB Output is correct
19 Correct 51 ms 29772 KB Output is correct
20 Correct 55 ms 29736 KB Output is correct
21 Correct 9 ms 5972 KB Output is correct
22 Correct 47 ms 26516 KB Output is correct
23 Correct 39 ms 23800 KB Output is correct
24 Correct 49 ms 28336 KB Output is correct
25 Correct 48 ms 29772 KB Output is correct
26 Correct 54 ms 29804 KB Output is correct
27 Correct 55 ms 29748 KB Output is correct
28 Correct 54 ms 29816 KB Output is correct
29 Correct 63 ms 29704 KB Output is correct
30 Correct 53 ms 29760 KB Output is correct
31 Correct 56 ms 29680 KB Output is correct
32 Correct 59 ms 29784 KB Output is correct
33 Correct 67 ms 29864 KB Output is correct
34 Correct 67 ms 29772 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 3 ms 1236 KB Output is correct
15 Correct 2 ms 1236 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 26 ms 11272 KB Output is correct
18 Correct 56 ms 26012 KB Output is correct
19 Correct 59 ms 29768 KB Output is correct
20 Correct 50 ms 29772 KB Output is correct
21 Correct 8 ms 5972 KB Output is correct
22 Correct 43 ms 26552 KB Output is correct
23 Correct 42 ms 23872 KB Output is correct
24 Correct 50 ms 28352 KB Output is correct
25 Correct 53 ms 29776 KB Output is correct
26 Correct 56 ms 29768 KB Output is correct
27 Correct 50 ms 29772 KB Output is correct
28 Correct 54 ms 29700 KB Output is correct
29 Correct 63 ms 29772 KB Output is correct
30 Correct 52 ms 29780 KB Output is correct
31 Correct 63 ms 29772 KB Output is correct
32 Correct 57 ms 29772 KB Output is correct
33 Correct 70 ms 29760 KB Output is correct
34 Correct 66 ms 29852 KB Output is correct
35 Correct 60 ms 21836 KB Output is correct
36 Correct 28 ms 16364 KB Output is correct
37 Correct 121 ms 29624 KB Output is correct
38 Correct 99 ms 30516 KB Output is correct
39 Correct 95 ms 30560 KB Output is correct
40 Correct 88 ms 30668 KB Output is correct
41 Correct 90 ms 30464 KB Output is correct
42 Correct 62 ms 30352 KB Output is correct
43 Correct 70 ms 30348 KB Output is correct
44 Correct 55 ms 30420 KB Output is correct
45 Correct 142 ms 30792 KB Output is correct
46 Correct 148 ms 30924 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 2 ms 1312 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 3 ms 1236 KB Output is correct
16 Correct 3 ms 2552 KB Output is correct
17 Correct 23 ms 11284 KB Output is correct
18 Correct 55 ms 26036 KB Output is correct
19 Correct 50 ms 29676 KB Output is correct
20 Correct 47 ms 29816 KB Output is correct
21 Correct 7 ms 5972 KB Output is correct
22 Correct 48 ms 26440 KB Output is correct
23 Correct 40 ms 23776 KB Output is correct
24 Correct 48 ms 28236 KB Output is correct
25 Correct 55 ms 29752 KB Output is correct
26 Correct 66 ms 29792 KB Output is correct
27 Correct 49 ms 29808 KB Output is correct
28 Correct 52 ms 29772 KB Output is correct
29 Correct 58 ms 29772 KB Output is correct
30 Correct 56 ms 29644 KB Output is correct
31 Correct 56 ms 29784 KB Output is correct
32 Correct 59 ms 29740 KB Output is correct
33 Correct 75 ms 29772 KB Output is correct
34 Correct 69 ms 29904 KB Output is correct
35 Correct 57 ms 21876 KB Output is correct
36 Correct 33 ms 16464 KB Output is correct
37 Correct 105 ms 29692 KB Output is correct
38 Correct 100 ms 30492 KB Output is correct
39 Correct 104 ms 30560 KB Output is correct
40 Correct 87 ms 30540 KB Output is correct
41 Correct 98 ms 30504 KB Output is correct
42 Correct 56 ms 30376 KB Output is correct
43 Correct 70 ms 30364 KB Output is correct
44 Correct 63 ms 30408 KB Output is correct
45 Correct 141 ms 30784 KB Output is correct
46 Correct 138 ms 30812 KB Output is correct
47 Correct 593 ms 185696 KB Output is correct
48 Runtime error 374 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -