oj.uz

Submission #679779

# Submission time Handle Problem Language Result Execution time Memory
679779 2023-01-09T07:59:52 Z parsadox2 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 258636 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 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 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 6 ms 2260 KB Output is correct
12 Correct 5 ms 2260 KB Output is correct
13 Correct 5 ms 2260 KB Output is correct
14 Correct 7 ms 2260 KB Output is correct
15 Correct 7 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 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 5 ms 2260 KB Output is correct
12 Correct 5 ms 2260 KB Output is correct
13 Correct 5 ms 2260 KB Output is correct
14 Correct 8 ms 2264 KB Output is correct
15 Correct 6 ms 2260 KB Output is correct
16 Correct 11 ms 3396 KB Output is correct
17 Correct 34 ms 10032 KB Output is correct
18 Correct 116 ms 22164 KB Output is correct
19 Correct 116 ms 25204 KB Output is correct
20 Correct 105 ms 25240 KB Output is correct
21 Correct 20 ms 5716 KB Output is correct
22 Correct 122 ms 22520 KB Output is correct
23 Correct 78 ms 20356 KB Output is correct
24 Correct 97 ms 23956 KB Output is correct
25 Correct 101 ms 25268 KB Output is correct
26 Correct 103 ms 25092 KB Output is correct
27 Correct 108 ms 25160 KB Output is correct
28 Correct 106 ms 25296 KB Output is correct
29 Correct 139 ms 25192 KB Output is correct
30 Correct 106 ms 25188 KB Output is correct
31 Correct 118 ms 25100 KB Output is correct
32 Correct 127 ms 25168 KB Output is correct
33 Correct 211 ms 25220 KB Output is correct
34 Correct 143 ms 25216 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 2 ms 1108 KB Output is correct
8 Correct 3 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 5 ms 2260 KB Output is correct
12 Correct 4 ms 2260 KB Output is correct
13 Correct 5 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 11 ms 3412 KB Output is correct
17 Correct 37 ms 9928 KB Output is correct
18 Correct 112 ms 22076 KB Output is correct
19 Correct 121 ms 25164 KB Output is correct
20 Correct 93 ms 25164 KB Output is correct
21 Correct 21 ms 5732 KB Output is correct
22 Correct 121 ms 22556 KB Output is correct
23 Correct 79 ms 20352 KB Output is correct
24 Correct 111 ms 24012 KB Output is correct
25 Correct 116 ms 25184 KB Output is correct
26 Correct 104 ms 25164 KB Output is correct
27 Correct 107 ms 25128 KB Output is correct
28 Correct 119 ms 25196 KB Output is correct
29 Correct 155 ms 25164 KB Output is correct
30 Correct 106 ms 25108 KB Output is correct
31 Correct 126 ms 25192 KB Output is correct
32 Correct 130 ms 25112 KB Output is correct
33 Correct 215 ms 25164 KB Output is correct
34 Correct 136 ms 25212 KB Output is correct
35 Correct 86 ms 18636 KB Output is correct
36 Correct 63 ms 14244 KB Output is correct
37 Correct 108 ms 24728 KB Output is correct
38 Correct 109 ms 25620 KB Output is correct
39 Correct 98 ms 25604 KB Output is correct
40 Correct 102 ms 25664 KB Output is correct
41 Correct 103 ms 25532 KB Output is correct
42 Correct 112 ms 25536 KB Output is correct
43 Correct 118 ms 25440 KB Output is correct
44 Correct 111 ms 25668 KB Output is correct
45 Correct 291 ms 25592 KB Output is correct
46 Correct 215 ms 25572 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1236 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 5 ms 2260 KB Output is correct
12 Correct 5 ms 2260 KB Output is correct
13 Correct 5 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 11 ms 3484 KB Output is correct
17 Correct 39 ms 9960 KB Output is correct
18 Correct 116 ms 22100 KB Output is correct
19 Correct 114 ms 25264 KB Output is correct
20 Correct 98 ms 25256 KB Output is correct
21 Correct 21 ms 5716 KB Output is correct
22 Correct 123 ms 22476 KB Output is correct
23 Correct 83 ms 20272 KB Output is correct
24 Correct 102 ms 23940 KB Output is correct
25 Correct 101 ms 25136 KB Output is correct
26 Correct 104 ms 25100 KB Output is correct
27 Correct 107 ms 25208 KB Output is correct
28 Correct 121 ms 25256 KB Output is correct
29 Correct 160 ms 25176 KB Output is correct
30 Correct 110 ms 25084 KB Output is correct
31 Correct 124 ms 25192 KB Output is correct
32 Correct 135 ms 25192 KB Output is correct
33 Correct 179 ms 25176 KB Output is correct
34 Correct 134 ms 25164 KB Output is correct
35 Correct 81 ms 18728 KB Output is correct
36 Correct 52 ms 14296 KB Output is correct
37 Correct 107 ms 24688 KB Output is correct
38 Correct 117 ms 25548 KB Output is correct
39 Correct 102 ms 25596 KB Output is correct
40 Correct 99 ms 25528 KB Output is correct
41 Correct 104 ms 25608 KB Output is correct
42 Correct 110 ms 25508 KB Output is correct
43 Correct 112 ms 25444 KB Output is correct
44 Correct 117 ms 25600 KB Output is correct
45 Correct 283 ms 25740 KB Output is correct
46 Correct 199 ms 25500 KB Output is correct
47 Correct 733 ms 150672 KB Output is correct
48 Execution timed out 1095 ms 258636 KB Time limit exceeded
49 Halted 0 ms 0 KB -