oj.uz

Submission #679780

# Submission time Handle Problem Language Result Execution time Memory
679780 2023-01-09T08:00:54 Z parsadox2 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 235848 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 = 150 , 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 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

Subtask #2
12.0 / 12.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 2 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 1620 KB Output is correct
10 Correct 4 ms 1956 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 6 ms 2092 KB Output is correct
15 Correct 5 ms 2004 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 1364 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 4 ms 2004 KB Output is correct
11 Correct 4 ms 2088 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 6 ms 2016 KB Output is correct
15 Correct 5 ms 2004 KB Output is correct
16 Correct 9 ms 3080 KB Output is correct
17 Correct 28 ms 8552 KB Output is correct
18 Correct 93 ms 18672 KB Output is correct
19 Correct 96 ms 21120 KB Output is correct
20 Correct 79 ms 21164 KB Output is correct
21 Correct 19 ms 4948 KB Output is correct
22 Correct 101 ms 18912 KB Output is correct
23 Correct 63 ms 17132 KB Output is correct
24 Correct 82 ms 20248 KB Output is correct
25 Correct 86 ms 21284 KB Output is correct
26 Correct 88 ms 21136 KB Output is correct
27 Correct 87 ms 21124 KB Output is correct
28 Correct 93 ms 21292 KB Output is correct
29 Correct 126 ms 21208 KB Output is correct
30 Correct 96 ms 21196 KB Output is correct
31 Correct 109 ms 21204 KB Output is correct
32 Correct 103 ms 21300 KB Output is correct
33 Correct 145 ms 21220 KB Output is correct
34 Correct 113 ms 21128 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 1 ms 1364 KB Output is correct
9 Correct 3 ms 1620 KB Output is correct
10 Correct 4 ms 2004 KB Output is correct
11 Correct 4 ms 2012 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 4 ms 2004 KB Output is correct
14 Correct 6 ms 2004 KB Output is correct
15 Correct 6 ms 2004 KB Output is correct
16 Correct 9 ms 3068 KB Output is correct
17 Correct 33 ms 8476 KB Output is correct
18 Correct 91 ms 18656 KB Output is correct
19 Correct 99 ms 21116 KB Output is correct
20 Correct 81 ms 21256 KB Output is correct
21 Correct 18 ms 4948 KB Output is correct
22 Correct 99 ms 19000 KB Output is correct
23 Correct 64 ms 17084 KB Output is correct
24 Correct 85 ms 20176 KB Output is correct
25 Correct 82 ms 21160 KB Output is correct
26 Correct 84 ms 21164 KB Output is correct
27 Correct 87 ms 21216 KB Output is correct
28 Correct 93 ms 21196 KB Output is correct
29 Correct 138 ms 21208 KB Output is correct
30 Correct 88 ms 21072 KB Output is correct
31 Correct 102 ms 21144 KB Output is correct
32 Correct 105 ms 21232 KB Output is correct
33 Correct 190 ms 21136 KB Output is correct
34 Correct 119 ms 21228 KB Output is correct
35 Correct 66 ms 15772 KB Output is correct
36 Correct 40 ms 12044 KB Output is correct
37 Correct 93 ms 20788 KB Output is correct
38 Correct 92 ms 21600 KB Output is correct
39 Correct 88 ms 21580 KB Output is correct
40 Correct 85 ms 21536 KB Output is correct
41 Correct 91 ms 21620 KB Output is correct
42 Correct 95 ms 21492 KB Output is correct
43 Correct 100 ms 21496 KB Output is correct
44 Correct 91 ms 21488 KB Output is correct
45 Correct 248 ms 21656 KB Output is correct
46 Correct 166 ms 21708 KB Output is correct

Subtask #5
0 / 43.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 980 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 2004 KB Output is correct
11 Correct 4 ms 2004 KB Output is correct
12 Correct 5 ms 2004 KB Output is correct
13 Correct 4 ms 2004 KB Output is correct
14 Correct 7 ms 2088 KB Output is correct
15 Correct 6 ms 2004 KB Output is correct
16 Correct 10 ms 3012 KB Output is correct
17 Correct 29 ms 8544 KB Output is correct
18 Correct 93 ms 18560 KB Output is correct
19 Correct 94 ms 21220 KB Output is correct
20 Correct 88 ms 21196 KB Output is correct
21 Correct 19 ms 4948 KB Output is correct
22 Correct 103 ms 19008 KB Output is correct
23 Correct 64 ms 17124 KB Output is correct
24 Correct 82 ms 20184 KB Output is correct
25 Correct 87 ms 21196 KB Output is correct
26 Correct 89 ms 21196 KB Output is correct
27 Correct 95 ms 21212 KB Output is correct
28 Correct 90 ms 21220 KB Output is correct
29 Correct 119 ms 21180 KB Output is correct
30 Correct 98 ms 21176 KB Output is correct
31 Correct 110 ms 21268 KB Output is correct
32 Correct 107 ms 21156 KB Output is correct
33 Correct 151 ms 21192 KB Output is correct
34 Correct 113 ms 21176 KB Output is correct
35 Correct 69 ms 15820 KB Output is correct
36 Correct 51 ms 12048 KB Output is correct
37 Correct 89 ms 20808 KB Output is correct
38 Correct 91 ms 21528 KB Output is correct
39 Correct 81 ms 21580 KB Output is correct
40 Correct 81 ms 21624 KB Output is correct
41 Correct 86 ms 21580 KB Output is correct
42 Correct 96 ms 21472 KB Output is correct
43 Correct 97 ms 21468 KB Output is correct
44 Correct 90 ms 21484 KB Output is correct
45 Correct 229 ms 21728 KB Output is correct
46 Correct 159 ms 21700 KB Output is correct
47 Correct 585 ms 126040 KB Output is correct
48 Execution timed out 1108 ms 235848 KB Time limit exceeded
49 Halted 0 ms 0 KB -