oj.uz

Submission #472038

# Submission time Handle Problem Language Result Execution time Memory
472038 2021-09-12T13:26:26 Z hhhhaura Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 319 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 = 7000000;
	const int K = 220;
	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 119 ms 193220 KB Output is correct
2 Correct 113 ms 193136 KB Output is correct
3 Correct 101 ms 193124 KB Output is correct
4 Correct 103 ms 193220 KB Output is correct
5 Correct 105 ms 193116 KB Output is correct
6 Correct 118 ms 193196 KB Output is correct
7 Correct 104 ms 193184 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 193220 KB Output is correct
2 Correct 102 ms 193156 KB Output is correct
3 Correct 105 ms 193112 KB Output is correct
4 Correct 121 ms 193116 KB Output is correct
5 Correct 108 ms 193120 KB Output is correct
6 Correct 101 ms 193224 KB Output is correct
7 Correct 108 ms 193216 KB Output is correct
8 Correct 105 ms 193220 KB Output is correct
9 Correct 102 ms 193220 KB Output is correct
10 Correct 104 ms 193220 KB Output is correct
11 Correct 106 ms 193476 KB Output is correct
12 Correct 103 ms 193140 KB Output is correct
13 Correct 103 ms 193168 KB Output is correct
14 Correct 104 ms 193476 KB Output is correct
15 Correct 106 ms 193520 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 193140 KB Output is correct
2 Correct 103 ms 193188 KB Output is correct
3 Correct 108 ms 193220 KB Output is correct
4 Correct 104 ms 193176 KB Output is correct
5 Correct 102 ms 193212 KB Output is correct
6 Correct 112 ms 193324 KB Output is correct
7 Correct 105 ms 193184 KB Output is correct
8 Correct 110 ms 193220 KB Output is correct
9 Correct 102 ms 193220 KB Output is correct
10 Correct 104 ms 193436 KB Output is correct
11 Correct 103 ms 193452 KB Output is correct
12 Correct 111 ms 193220 KB Output is correct
13 Correct 107 ms 193172 KB Output is correct
14 Correct 106 ms 193476 KB Output is correct
15 Correct 113 ms 193616 KB Output is correct
16 Correct 111 ms 193352 KB Output is correct
17 Correct 104 ms 193872 KB Output is correct
18 Correct 106 ms 193476 KB Output is correct
19 Correct 103 ms 193388 KB Output is correct
20 Correct 103 ms 193404 KB Output is correct
21 Correct 103 ms 193348 KB Output is correct
22 Correct 103 ms 193400 KB Output is correct
23 Correct 103 ms 193412 KB Output is correct
24 Correct 105 ms 193728 KB Output is correct
25 Correct 104 ms 193576 KB Output is correct
26 Correct 103 ms 193484 KB Output is correct
27 Correct 105 ms 193476 KB Output is correct
28 Correct 105 ms 194276 KB Output is correct
29 Correct 114 ms 196072 KB Output is correct
30 Correct 110 ms 194108 KB Output is correct
31 Correct 108 ms 194800 KB Output is correct
32 Correct 108 ms 194292 KB Output is correct
33 Correct 123 ms 198788 KB Output is correct
34 Correct 123 ms 198848 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 193244 KB Output is correct
2 Correct 105 ms 193220 KB Output is correct
3 Correct 101 ms 193184 KB Output is correct
4 Correct 102 ms 193116 KB Output is correct
5 Correct 106 ms 193180 KB Output is correct
6 Correct 104 ms 193156 KB Output is correct
7 Correct 106 ms 193200 KB Output is correct
8 Correct 120 ms 193128 KB Output is correct
9 Correct 104 ms 193148 KB Output is correct
10 Correct 104 ms 193224 KB Output is correct
11 Correct 104 ms 193476 KB Output is correct
12 Correct 103 ms 193172 KB Output is correct
13 Correct 104 ms 193152 KB Output is correct
14 Correct 106 ms 193472 KB Output is correct
15 Correct 105 ms 193476 KB Output is correct
16 Correct 106 ms 193424 KB Output is correct
17 Correct 122 ms 193864 KB Output is correct
18 Correct 103 ms 193468 KB Output is correct
19 Correct 104 ms 193436 KB Output is correct
20 Correct 107 ms 193472 KB Output is correct
21 Correct 114 ms 193256 KB Output is correct
22 Correct 101 ms 193464 KB Output is correct
23 Correct 103 ms 193476 KB Output is correct
24 Correct 104 ms 193716 KB Output is correct
25 Correct 112 ms 193604 KB Output is correct
26 Correct 103 ms 193544 KB Output is correct
27 Correct 106 ms 193524 KB Output is correct
28 Correct 116 ms 194280 KB Output is correct
29 Correct 113 ms 196036 KB Output is correct
30 Correct 106 ms 194020 KB Output is correct
31 Correct 110 ms 194756 KB Output is correct
32 Correct 140 ms 194348 KB Output is correct
33 Correct 129 ms 198812 KB Output is correct
34 Correct 127 ms 198852 KB Output is correct
35 Correct 135 ms 197884 KB Output is correct
36 Correct 108 ms 193988 KB Output is correct
37 Correct 148 ms 201156 KB Output is correct
38 Correct 147 ms 200516 KB Output is correct
39 Correct 148 ms 200520 KB Output is correct
40 Correct 146 ms 200576 KB Output is correct
41 Correct 146 ms 200512 KB Output is correct
42 Correct 114 ms 193752 KB Output is correct
43 Correct 114 ms 193600 KB Output is correct
44 Correct 109 ms 193604 KB Output is correct
45 Correct 250 ms 216084 KB Output is correct
46 Correct 250 ms 216004 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 193196 KB Output is correct
2 Correct 105 ms 193200 KB Output is correct
3 Correct 105 ms 193220 KB Output is correct
4 Correct 105 ms 193248 KB Output is correct
5 Correct 104 ms 193156 KB Output is correct
6 Correct 107 ms 193180 KB Output is correct
7 Correct 109 ms 193188 KB Output is correct
8 Correct 102 ms 193220 KB Output is correct
9 Correct 107 ms 193208 KB Output is correct
10 Correct 104 ms 193268 KB Output is correct
11 Correct 105 ms 193476 KB Output is correct
12 Correct 105 ms 193136 KB Output is correct
13 Correct 103 ms 193192 KB Output is correct
14 Correct 110 ms 193600 KB Output is correct
15 Correct 106 ms 193500 KB Output is correct
16 Correct 104 ms 193348 KB Output is correct
17 Correct 108 ms 193924 KB Output is correct
18 Correct 109 ms 193656 KB Output is correct
19 Correct 103 ms 193424 KB Output is correct
20 Correct 104 ms 193348 KB Output is correct
21 Correct 105 ms 193272 KB Output is correct
22 Correct 104 ms 193460 KB Output is correct
23 Correct 109 ms 193480 KB Output is correct
24 Correct 112 ms 193740 KB Output is correct
25 Correct 118 ms 193572 KB Output is correct
26 Correct 104 ms 193604 KB Output is correct
27 Correct 105 ms 193464 KB Output is correct
28 Correct 106 ms 194360 KB Output is correct
29 Correct 114 ms 196164 KB Output is correct
30 Correct 108 ms 193972 KB Output is correct
31 Correct 107 ms 194680 KB Output is correct
32 Correct 107 ms 194344 KB Output is correct
33 Correct 145 ms 198876 KB Output is correct
34 Correct 123 ms 198844 KB Output is correct
35 Correct 128 ms 197828 KB Output is correct
36 Correct 107 ms 194048 KB Output is correct
37 Correct 161 ms 201148 KB Output is correct
38 Correct 156 ms 200492 KB Output is correct
39 Correct 148 ms 200588 KB Output is correct
40 Correct 148 ms 200596 KB Output is correct
41 Correct 144 ms 200536 KB Output is correct
42 Correct 113 ms 193616 KB Output is correct
43 Correct 111 ms 193560 KB Output is correct
44 Correct 110 ms 193500 KB Output is correct
45 Correct 246 ms 216024 KB Output is correct
46 Correct 253 ms 215964 KB Output is correct
47 Correct 319 ms 227788 KB Output is correct
48 Correct 140 ms 204108 KB Output is correct
49 Correct 134 ms 199860 KB Output is correct
50 Correct 126 ms 199880 KB Output is correct
51 Correct 191 ms 207964 KB Output is correct
52 Correct 193 ms 209260 KB Output is correct
53 Correct 129 ms 197444 KB Output is correct
54 Correct 107 ms 194596 KB Output is correct
55 Correct 113 ms 195716 KB Output is correct
56 Correct 118 ms 195784 KB Output is correct
57 Correct 195 ms 213584 KB Output is correct
58 Correct 117 ms 196376 KB Output is correct
59 Correct 123 ms 197788 KB Output is correct
60 Correct 135 ms 199692 KB Output is correct
61 Correct 125 ms 198444 KB Output is correct
62 Correct 193 ms 216552 KB Output is correct
63 Runtime error 257 ms 262148 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -