oj.uz

Submission #472033

# Submission time Handle Problem Language Result Execution time Memory
472033 2021-09-12T13:19:50 Z hhhhaura Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 209788 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 = 10000000;
	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(n, INF);
		mp.assign(n, vector<pii>());
		a.assign(K, vector<vector<int>>(K, vector<int>()));
	}
	void get_new() {
		mp.push_back(vector<pii>());
		dis.push_back(INF);
		ii++;
	}
	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];
			for(int k = j; k < n; k += i) {
				get_new();
				int id = lower_bound(all(v), k) - v.begin();
				if(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;}
      |                     ^~~~

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 972 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 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 4 ms 1484 KB Output is correct

Subtask #3
14.0 / 14.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 2 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1360 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 5 ms 2112 KB Output is correct
18 Correct 2 ms 1612 KB Output is correct
19 Correct 3 ms 1468 KB Output is correct
20 Correct 2 ms 1348 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 1716 KB Output is correct
23 Correct 3 ms 1612 KB Output is correct
24 Correct 5 ms 2072 KB Output is correct
25 Correct 3 ms 1740 KB Output is correct
26 Correct 3 ms 1740 KB Output is correct
27 Correct 3 ms 1740 KB Output is correct
28 Correct 6 ms 2832 KB Output is correct
29 Correct 14 ms 5672 KB Output is correct
30 Correct 5 ms 2448 KB Output is correct
31 Correct 8 ms 4120 KB Output is correct
32 Correct 6 ms 2840 KB Output is correct
33 Correct 29 ms 10020 KB Output is correct
34 Correct 29 ms 10092 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 976 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1104 KB Output is correct
11 Correct 3 ms 1356 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 3 ms 1488 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 5 ms 2116 KB Output is correct
18 Correct 3 ms 1616 KB Output is correct
19 Correct 2 ms 1488 KB Output is correct
20 Correct 2 ms 1360 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 3 ms 1616 KB Output is correct
23 Correct 3 ms 1616 KB Output is correct
24 Correct 5 ms 2072 KB Output is correct
25 Correct 4 ms 1740 KB Output is correct
26 Correct 3 ms 1752 KB Output is correct
27 Correct 3 ms 1740 KB Output is correct
28 Correct 6 ms 2844 KB Output is correct
29 Correct 18 ms 5664 KB Output is correct
30 Correct 5 ms 2448 KB Output is correct
31 Correct 8 ms 4048 KB Output is correct
32 Correct 6 ms 2840 KB Output is correct
33 Correct 29 ms 10068 KB Output is correct
34 Correct 30 ms 10056 KB Output is correct
35 Correct 36 ms 9936 KB Output is correct
36 Correct 6 ms 2684 KB Output is correct
37 Correct 57 ms 14060 KB Output is correct
38 Correct 58 ms 13428 KB Output is correct
39 Correct 68 ms 13404 KB Output is correct
40 Correct 54 ms 13340 KB Output is correct
41 Correct 55 ms 13372 KB Output is correct
42 Correct 8 ms 1996 KB Output is correct
43 Correct 8 ms 1996 KB Output is correct
44 Correct 7 ms 1720 KB Output is correct
45 Correct 175 ms 37060 KB Output is correct
46 Correct 181 ms 37052 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 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 3 ms 1484 KB Output is correct
15 Correct 3 ms 1484 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 5 ms 2112 KB Output is correct
18 Correct 2 ms 1612 KB Output is correct
19 Correct 2 ms 1484 KB Output is correct
20 Correct 2 ms 1356 KB Output is correct
21 Correct 2 ms 1228 KB Output is correct
22 Correct 2 ms 1612 KB Output is correct
23 Correct 3 ms 1612 KB Output is correct
24 Correct 4 ms 2064 KB Output is correct
25 Correct 3 ms 1740 KB Output is correct
26 Correct 3 ms 1740 KB Output is correct
27 Correct 3 ms 1740 KB Output is correct
28 Correct 6 ms 2840 KB Output is correct
29 Correct 15 ms 5696 KB Output is correct
30 Correct 5 ms 2584 KB Output is correct
31 Correct 8 ms 4120 KB Output is correct
32 Correct 6 ms 2840 KB Output is correct
33 Correct 29 ms 10020 KB Output is correct
34 Correct 28 ms 10036 KB Output is correct
35 Correct 35 ms 9952 KB Output is correct
36 Correct 6 ms 2736 KB Output is correct
37 Correct 58 ms 14048 KB Output is correct
38 Correct 54 ms 13344 KB Output is correct
39 Correct 56 ms 13368 KB Output is correct
40 Correct 63 ms 13360 KB Output is correct
41 Correct 60 ms 13384 KB Output is correct
42 Correct 11 ms 1996 KB Output is correct
43 Correct 8 ms 2096 KB Output is correct
44 Correct 7 ms 1748 KB Output is correct
45 Correct 170 ms 37112 KB Output is correct
46 Correct 178 ms 37048 KB Output is correct
47 Correct 265 ms 56500 KB Output is correct
48 Correct 65 ms 19180 KB Output is correct
49 Correct 38 ms 12600 KB Output is correct
50 Correct 39 ms 12628 KB Output is correct
51 Correct 102 ms 25628 KB Output is correct
52 Correct 114 ms 27780 KB Output is correct
53 Correct 37 ms 8972 KB Output is correct
54 Correct 7 ms 4108 KB Output is correct
55 Correct 13 ms 5900 KB Output is correct
56 Correct 19 ms 5516 KB Output is correct
57 Correct 119 ms 34044 KB Output is correct
58 Correct 20 ms 7052 KB Output is correct
59 Correct 28 ms 11656 KB Output is correct
60 Correct 39 ms 12352 KB Output is correct
61 Correct 39 ms 11648 KB Output is correct
62 Correct 124 ms 47204 KB Output is correct
63 Correct 888 ms 187208 KB Output is correct
64 Execution timed out 1099 ms 209788 KB Time limit exceeded
65 Halted 0 ms 0 KB -