oj.uz

Submission #679777

# Submission time Handle Problem Language Result Execution time Memory
679777 2023-01-09T07:58:50 Z parsadox2 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 262144 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 = 180 , 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 1492 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 5 ms 2260 KB Output is correct
11 Correct 4 ms 2260 KB Output is correct
12 Correct 4 ms 2212 KB Output is correct
13 Correct 4 ms 2260 KB Output is correct
14 Correct 7 ms 2288 KB Output is correct
15 Correct 6 ms 2288 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 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 1492 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 5 ms 2260 KB Output is correct
11 Correct 4 ms 2260 KB Output is correct
12 Correct 6 ms 2164 KB Output is correct
13 Correct 4 ms 2260 KB Output is correct
14 Correct 6 ms 2260 KB Output is correct
15 Correct 6 ms 2260 KB Output is correct
16 Correct 10 ms 3392 KB Output is correct
17 Correct 34 ms 10024 KB Output is correct
18 Correct 113 ms 22080 KB Output is correct
19 Correct 114 ms 25104 KB Output is correct
20 Correct 94 ms 25164 KB Output is correct
21 Correct 21 ms 5780 KB Output is correct
22 Correct 124 ms 22556 KB Output is correct
23 Correct 78 ms 20360 KB Output is correct
24 Correct 100 ms 24084 KB Output is correct
25 Correct 98 ms 25160 KB Output is correct
26 Correct 100 ms 25200 KB Output is correct
27 Correct 103 ms 25152 KB Output is correct
28 Correct 114 ms 25140 KB Output is correct
29 Correct 141 ms 25136 KB Output is correct
30 Correct 105 ms 25168 KB Output is correct
31 Correct 118 ms 25184 KB Output is correct
32 Correct 121 ms 25164 KB Output is correct
33 Correct 174 ms 25276 KB Output is correct
34 Correct 131 ms 25096 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 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 1492 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 4 ms 2260 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 2260 KB Output is correct
15 Correct 7 ms 2388 KB Output is correct
16 Correct 10 ms 3408 KB Output is correct
17 Correct 34 ms 9904 KB Output is correct
18 Correct 108 ms 22032 KB Output is correct
19 Correct 113 ms 25172 KB Output is correct
20 Correct 94 ms 25164 KB Output is correct
21 Correct 22 ms 5716 KB Output is correct
22 Correct 119 ms 22664 KB Output is correct
23 Correct 77 ms 20308 KB Output is correct
24 Correct 97 ms 23984 KB Output is correct
25 Correct 98 ms 25152 KB Output is correct
26 Correct 101 ms 25132 KB Output is correct
27 Correct 107 ms 25124 KB Output is correct
28 Correct 112 ms 25236 KB Output is correct
29 Correct 138 ms 25096 KB Output is correct
30 Correct 105 ms 25132 KB Output is correct
31 Correct 123 ms 25144 KB Output is correct
32 Correct 120 ms 25164 KB Output is correct
33 Correct 172 ms 25216 KB Output is correct
34 Correct 132 ms 25128 KB Output is correct
35 Correct 79 ms 18636 KB Output is correct
36 Correct 48 ms 14252 KB Output is correct
37 Correct 104 ms 24700 KB Output is correct
38 Correct 108 ms 25488 KB Output is correct
39 Correct 97 ms 25564 KB Output is correct
40 Correct 101 ms 25600 KB Output is correct
41 Correct 104 ms 25508 KB Output is correct
42 Correct 108 ms 25584 KB Output is correct
43 Correct 110 ms 25520 KB Output is correct
44 Correct 105 ms 25548 KB Output is correct
45 Correct 302 ms 25496 KB Output is correct
46 Correct 197 ms 25600 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 1492 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 4 ms 2260 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 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 34 ms 10028 KB Output is correct
18 Correct 111 ms 22092 KB Output is correct
19 Correct 117 ms 25292 KB Output is correct
20 Correct 94 ms 25144 KB Output is correct
21 Correct 21 ms 5740 KB Output is correct
22 Correct 121 ms 22480 KB Output is correct
23 Correct 77 ms 20316 KB Output is correct
24 Correct 100 ms 24096 KB Output is correct
25 Correct 98 ms 25164 KB Output is correct
26 Correct 102 ms 25160 KB Output is correct
27 Correct 102 ms 25188 KB Output is correct
28 Correct 106 ms 25208 KB Output is correct
29 Correct 139 ms 25316 KB Output is correct
30 Correct 106 ms 25172 KB Output is correct
31 Correct 120 ms 25172 KB Output is correct
32 Correct 123 ms 25096 KB Output is correct
33 Correct 168 ms 25164 KB Output is correct
34 Correct 133 ms 25120 KB Output is correct
35 Correct 79 ms 18652 KB Output is correct
36 Correct 49 ms 14204 KB Output is correct
37 Correct 122 ms 24708 KB Output is correct
38 Correct 105 ms 25548 KB Output is correct
39 Correct 98 ms 25592 KB Output is correct
40 Correct 99 ms 25616 KB Output is correct
41 Correct 103 ms 25560 KB Output is correct
42 Correct 107 ms 25508 KB Output is correct
43 Correct 109 ms 25432 KB Output is correct
44 Correct 111 ms 25528 KB Output is correct
45 Correct 278 ms 25496 KB Output is correct
46 Correct 204 ms 25640 KB Output is correct
47 Correct 689 ms 150800 KB Output is correct
48 Execution timed out 1085 ms 262144 KB Time limit exceeded
49 Halted 0 ms 0 KB -