oj.uz

Submission #398430

# Submission time Handle Problem Language Result Execution time Memory
398430 2021-05-04T09:10:49 Z tengiz05 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 222360 KB 
#include <bits/stdc++.h>
using namespace std;
inline long long msb(long long val){return 63-__builtin_clzll(val);}
inline int msb(int val){return 31-__builtin_clz(val);}
//~ #define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
#define emplace_back push_back
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 30000, M = 30000;
int n, m, k;
bitset<M> used[N];
bitset<N> vis[N];
int len[N];
vector<int> who_is_here[N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	int start;
	for(i=0;i<m;i++){
		int pos;
		cin >> pos >> len[i];
		if(i){
			who_is_here[pos].pb(i);
		}else {
			start = pos;
		}
	}
	//~ priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>, greater<tuple<int,int,int>>> q;
	deque<array<int,3>> q;
	q.emplace_back({0,start,0});
	used[start][0] = 1;
	vis[start][len[0]] = 1;
	while(!q.empty()){
		auto [dist, pos, i] = q.front(); q.pop_front();
		if(i == 1){
			cout << dist << '\n';
			return;
		}
		while(who_is_here[pos].size()){
			auto x = who_is_here[pos].back();
			who_is_here[pos].pop_back();
			if(x == 1){
				cout << dist << '\n';
				return;
			}
			if(vis[pos][len[x]])continue;
			used[pos][x] = 1;
			vis[pos][len[x]] = 1;
			q.push_front({dist,pos,x});
		}
		if(pos - len[i] >=0 && !used[pos-len[i]][i] && !vis[pos-len[i]][len[i]]){
			used[pos-len[i]][i] = 1;
			vis[pos-len[i]][len[i]] = 1;
			q.emplace_back({dist+1,pos-len[i],i});
		}
		if(pos + len[i] < n && !used[pos+len[i]][i] && !vis[pos+len[i]][len[i]]){
			used[pos+len[i]][i] = 1;
			vis[pos+len[i]][len[i]] = 1;
			q.emplace_back({dist+1,pos+len[i],i});
			}
	}
	cout << -1 << '\n';
	return;
}

signed main(){
	FASTIO;
//~ #define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Compilation message

skyscraper.cpp: In function 'void solve(int)':
skyscraper.cpp:24:9: warning: unused variable 'j' [-Wunused-variable]
   24 |  int i, j;
      |         ^
skyscraper.cpp:26:6: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |  int start;
      |      ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1700 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 2 ms 1484 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 3 ms 1740 KB Output is correct
15 Correct 2 ms 1740 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 5 ms 6468 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 11 ms 15692 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 9 ms 11596 KB Output is correct
24 Correct 10 ms 13900 KB Output is correct
25 Correct 3 ms 3788 KB Output is correct
26 Correct 10 ms 13480 KB Output is correct
27 Correct 10 ms 14288 KB Output is correct
28 Correct 12 ms 15692 KB Output is correct
29 Correct 13 ms 15692 KB Output is correct
30 Correct 11 ms 15692 KB Output is correct
31 Correct 12 ms 15648 KB Output is correct
32 Correct 11 ms 15696 KB Output is correct
33 Correct 17 ms 15692 KB Output is correct
34 Correct 14 ms 15672 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 1740 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 5 ms 6476 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 11 ms 15692 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 8 ms 11608 KB Output is correct
24 Correct 10 ms 14016 KB Output is correct
25 Correct 3 ms 3916 KB Output is correct
26 Correct 9 ms 13508 KB Output is correct
27 Correct 10 ms 14284 KB Output is correct
28 Correct 13 ms 15704 KB Output is correct
29 Correct 14 ms 15648 KB Output is correct
30 Correct 11 ms 15692 KB Output is correct
31 Correct 12 ms 15692 KB Output is correct
32 Correct 11 ms 15648 KB Output is correct
33 Correct 20 ms 15772 KB Output is correct
34 Correct 14 ms 15692 KB Output is correct
35 Correct 16 ms 11980 KB Output is correct
36 Correct 5 ms 4812 KB Output is correct
37 Correct 16 ms 15692 KB Output is correct
38 Correct 21 ms 16336 KB Output is correct
39 Correct 8 ms 2256 KB Output is correct
40 Correct 11 ms 6852 KB Output is correct
41 Correct 16 ms 15132 KB Output is correct
42 Correct 13 ms 13884 KB Output is correct
43 Correct 14 ms 14668 KB Output is correct
44 Correct 15 ms 15964 KB Output is correct
45 Correct 49 ms 16384 KB Output is correct
46 Correct 31 ms 16324 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 1740 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 5 ms 6476 KB Output is correct
18 Correct 1 ms 1040 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 11 ms 15692 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 8 ms 11596 KB Output is correct
24 Correct 10 ms 13900 KB Output is correct
25 Correct 3 ms 3788 KB Output is correct
26 Correct 9 ms 13564 KB Output is correct
27 Correct 10 ms 14284 KB Output is correct
28 Correct 13 ms 15708 KB Output is correct
29 Correct 13 ms 15692 KB Output is correct
30 Correct 11 ms 15692 KB Output is correct
31 Correct 13 ms 15692 KB Output is correct
32 Correct 11 ms 15692 KB Output is correct
33 Correct 16 ms 15676 KB Output is correct
34 Correct 14 ms 15692 KB Output is correct
35 Correct 16 ms 11980 KB Output is correct
36 Correct 5 ms 4812 KB Output is correct
37 Correct 16 ms 15632 KB Output is correct
38 Correct 21 ms 16260 KB Output is correct
39 Correct 8 ms 2252 KB Output is correct
40 Correct 11 ms 6800 KB Output is correct
41 Correct 18 ms 15080 KB Output is correct
42 Correct 13 ms 13900 KB Output is correct
43 Correct 14 ms 14676 KB Output is correct
44 Correct 15 ms 16072 KB Output is correct
45 Correct 47 ms 16360 KB Output is correct
46 Correct 32 ms 16324 KB Output is correct
47 Correct 49 ms 63044 KB Output is correct
48 Correct 8 ms 1612 KB Output is correct
49 Correct 7 ms 1484 KB Output is correct
50 Correct 5 ms 1484 KB Output is correct
51 Correct 123 ms 170432 KB Output is correct
52 Correct 137 ms 184772 KB Output is correct
53 Correct 30 ms 35028 KB Output is correct
54 Correct 76 ms 121412 KB Output is correct
55 Correct 96 ms 154692 KB Output is correct
56 Correct 151 ms 222360 KB Output is correct
57 Correct 4 ms 4216 KB Output is correct
58 Correct 148 ms 221640 KB Output is correct
59 Correct 140 ms 206092 KB Output is correct
60 Correct 137 ms 206036 KB Output is correct
61 Correct 128 ms 195724 KB Output is correct
62 Correct 219 ms 222356 KB Output is correct
63 Correct 518 ms 221748 KB Output is correct
64 Correct 593 ms 221856 KB Output is correct
65 Correct 777 ms 222012 KB Output is correct
66 Execution timed out 1103 ms 222204 KB Time limit exceeded
67 Halted 0 ms 0 KB -