oj.uz

Submission #679782

# Submission time Handle Problem Language Result Execution time Memory
679782 2023-01-09T08:01:48 Z parsadox2 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 261552 KB 
#include <bits/stdc++.h>
#define pb 		push_back
#define F		first
#define S 		second
#define debug(x)    cout << #x << "= " << x << ", "
#define ll 		long long
#define fast 		ios::sync_with_stdio(false), cin.tie(0),  cout.tie(0)
#define SZ(x)         (int) x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 3e4 + 10 , maxsq = 175 , inf = 1e9 + 10;
int n , b[maxn] , p[maxn] , m , dis[maxn][maxsq + 10] , ans;
bool marked[maxn];
vector <int> all[maxn];
set <pair <int , pair <int , int>>> st;

void add(int v , int j , int val)
{
	if(dis[v][j] > val)
	{
		st.erase({dis[v][j] , {v , j}});
		dis[v][j] = val;
		st.insert({dis[v][j] , {v , j}});
	}
}

void jmp_small(int D , int now , int jmp)
{
	if(now + jmp < n)
		add(now + jmp , jmp , D + 1);
	if(now - jmp > -1)
		add(now - jmp , jmp , D + 1);
}

void jmp_big(int D , int now , int jmp)
{
	for(int tmp = now + jmp ; tmp < n ; tmp += jmp)
		add(tmp , maxsq , D + ((tmp - now) / jmp));
	for(int tmp = now - jmp ; tmp > -1 ; tmp -= jmp)
		add(tmp , maxsq , D + ((now - tmp) / jmp));
}

void update(int D , int now , int jmp)
{
	if(jmp != maxsq)
	{
		jmp_small(D , now , jmp);
		return;
	}
	if(marked[now])
		return;
	marked[now] = true;
	for(auto u : all[now])
	{
		if(u < maxsq)
			jmp_small(D , now , u);
		else
			jmp_big(D , now , u);
	}
}

void dij()
{
	for(int i = 0 ; i < n ; i++)
		for(int j = 0 ; j <= maxsq ; j++)
			dis[i][j] = inf;
	dis[b[0]][maxsq] = 0;
	for(int i = 0 ; i < n ; i++)
		for(int j = 0 ; j <= maxsq ; j++)
			st.insert({dis[i][j] , {i , j}});
	while(!st.empty())
	{
		auto v = *st.begin();
		st.erase(v);
		int D = v.F , now = v.S.F , jmp = v.S.S;
		if(now == b[1])
		{
			ans = D;
			break;
		}
		if(!marked[now])
		{
			jmp = maxsq;
			update(D , now , jmp);
		}
		jmp = v.S.S;
		update(D , now , jmp);
	}
}	

int32_t main()
{
	fast;
	cin >> n >> m;
	for(int i = 0 ; i < m ; i++)
	{
		cin >> b[i] >> p[i];
		all[b[i]].pb(p[i]);
	}
	dij();
	cout << (ans == inf ? -1 : ans) << endl;
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 2 ms 1364 KB Output is correct
9 Correct 3 ms 1620 KB Output is correct
10 Correct 4 ms 2204 KB Output is correct
11 Correct 5 ms 2132 KB Output is correct
12 Correct 4 ms 2132 KB Output is correct
13 Correct 4 ms 2132 KB Output is correct
14 Correct 7 ms 2132 KB Output is correct
15 Correct 6 ms 2260 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 2 ms 1476 KB Output is correct
9 Correct 2 ms 1620 KB Output is correct
10 Correct 4 ms 2132 KB Output is correct
11 Correct 4 ms 2260 KB Output is correct
12 Correct 4 ms 2132 KB Output is correct
13 Correct 4 ms 2132 KB Output is correct
14 Correct 7 ms 2260 KB Output is correct
15 Correct 6 ms 2260 KB Output is correct
16 Correct 10 ms 3412 KB Output is correct
17 Correct 32 ms 9684 KB Output is correct
18 Correct 107 ms 21536 KB Output is correct
19 Correct 111 ms 24580 KB Output is correct
20 Correct 94 ms 24572 KB Output is correct
21 Correct 19 ms 5684 KB Output is correct
22 Correct 116 ms 21976 KB Output is correct
23 Correct 74 ms 19844 KB Output is correct
24 Correct 94 ms 23332 KB Output is correct
25 Correct 93 ms 24524 KB Output is correct
26 Correct 99 ms 24508 KB Output is correct
27 Correct 102 ms 24444 KB Output is correct
28 Correct 102 ms 24516 KB Output is correct
29 Correct 132 ms 24436 KB Output is correct
30 Correct 103 ms 24516 KB Output is correct
31 Correct 119 ms 24444 KB Output is correct
32 Correct 129 ms 24524 KB Output is correct
33 Correct 164 ms 24620 KB Output is correct
34 Correct 131 ms 24656 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 2 ms 1364 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 4 ms 2116 KB Output is correct
11 Correct 4 ms 2260 KB Output is correct
12 Correct 4 ms 2260 KB Output is correct
13 Correct 4 ms 2260 KB Output is correct
14 Correct 7 ms 2132 KB Output is correct
15 Correct 6 ms 2220 KB Output is correct
16 Correct 11 ms 3412 KB Output is correct
17 Correct 33 ms 9684 KB Output is correct
18 Correct 110 ms 21584 KB Output is correct
19 Correct 112 ms 24564 KB Output is correct
20 Correct 88 ms 24572 KB Output is correct
21 Correct 20 ms 5696 KB Output is correct
22 Correct 116 ms 21888 KB Output is correct
23 Correct 76 ms 19844 KB Output is correct
24 Correct 93 ms 23328 KB Output is correct
25 Correct 95 ms 24560 KB Output is correct
26 Correct 97 ms 24544 KB Output is correct
27 Correct 98 ms 24544 KB Output is correct
28 Correct 103 ms 24560 KB Output is correct
29 Correct 134 ms 24436 KB Output is correct
30 Correct 102 ms 24460 KB Output is correct
31 Correct 120 ms 24452 KB Output is correct
32 Correct 126 ms 24516 KB Output is correct
33 Correct 169 ms 24652 KB Output is correct
34 Correct 129 ms 24464 KB Output is correct
35 Correct 77 ms 18224 KB Output is correct
36 Correct 48 ms 13904 KB Output is correct
37 Correct 104 ms 24216 KB Output is correct
38 Correct 103 ms 24916 KB Output is correct
39 Correct 94 ms 24968 KB Output is correct
40 Correct 97 ms 24908 KB Output is correct
41 Correct 100 ms 24864 KB Output is correct
42 Correct 104 ms 24816 KB Output is correct
43 Correct 109 ms 24872 KB Output is correct
44 Correct 104 ms 24908 KB Output is correct
45 Correct 282 ms 24836 KB Output is correct
46 Correct 192 ms 24924 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 2 ms 1364 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 4 ms 2132 KB Output is correct
11 Correct 4 ms 2260 KB Output is correct
12 Correct 5 ms 2260 KB Output is correct
13 Correct 4 ms 2260 KB Output is correct
14 Correct 7 ms 2252 KB Output is correct
15 Correct 6 ms 2216 KB Output is correct
16 Correct 10 ms 3344 KB Output is correct
17 Correct 34 ms 9800 KB Output is correct
18 Correct 108 ms 21580 KB Output is correct
19 Correct 110 ms 24512 KB Output is correct
20 Correct 90 ms 24524 KB Output is correct
21 Correct 19 ms 5592 KB Output is correct
22 Correct 120 ms 22080 KB Output is correct
23 Correct 75 ms 19760 KB Output is correct
24 Correct 93 ms 23356 KB Output is correct
25 Correct 93 ms 24508 KB Output is correct
26 Correct 100 ms 24472 KB Output is correct
27 Correct 99 ms 24480 KB Output is correct
28 Correct 106 ms 24548 KB Output is correct
29 Correct 133 ms 24428 KB Output is correct
30 Correct 101 ms 24472 KB Output is correct
31 Correct 116 ms 24512 KB Output is correct
32 Correct 121 ms 24480 KB Output is correct
33 Correct 165 ms 24640 KB Output is correct
34 Correct 128 ms 24524 KB Output is correct
35 Correct 78 ms 18164 KB Output is correct
36 Correct 47 ms 13812 KB Output is correct
37 Correct 106 ms 24012 KB Output is correct
38 Correct 104 ms 24908 KB Output is correct
39 Correct 95 ms 25032 KB Output is correct
40 Correct 97 ms 24868 KB Output is correct
41 Correct 101 ms 24944 KB Output is correct
42 Correct 105 ms 24888 KB Output is correct
43 Correct 107 ms 24872 KB Output is correct
44 Correct 104 ms 24936 KB Output is correct
45 Correct 272 ms 24928 KB Output is correct
46 Correct 188 ms 24920 KB Output is correct
47 Correct 667 ms 146580 KB Output is correct
48 Execution timed out 1092 ms 261552 KB Time limit exceeded
49 Halted 0 ms 0 KB -