oj.uz

답안 #535922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535922 2022-03-11T20:27:25 Z PoPularPlusPlus Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 396 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 = sqrt(n);
	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:68:12: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |  dis[s][0] = 0;
      |  ~~~~~~~~~~^~~
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

# 결과 실행 시간 메모리 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 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 452 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

# 결과 실행 시간 메모리 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 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
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 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 452 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 456 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 4 ms 1620 KB Output is correct
18 Correct 7 ms 4692 KB Output is correct
19 Correct 13 ms 5592 KB Output is correct
20 Correct 9 ms 5588 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 8 ms 4824 KB Output is correct
23 Correct 8 ms 4116 KB Output is correct
24 Correct 9 ms 5324 KB Output is correct
25 Correct 9 ms 5588 KB Output is correct
26 Correct 9 ms 5692 KB Output is correct
27 Correct 9 ms 5652 KB Output is correct
28 Correct 10 ms 5612 KB Output is correct
29 Correct 21 ms 5568 KB Output is correct
30 Correct 9 ms 5568 KB Output is correct
31 Correct 13 ms 5588 KB Output is correct
32 Correct 13 ms 5776 KB Output is correct
33 Correct 24 ms 6216 KB Output is correct
34 Correct 26 ms 6216 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 216 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 456 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 4 ms 1620 KB Output is correct
18 Correct 7 ms 4564 KB Output is correct
19 Correct 11 ms 5588 KB Output is correct
20 Correct 9 ms 5588 KB Output is correct
21 Correct 2 ms 708 KB Output is correct
22 Correct 7 ms 4820 KB Output is correct
23 Correct 6 ms 4052 KB Output is correct
24 Correct 10 ms 5332 KB Output is correct
25 Correct 9 ms 5588 KB Output is correct
26 Correct 9 ms 5588 KB Output is correct
27 Correct 11 ms 5588 KB Output is correct
28 Correct 10 ms 5588 KB Output is correct
29 Correct 15 ms 5588 KB Output is correct
30 Correct 9 ms 5588 KB Output is correct
31 Correct 13 ms 5660 KB Output is correct
32 Correct 16 ms 5716 KB Output is correct
33 Correct 25 ms 6192 KB Output is correct
34 Correct 24 ms 6216 KB Output is correct
35 Correct 16 ms 4280 KB Output is correct
36 Correct 5 ms 2516 KB Output is correct
37 Correct 24 ms 6920 KB Output is correct
38 Correct 30 ms 6916 KB Output is correct
39 Correct 33 ms 6916 KB Output is correct
40 Correct 25 ms 6900 KB Output is correct
41 Correct 30 ms 6892 KB Output is correct
42 Correct 16 ms 6424 KB Output is correct
43 Correct 16 ms 6424 KB Output is correct
44 Correct 15 ms 6416 KB Output is correct
45 Correct 33 ms 9524 KB Output is correct
46 Correct 31 ms 9652 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 316 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 328 KB Output is correct
14 Correct 1 ms 388 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 452 KB Output is correct
17 Correct 4 ms 1620 KB Output is correct
18 Correct 7 ms 4548 KB Output is correct
19 Correct 8 ms 5612 KB Output is correct
20 Correct 11 ms 5588 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 8 ms 4820 KB Output is correct
23 Correct 7 ms 4052 KB Output is correct
24 Correct 8 ms 5204 KB Output is correct
25 Correct 9 ms 5580 KB Output is correct
26 Correct 10 ms 5588 KB Output is correct
27 Correct 9 ms 5588 KB Output is correct
28 Correct 10 ms 5652 KB Output is correct
29 Correct 18 ms 5588 KB Output is correct
30 Correct 11 ms 5588 KB Output is correct
31 Correct 14 ms 5672 KB Output is correct
32 Correct 12 ms 5696 KB Output is correct
33 Correct 21 ms 6100 KB Output is correct
34 Correct 21 ms 6100 KB Output is correct
35 Correct 16 ms 4244 KB Output is correct
36 Correct 6 ms 2632 KB Output is correct
37 Correct 30 ms 6916 KB Output is correct
38 Correct 36 ms 6856 KB Output is correct
39 Correct 29 ms 6860 KB Output is correct
40 Correct 30 ms 6868 KB Output is correct
41 Correct 28 ms 6836 KB Output is correct
42 Correct 15 ms 6412 KB Output is correct
43 Correct 15 ms 6376 KB Output is correct
44 Correct 15 ms 6420 KB Output is correct
45 Correct 32 ms 9512 KB Output is correct
46 Correct 32 ms 9672 KB Output is correct
47 Correct 308 ms 86276 KB Output is correct
48 Correct 310 ms 210108 KB Output is correct
49 Correct 352 ms 239632 KB Output is correct
50 Runtime error 396 ms 262144 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -