oj.uz

Submission #472046

# Submission time Handle Problem Language Result Execution time Memory
472046 2021-09-12T13:42:02 Z hhhhaura Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 944 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 = 4000000;
	const int K = 180;
	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 63 ms 110276 KB Output is correct
2 Correct 62 ms 110224 KB Output is correct
3 Correct 62 ms 110184 KB Output is correct
4 Correct 69 ms 110280 KB Output is correct
5 Correct 61 ms 110276 KB Output is correct
6 Correct 70 ms 110240 KB Output is correct
7 Correct 69 ms 110236 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 110280 KB Output is correct
2 Correct 61 ms 110276 KB Output is correct
3 Correct 60 ms 110228 KB Output is correct
4 Correct 61 ms 110208 KB Output is correct
5 Correct 60 ms 110276 KB Output is correct
6 Correct 62 ms 110232 KB Output is correct
7 Correct 64 ms 110168 KB Output is correct
8 Correct 61 ms 110236 KB Output is correct
9 Correct 61 ms 110276 KB Output is correct
10 Correct 61 ms 110340 KB Output is correct
11 Correct 63 ms 110480 KB Output is correct
12 Correct 69 ms 110276 KB Output is correct
13 Correct 62 ms 110280 KB Output is correct
14 Correct 67 ms 110532 KB Output is correct
15 Correct 62 ms 110528 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 110204 KB Output is correct
2 Correct 65 ms 110184 KB Output is correct
3 Correct 64 ms 110300 KB Output is correct
4 Correct 62 ms 110276 KB Output is correct
5 Correct 61 ms 110204 KB Output is correct
6 Correct 62 ms 110236 KB Output is correct
7 Correct 63 ms 110220 KB Output is correct
8 Correct 65 ms 110236 KB Output is correct
9 Correct 65 ms 110264 KB Output is correct
10 Correct 64 ms 110276 KB Output is correct
11 Correct 63 ms 110404 KB Output is correct
12 Correct 62 ms 110300 KB Output is correct
13 Correct 62 ms 110276 KB Output is correct
14 Correct 64 ms 110608 KB Output is correct
15 Correct 66 ms 110568 KB Output is correct
16 Correct 66 ms 110400 KB Output is correct
17 Correct 64 ms 110928 KB Output is correct
18 Correct 62 ms 110532 KB Output is correct
19 Correct 68 ms 110404 KB Output is correct
20 Correct 85 ms 110340 KB Output is correct
21 Correct 67 ms 110328 KB Output is correct
22 Correct 64 ms 110532 KB Output is correct
23 Correct 63 ms 110532 KB Output is correct
24 Correct 63 ms 110820 KB Output is correct
25 Correct 63 ms 110560 KB Output is correct
26 Correct 66 ms 110588 KB Output is correct
27 Correct 63 ms 110528 KB Output is correct
28 Correct 65 ms 111288 KB Output is correct
29 Correct 89 ms 113060 KB Output is correct
30 Correct 66 ms 111024 KB Output is correct
31 Correct 70 ms 111728 KB Output is correct
32 Correct 67 ms 111392 KB Output is correct
33 Correct 86 ms 115900 KB Output is correct
34 Correct 83 ms 115864 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 110276 KB Output is correct
2 Correct 61 ms 110272 KB Output is correct
3 Correct 66 ms 110276 KB Output is correct
4 Correct 66 ms 110276 KB Output is correct
5 Correct 70 ms 110192 KB Output is correct
6 Correct 64 ms 110248 KB Output is correct
7 Correct 64 ms 110276 KB Output is correct
8 Correct 62 ms 110276 KB Output is correct
9 Correct 61 ms 110244 KB Output is correct
10 Correct 64 ms 110276 KB Output is correct
11 Correct 66 ms 110536 KB Output is correct
12 Correct 62 ms 110184 KB Output is correct
13 Correct 62 ms 110304 KB Output is correct
14 Correct 63 ms 110496 KB Output is correct
15 Correct 63 ms 110532 KB Output is correct
16 Correct 64 ms 110456 KB Output is correct
17 Correct 69 ms 110856 KB Output is correct
18 Correct 65 ms 110568 KB Output is correct
19 Correct 72 ms 110512 KB Output is correct
20 Correct 74 ms 110420 KB Output is correct
21 Correct 64 ms 110288 KB Output is correct
22 Correct 65 ms 110516 KB Output is correct
23 Correct 62 ms 110500 KB Output is correct
24 Correct 67 ms 110864 KB Output is correct
25 Correct 64 ms 110604 KB Output is correct
26 Correct 66 ms 110652 KB Output is correct
27 Correct 64 ms 110496 KB Output is correct
28 Correct 66 ms 111388 KB Output is correct
29 Correct 73 ms 113284 KB Output is correct
30 Correct 66 ms 110992 KB Output is correct
31 Correct 70 ms 111840 KB Output is correct
32 Correct 67 ms 111400 KB Output is correct
33 Correct 88 ms 115884 KB Output is correct
34 Correct 87 ms 115908 KB Output is correct
35 Correct 88 ms 115040 KB Output is correct
36 Correct 67 ms 111068 KB Output is correct
37 Correct 94 ms 118212 KB Output is correct
38 Correct 109 ms 117516 KB Output is correct
39 Correct 92 ms 117480 KB Output is correct
40 Correct 91 ms 117536 KB Output is correct
41 Correct 100 ms 117472 KB Output is correct
42 Correct 71 ms 110664 KB Output is correct
43 Correct 67 ms 110688 KB Output is correct
44 Correct 68 ms 110552 KB Output is correct
45 Correct 217 ms 132864 KB Output is correct
46 Correct 191 ms 132924 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 110276 KB Output is correct
2 Correct 62 ms 110268 KB Output is correct
3 Correct 63 ms 110268 KB Output is correct
4 Correct 68 ms 110176 KB Output is correct
5 Correct 68 ms 110272 KB Output is correct
6 Correct 63 ms 110272 KB Output is correct
7 Correct 62 ms 110204 KB Output is correct
8 Correct 63 ms 110252 KB Output is correct
9 Correct 65 ms 110252 KB Output is correct
10 Correct 63 ms 110276 KB Output is correct
11 Correct 65 ms 110520 KB Output is correct
12 Correct 64 ms 110364 KB Output is correct
13 Correct 64 ms 110240 KB Output is correct
14 Correct 66 ms 110492 KB Output is correct
15 Correct 74 ms 110548 KB Output is correct
16 Correct 64 ms 110460 KB Output is correct
17 Correct 65 ms 110940 KB Output is correct
18 Correct 65 ms 110480 KB Output is correct
19 Correct 63 ms 110404 KB Output is correct
20 Correct 74 ms 110412 KB Output is correct
21 Correct 63 ms 110404 KB Output is correct
22 Correct 70 ms 110548 KB Output is correct
23 Correct 67 ms 110480 KB Output is correct
24 Correct 70 ms 110816 KB Output is correct
25 Correct 65 ms 110532 KB Output is correct
26 Correct 66 ms 110536 KB Output is correct
27 Correct 63 ms 110560 KB Output is correct
28 Correct 67 ms 111284 KB Output is correct
29 Correct 75 ms 113100 KB Output is correct
30 Correct 65 ms 111064 KB Output is correct
31 Correct 69 ms 111852 KB Output is correct
32 Correct 67 ms 111344 KB Output is correct
33 Correct 89 ms 115860 KB Output is correct
34 Correct 87 ms 115928 KB Output is correct
35 Correct 88 ms 114920 KB Output is correct
36 Correct 65 ms 111044 KB Output is correct
37 Correct 95 ms 118192 KB Output is correct
38 Correct 97 ms 117560 KB Output is correct
39 Correct 97 ms 117440 KB Output is correct
40 Correct 97 ms 117524 KB Output is correct
41 Correct 92 ms 117424 KB Output is correct
42 Correct 69 ms 110660 KB Output is correct
43 Correct 70 ms 110708 KB Output is correct
44 Correct 68 ms 110596 KB Output is correct
45 Correct 224 ms 132944 KB Output is correct
46 Correct 188 ms 132804 KB Output is correct
47 Correct 177 ms 144716 KB Output is correct
48 Correct 102 ms 121152 KB Output is correct
49 Correct 89 ms 116944 KB Output is correct
50 Correct 89 ms 116968 KB Output is correct
51 Correct 127 ms 124996 KB Output is correct
52 Correct 136 ms 126368 KB Output is correct
53 Correct 82 ms 114600 KB Output is correct
54 Correct 69 ms 111684 KB Output is correct
55 Correct 70 ms 112768 KB Output is correct
56 Correct 77 ms 112732 KB Output is correct
57 Correct 122 ms 130560 KB Output is correct
58 Correct 88 ms 113548 KB Output is correct
59 Correct 83 ms 114884 KB Output is correct
60 Correct 86 ms 116804 KB Output is correct
61 Correct 86 ms 115420 KB Output is correct
62 Correct 154 ms 133524 KB Output is correct
63 Correct 831 ms 216832 KB Output is correct
64 Correct 944 ms 241132 KB Output is correct
65 Runtime error 462 ms 262148 KB Execution killed with signal 9
66 Halted 0 ms 0 KB -