oj.uz

Submission #472047

# Submission time Handle Problem Language Result Execution time Memory
472047 2021-09-12T13:43:13 Z hhhhaura Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 772 ms 262148 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

#define INF 1000000000
#define MOD 1000000007
#define eps (1e-9)

using namespace std;

#define lld long double
#define pii pair<int, int> 
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
	const int P = 5000000;
	const int K = 140;
	int n, m, st, ed, ii;
	vector<int> dis, s;
	vector<vector<pii>> mp;
	vector<vector<vector<int>>> a;
	void init_(int _n, int _m) {
		n = _n, m = _m, ii = n - 1;
		s.clear();
		dis.assign(P, INF);
		mp.assign(P, vector<pii>());
		rep(i, 0, K - 1) a.push_back(vector<vector<int>>(i, vector<int>()));
	}
	void get_new() {
		ii++;
		if(ii >= P) exit(0);
	}
	void add_node(int pos, int b) {
		for(int i = pos % b; i < n; i += b) {
			get_new();
			if(i == pos) mp[i].push_back({ii, 0});
			if(i != pos % b) {
				mp[ii].push_back({ii - 1, 1});
				mp[ii - 1].push_back({ii, 1});
			}
			mp[ii].push_back({i, 0});
		}
	}
	int solve() {
		rep(i, 1, K - 1) rep(j, 0, i - 1) {
			if(!a[i][j].size()) continue;
			sort(all(a[i][j]));
			vector<int> &v = a[i][j];
			int id = -1;
			for(int k = j; k < n; k += i) {
				get_new();
				while(id + 1 < v.size() && v[id + 1] <= k) id ++;
				if(id >= 0 && v[id] == k) mp[k].push_back({ii, 0});
				if(k != j) {
					mp[ii].push_back({ii - 1, 1});
					mp[ii - 1].push_back({ii, 1});
				}
				mp[ii].push_back({k, 0});
			}
		}
		dis[st] = 0;
		deque<int> q;
		q.push_back(st);
		while(q.size()) {
			int cur = q.front();
			q.pop_front();
			for(auto i : mp[cur]) if(dis[i.first] == INF) {
				dis[i.first] = i.second + dis[cur];
				if(i.second) q.push_back(i.first);
				else q.push_front(i.first);
				if(i.first == ed) return dis[ed];
			}
		}
		return (dis[ed] == INF ? -1 : dis[ed]);
	}
};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n, m, b, p; 
	cin >> n >> m;
	init_(n, m);
	rep(i, 0, m - 1) {
		cin >> b >> p;
		if(i == 0) st = b;
		if(i == 1) ed = b;
		if(p >= K) add_node(b, p);
		else a[p][b % p].push_back(b);
	} 
	cout << solve() << "\n";
	return 0;
}

Compilation message

skyscraper.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
skyscraper.cpp:23:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
skyscraper.cpp:23:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~
skyscraper.cpp: In function 'int solver::solve()':
skyscraper.cpp:67:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     while(id + 1 < v.size() && v[id + 1] <= k) id ++;
      |           ~~~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 137412 KB Output is correct
2 Correct 80 ms 137452 KB Output is correct
3 Correct 85 ms 137440 KB Output is correct
4 Correct 76 ms 137476 KB Output is correct
5 Correct 77 ms 137428 KB Output is correct
6 Correct 86 ms 137524 KB Output is correct
7 Correct 75 ms 137412 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 137476 KB Output is correct
2 Correct 77 ms 137532 KB Output is correct
3 Correct 79 ms 137412 KB Output is correct
4 Correct 78 ms 137512 KB Output is correct
5 Correct 77 ms 137472 KB Output is correct
6 Correct 77 ms 137460 KB Output is correct
7 Correct 78 ms 137412 KB Output is correct
8 Correct 78 ms 137408 KB Output is correct
9 Correct 78 ms 137412 KB Output is correct
10 Correct 76 ms 137492 KB Output is correct
11 Correct 76 ms 137740 KB Output is correct
12 Correct 79 ms 137544 KB Output is correct
13 Correct 76 ms 137508 KB Output is correct
14 Correct 83 ms 137788 KB Output is correct
15 Correct 77 ms 137756 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 137464 KB Output is correct
2 Correct 81 ms 137508 KB Output is correct
3 Correct 77 ms 137468 KB Output is correct
4 Correct 84 ms 137440 KB Output is correct
5 Correct 76 ms 137508 KB Output is correct
6 Correct 77 ms 137480 KB Output is correct
7 Correct 76 ms 137508 KB Output is correct
8 Correct 77 ms 137416 KB Output is correct
9 Correct 77 ms 137536 KB Output is correct
10 Correct 78 ms 137604 KB Output is correct
11 Correct 77 ms 137732 KB Output is correct
12 Correct 87 ms 137540 KB Output is correct
13 Correct 86 ms 137532 KB Output is correct
14 Correct 78 ms 137820 KB Output is correct
15 Correct 78 ms 137796 KB Output is correct
16 Correct 77 ms 137668 KB Output is correct
17 Correct 80 ms 138160 KB Output is correct
18 Correct 82 ms 137788 KB Output is correct
19 Correct 77 ms 137664 KB Output is correct
20 Correct 79 ms 137596 KB Output is correct
21 Correct 77 ms 137536 KB Output is correct
22 Correct 80 ms 137668 KB Output is correct
23 Correct 78 ms 137784 KB Output is correct
24 Correct 79 ms 138092 KB Output is correct
25 Correct 81 ms 137848 KB Output is correct
26 Correct 79 ms 137896 KB Output is correct
27 Correct 77 ms 137836 KB Output is correct
28 Correct 91 ms 138500 KB Output is correct
29 Correct 87 ms 140420 KB Output is correct
30 Correct 79 ms 138308 KB Output is correct
31 Correct 87 ms 139092 KB Output is correct
32 Correct 84 ms 138616 KB Output is correct
33 Correct 112 ms 143096 KB Output is correct
34 Correct 97 ms 143184 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 137524 KB Output is correct
2 Correct 77 ms 137404 KB Output is correct
3 Correct 76 ms 137412 KB Output is correct
4 Correct 88 ms 137468 KB Output is correct
5 Correct 80 ms 137472 KB Output is correct
6 Correct 79 ms 137424 KB Output is correct
7 Correct 80 ms 137524 KB Output is correct
8 Correct 79 ms 137444 KB Output is correct
9 Correct 76 ms 137536 KB Output is correct
10 Correct 77 ms 137604 KB Output is correct
11 Correct 79 ms 137712 KB Output is correct
12 Correct 79 ms 137436 KB Output is correct
13 Correct 81 ms 137572 KB Output is correct
14 Correct 80 ms 137792 KB Output is correct
15 Correct 80 ms 137792 KB Output is correct
16 Correct 85 ms 137612 KB Output is correct
17 Correct 95 ms 138200 KB Output is correct
18 Correct 84 ms 137848 KB Output is correct
19 Correct 77 ms 137844 KB Output is correct
20 Correct 81 ms 137696 KB Output is correct
21 Correct 87 ms 137552 KB Output is correct
22 Correct 79 ms 137808 KB Output is correct
23 Correct 76 ms 137768 KB Output is correct
24 Correct 80 ms 138052 KB Output is correct
25 Correct 79 ms 137796 KB Output is correct
26 Correct 77 ms 137796 KB Output is correct
27 Correct 81 ms 137796 KB Output is correct
28 Correct 84 ms 138620 KB Output is correct
29 Correct 86 ms 140292 KB Output is correct
30 Correct 88 ms 138344 KB Output is correct
31 Correct 83 ms 138976 KB Output is correct
32 Correct 78 ms 138564 KB Output is correct
33 Correct 98 ms 143172 KB Output is correct
34 Correct 99 ms 143136 KB Output is correct
35 Correct 103 ms 142104 KB Output is correct
36 Correct 80 ms 138252 KB Output is correct
37 Correct 108 ms 145516 KB Output is correct
38 Correct 113 ms 144744 KB Output is correct
39 Correct 106 ms 144716 KB Output is correct
40 Correct 110 ms 144796 KB Output is correct
41 Correct 105 ms 144720 KB Output is correct
42 Correct 89 ms 138016 KB Output is correct
43 Correct 82 ms 137864 KB Output is correct
44 Correct 83 ms 137796 KB Output is correct
45 Correct 236 ms 160052 KB Output is correct
46 Correct 209 ms 159936 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 137476 KB Output is correct
2 Correct 77 ms 137412 KB Output is correct
3 Correct 79 ms 137520 KB Output is correct
4 Correct 78 ms 137480 KB Output is correct
5 Correct 81 ms 137432 KB Output is correct
6 Correct 77 ms 137440 KB Output is correct
7 Correct 78 ms 137424 KB Output is correct
8 Correct 79 ms 137568 KB Output is correct
9 Correct 78 ms 137416 KB Output is correct
10 Correct 78 ms 137540 KB Output is correct
11 Correct 76 ms 137728 KB Output is correct
12 Correct 78 ms 137448 KB Output is correct
13 Correct 78 ms 137420 KB Output is correct
14 Correct 78 ms 137800 KB Output is correct
15 Correct 80 ms 137780 KB Output is correct
16 Correct 76 ms 137700 KB Output is correct
17 Correct 80 ms 138180 KB Output is correct
18 Correct 79 ms 137796 KB Output is correct
19 Correct 81 ms 137628 KB Output is correct
20 Correct 86 ms 137668 KB Output is correct
21 Correct 76 ms 137540 KB Output is correct
22 Correct 76 ms 137740 KB Output is correct
23 Correct 76 ms 137796 KB Output is correct
24 Correct 80 ms 138056 KB Output is correct
25 Correct 88 ms 137872 KB Output is correct
26 Correct 78 ms 137796 KB Output is correct
27 Correct 76 ms 137724 KB Output is correct
28 Correct 80 ms 138580 KB Output is correct
29 Correct 90 ms 140340 KB Output is correct
30 Correct 81 ms 138324 KB Output is correct
31 Correct 83 ms 138980 KB Output is correct
32 Correct 79 ms 138612 KB Output is correct
33 Correct 102 ms 143180 KB Output is correct
34 Correct 99 ms 143108 KB Output is correct
35 Correct 97 ms 142092 KB Output is correct
36 Correct 80 ms 138268 KB Output is correct
37 Correct 108 ms 145524 KB Output is correct
38 Correct 126 ms 144752 KB Output is correct
39 Correct 105 ms 144780 KB Output is correct
40 Correct 108 ms 144772 KB Output is correct
41 Correct 107 ms 144840 KB Output is correct
42 Correct 82 ms 137936 KB Output is correct
43 Correct 82 ms 137924 KB Output is correct
44 Correct 82 ms 137776 KB Output is correct
45 Correct 245 ms 159832 KB Output is correct
46 Correct 207 ms 159928 KB Output is correct
47 Correct 214 ms 171952 KB Output is correct
48 Correct 121 ms 148328 KB Output is correct
49 Correct 107 ms 144164 KB Output is correct
50 Correct 113 ms 144280 KB Output is correct
51 Correct 156 ms 152196 KB Output is correct
52 Correct 142 ms 153552 KB Output is correct
53 Correct 99 ms 141812 KB Output is correct
54 Correct 79 ms 138920 KB Output is correct
55 Correct 86 ms 139996 KB Output is correct
56 Correct 92 ms 139884 KB Output is correct
57 Correct 136 ms 157840 KB Output is correct
58 Correct 91 ms 140788 KB Output is correct
59 Correct 101 ms 142256 KB Output is correct
60 Correct 103 ms 144140 KB Output is correct
61 Correct 98 ms 142584 KB Output is correct
62 Correct 168 ms 160836 KB Output is correct
63 Correct 772 ms 243992 KB Output is correct
64 Runtime error 406 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -