oj.uz

Submission #472042

# Submission time Handle Problem Language Result Execution time Memory
472042 2021-09-12T13:30:23 Z hhhhaura Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 764 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 = 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>());
		a.assign(K, vector<vector<int>>(K, vector<int>()));
	}
	void get_new() {
		ii++;
		if(ii >= P) while(1);
	}
	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);
			}
		}
		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 74 ms 137968 KB Output is correct
2 Correct 73 ms 138052 KB Output is correct
3 Correct 73 ms 138020 KB Output is correct
4 Correct 74 ms 138052 KB Output is correct
5 Correct 73 ms 137968 KB Output is correct
6 Correct 73 ms 137956 KB Output is correct
7 Correct 73 ms 138052 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 138012 KB Output is correct
2 Correct 76 ms 137988 KB Output is correct
3 Correct 77 ms 137964 KB Output is correct
4 Correct 72 ms 138052 KB Output is correct
5 Correct 74 ms 138060 KB Output is correct
6 Correct 77 ms 137980 KB Output is correct
7 Correct 73 ms 137964 KB Output is correct
8 Correct 75 ms 138052 KB Output is correct
9 Correct 76 ms 137996 KB Output is correct
10 Correct 74 ms 138052 KB Output is correct
11 Correct 76 ms 138180 KB Output is correct
12 Correct 75 ms 138084 KB Output is correct
13 Correct 75 ms 138032 KB Output is correct
14 Correct 76 ms 138324 KB Output is correct
15 Correct 75 ms 138312 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 138004 KB Output is correct
2 Correct 74 ms 138044 KB Output is correct
3 Correct 76 ms 137960 KB Output is correct
4 Correct 76 ms 137952 KB Output is correct
5 Correct 74 ms 138036 KB Output is correct
6 Correct 74 ms 138004 KB Output is correct
7 Correct 73 ms 138024 KB Output is correct
8 Correct 73 ms 138052 KB Output is correct
9 Correct 75 ms 138052 KB Output is correct
10 Correct 75 ms 138080 KB Output is correct
11 Correct 75 ms 138300 KB Output is correct
12 Correct 75 ms 138024 KB Output is correct
13 Correct 74 ms 138048 KB Output is correct
14 Correct 74 ms 138332 KB Output is correct
15 Correct 74 ms 138308 KB Output is correct
16 Correct 74 ms 138208 KB Output is correct
17 Correct 82 ms 138664 KB Output is correct
18 Correct 76 ms 138268 KB Output is correct
19 Correct 74 ms 138260 KB Output is correct
20 Correct 75 ms 138144 KB Output is correct
21 Correct 75 ms 138176 KB Output is correct
22 Correct 76 ms 138436 KB Output is correct
23 Correct 78 ms 138336 KB Output is correct
24 Correct 77 ms 138592 KB Output is correct
25 Correct 75 ms 138320 KB Output is correct
26 Correct 76 ms 138404 KB Output is correct
27 Correct 77 ms 138380 KB Output is correct
28 Correct 79 ms 139264 KB Output is correct
29 Correct 85 ms 140860 KB Output is correct
30 Correct 76 ms 138784 KB Output is correct
31 Correct 80 ms 139584 KB Output is correct
32 Correct 78 ms 139124 KB Output is correct
33 Correct 95 ms 143744 KB Output is correct
34 Correct 98 ms 143748 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 138052 KB Output is correct
2 Correct 74 ms 137996 KB Output is correct
3 Correct 75 ms 137940 KB Output is correct
4 Correct 78 ms 138052 KB Output is correct
5 Correct 74 ms 138060 KB Output is correct
6 Correct 75 ms 137924 KB Output is correct
7 Correct 75 ms 137944 KB Output is correct
8 Correct 77 ms 138024 KB Output is correct
9 Correct 74 ms 138036 KB Output is correct
10 Correct 76 ms 138176 KB Output is correct
11 Correct 75 ms 138288 KB Output is correct
12 Correct 113 ms 138052 KB Output is correct
13 Correct 75 ms 137956 KB Output is correct
14 Correct 76 ms 138308 KB Output is correct
15 Correct 76 ms 138340 KB Output is correct
16 Correct 77 ms 138180 KB Output is correct
17 Correct 78 ms 138692 KB Output is correct
18 Correct 77 ms 138276 KB Output is correct
19 Correct 75 ms 138264 KB Output is correct
20 Correct 76 ms 138184 KB Output is correct
21 Correct 75 ms 138180 KB Output is correct
22 Correct 75 ms 138284 KB Output is correct
23 Correct 75 ms 138264 KB Output is correct
24 Correct 77 ms 138560 KB Output is correct
25 Correct 78 ms 138356 KB Output is correct
26 Correct 78 ms 138388 KB Output is correct
27 Correct 81 ms 138400 KB Output is correct
28 Correct 82 ms 139080 KB Output is correct
29 Correct 85 ms 140820 KB Output is correct
30 Correct 76 ms 138820 KB Output is correct
31 Correct 81 ms 139620 KB Output is correct
32 Correct 80 ms 139156 KB Output is correct
33 Correct 96 ms 143780 KB Output is correct
34 Correct 103 ms 143716 KB Output is correct
35 Correct 104 ms 142648 KB Output is correct
36 Correct 82 ms 138816 KB Output is correct
37 Correct 121 ms 146116 KB Output is correct
38 Correct 121 ms 145376 KB Output is correct
39 Correct 115 ms 145316 KB Output is correct
40 Correct 121 ms 145352 KB Output is correct
41 Correct 128 ms 145284 KB Output is correct
42 Correct 83 ms 138500 KB Output is correct
43 Correct 80 ms 138436 KB Output is correct
44 Correct 80 ms 138284 KB Output is correct
45 Correct 230 ms 160548 KB Output is correct
46 Correct 222 ms 160580 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 138044 KB Output is correct
2 Correct 82 ms 137948 KB Output is correct
3 Correct 78 ms 138000 KB Output is correct
4 Correct 83 ms 138036 KB Output is correct
5 Correct 80 ms 137960 KB Output is correct
6 Correct 80 ms 138012 KB Output is correct
7 Correct 84 ms 138052 KB Output is correct
8 Correct 82 ms 137980 KB Output is correct
9 Correct 83 ms 138000 KB Output is correct
10 Correct 82 ms 138016 KB Output is correct
11 Correct 78 ms 138292 KB Output is correct
12 Correct 82 ms 137996 KB Output is correct
13 Correct 81 ms 138184 KB Output is correct
14 Correct 80 ms 138388 KB Output is correct
15 Correct 79 ms 138324 KB Output is correct
16 Correct 80 ms 138188 KB Output is correct
17 Correct 80 ms 138688 KB Output is correct
18 Correct 78 ms 138280 KB Output is correct
19 Correct 80 ms 138244 KB Output is correct
20 Correct 83 ms 138148 KB Output is correct
21 Correct 78 ms 138168 KB Output is correct
22 Correct 77 ms 138328 KB Output is correct
23 Correct 80 ms 138328 KB Output is correct
24 Correct 85 ms 138536 KB Output is correct
25 Correct 77 ms 138368 KB Output is correct
26 Correct 77 ms 138356 KB Output is correct
27 Correct 77 ms 138276 KB Output is correct
28 Correct 78 ms 139108 KB Output is correct
29 Correct 88 ms 140928 KB Output is correct
30 Correct 79 ms 138868 KB Output is correct
31 Correct 94 ms 139608 KB Output is correct
32 Correct 81 ms 139168 KB Output is correct
33 Correct 104 ms 143728 KB Output is correct
34 Correct 102 ms 143736 KB Output is correct
35 Correct 104 ms 142904 KB Output is correct
36 Correct 81 ms 138928 KB Output is correct
37 Correct 132 ms 146168 KB Output is correct
38 Correct 129 ms 145676 KB Output is correct
39 Correct 126 ms 145644 KB Output is correct
40 Correct 145 ms 145584 KB Output is correct
41 Correct 123 ms 145676 KB Output is correct
42 Correct 87 ms 138772 KB Output is correct
43 Correct 88 ms 138696 KB Output is correct
44 Correct 88 ms 138528 KB Output is correct
45 Correct 236 ms 160748 KB Output is correct
46 Correct 230 ms 160876 KB Output is correct
47 Correct 308 ms 172888 KB Output is correct
48 Correct 115 ms 149064 KB Output is correct
49 Correct 110 ms 144956 KB Output is correct
50 Correct 103 ms 144924 KB Output is correct
51 Correct 175 ms 153128 KB Output is correct
52 Correct 172 ms 154476 KB Output is correct
53 Correct 104 ms 142684 KB Output is correct
54 Correct 83 ms 139516 KB Output is correct
55 Correct 83 ms 140612 KB Output is correct
56 Correct 89 ms 140688 KB Output is correct
57 Correct 169 ms 158416 KB Output is correct
58 Correct 94 ms 141392 KB Output is correct
59 Correct 101 ms 142988 KB Output is correct
60 Correct 109 ms 144760 KB Output is correct
61 Correct 109 ms 143456 KB Output is correct
62 Correct 168 ms 161732 KB Output is correct
63 Correct 764 ms 245020 KB Output is correct
64 Runtime error 404 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -