oj.uz

답안 #472050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472050 2021-09-12T13:51:07 Z hhhhaura Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 765 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 = 174;
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 137540 KB Output is correct
2 Correct 77 ms 137536 KB Output is correct
3 Correct 77 ms 137580 KB Output is correct
4 Correct 87 ms 137540 KB Output is correct
5 Correct 77 ms 137560 KB Output is correct
6 Correct 77 ms 137536 KB Output is correct
7 Correct 76 ms 137580 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 137540 KB Output is correct
2 Correct 81 ms 137552 KB Output is correct
3 Correct 82 ms 137644 KB Output is correct
4 Correct 77 ms 137540 KB Output is correct
5 Correct 76 ms 137552 KB Output is correct
6 Correct 79 ms 137596 KB Output is correct
7 Correct 78 ms 137632 KB Output is correct
8 Correct 76 ms 137608 KB Output is correct
9 Correct 78 ms 137568 KB Output is correct
10 Correct 86 ms 137708 KB Output is correct
11 Correct 77 ms 137796 KB Output is correct
12 Correct 75 ms 137672 KB Output is correct
13 Correct 77 ms 137556 KB Output is correct
14 Correct 78 ms 137920 KB Output is correct
15 Correct 77 ms 137924 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 137632 KB Output is correct
2 Correct 76 ms 137580 KB Output is correct
3 Correct 80 ms 137572 KB Output is correct
4 Correct 75 ms 137548 KB Output is correct
5 Correct 87 ms 137640 KB Output is correct
6 Correct 76 ms 137580 KB Output is correct
7 Correct 78 ms 137668 KB Output is correct
8 Correct 76 ms 137668 KB Output is correct
9 Correct 75 ms 137636 KB Output is correct
10 Correct 77 ms 137648 KB Output is correct
11 Correct 76 ms 137828 KB Output is correct
12 Correct 76 ms 137636 KB Output is correct
13 Correct 78 ms 137672 KB Output is correct
14 Correct 86 ms 137876 KB Output is correct
15 Correct 78 ms 137856 KB Output is correct
16 Correct 78 ms 137820 KB Output is correct
17 Correct 80 ms 138300 KB Output is correct
18 Correct 76 ms 137944 KB Output is correct
19 Correct 75 ms 137888 KB Output is correct
20 Correct 81 ms 137824 KB Output is correct
21 Correct 88 ms 137772 KB Output is correct
22 Correct 77 ms 137860 KB Output is correct
23 Correct 77 ms 137924 KB Output is correct
24 Correct 83 ms 138180 KB Output is correct
25 Correct 85 ms 138108 KB Output is correct
26 Correct 78 ms 137960 KB Output is correct
27 Correct 77 ms 137924 KB Output is correct
28 Correct 80 ms 138636 KB Output is correct
29 Correct 90 ms 140428 KB Output is correct
30 Correct 81 ms 138436 KB Output is correct
31 Correct 83 ms 139164 KB Output is correct
32 Correct 82 ms 138660 KB Output is correct
33 Correct 98 ms 143300 KB Output is correct
34 Correct 95 ms 143232 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 137540 KB Output is correct
2 Correct 77 ms 137540 KB Output is correct
3 Correct 74 ms 137564 KB Output is correct
4 Correct 85 ms 137576 KB Output is correct
5 Correct 77 ms 137540 KB Output is correct
6 Correct 78 ms 137624 KB Output is correct
7 Correct 83 ms 137544 KB Output is correct
8 Correct 81 ms 137540 KB Output is correct
9 Correct 75 ms 137588 KB Output is correct
10 Correct 77 ms 137728 KB Output is correct
11 Correct 76 ms 137864 KB Output is correct
12 Correct 77 ms 137668 KB Output is correct
13 Correct 77 ms 137648 KB Output is correct
14 Correct 81 ms 137924 KB Output is correct
15 Correct 77 ms 137988 KB Output is correct
16 Correct 77 ms 137756 KB Output is correct
17 Correct 78 ms 138336 KB Output is correct
18 Correct 78 ms 137904 KB Output is correct
19 Correct 79 ms 137924 KB Output is correct
20 Correct 77 ms 137768 KB Output is correct
21 Correct 79 ms 137680 KB Output is correct
22 Correct 79 ms 137796 KB Output is correct
23 Correct 78 ms 137940 KB Output is correct
24 Correct 79 ms 138180 KB Output is correct
25 Correct 89 ms 137924 KB Output is correct
26 Correct 76 ms 137960 KB Output is correct
27 Correct 75 ms 137924 KB Output is correct
28 Correct 78 ms 138732 KB Output is correct
29 Correct 91 ms 140496 KB Output is correct
30 Correct 82 ms 138408 KB Output is correct
31 Correct 84 ms 139096 KB Output is correct
32 Correct 80 ms 138752 KB Output is correct
33 Correct 98 ms 143308 KB Output is correct
34 Correct 94 ms 143428 KB Output is correct
35 Correct 101 ms 142308 KB Output is correct
36 Correct 79 ms 138468 KB Output is correct
37 Correct 105 ms 145556 KB Output is correct
38 Correct 107 ms 144868 KB Output is correct
39 Correct 104 ms 145020 KB Output is correct
40 Correct 105 ms 144964 KB Output is correct
41 Correct 118 ms 144816 KB Output is correct
42 Correct 94 ms 138064 KB Output is correct
43 Correct 83 ms 138052 KB Output is correct
44 Correct 83 ms 137860 KB Output is correct
45 Correct 227 ms 160272 KB Output is correct
46 Correct 199 ms 160196 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 137644 KB Output is correct
2 Correct 74 ms 137540 KB Output is correct
3 Correct 80 ms 137560 KB Output is correct
4 Correct 75 ms 137540 KB Output is correct
5 Correct 87 ms 137644 KB Output is correct
6 Correct 76 ms 137540 KB Output is correct
7 Correct 80 ms 137632 KB Output is correct
8 Correct 83 ms 137612 KB Output is correct
9 Correct 78 ms 137692 KB Output is correct
10 Correct 77 ms 137640 KB Output is correct
11 Correct 77 ms 137796 KB Output is correct
12 Correct 77 ms 137624 KB Output is correct
13 Correct 83 ms 137696 KB Output is correct
14 Correct 79 ms 137924 KB Output is correct
15 Correct 76 ms 137924 KB Output is correct
16 Correct 78 ms 137732 KB Output is correct
17 Correct 79 ms 138308 KB Output is correct
18 Correct 80 ms 137896 KB Output is correct
19 Correct 79 ms 137844 KB Output is correct
20 Correct 81 ms 137852 KB Output is correct
21 Correct 77 ms 137668 KB Output is correct
22 Correct 76 ms 137812 KB Output is correct
23 Correct 78 ms 137928 KB Output is correct
24 Correct 79 ms 138180 KB Output is correct
25 Correct 77 ms 137904 KB Output is correct
26 Correct 78 ms 137988 KB Output is correct
27 Correct 83 ms 137876 KB Output is correct
28 Correct 83 ms 138660 KB Output is correct
29 Correct 90 ms 140500 KB Output is correct
30 Correct 80 ms 138436 KB Output is correct
31 Correct 89 ms 139228 KB Output is correct
32 Correct 81 ms 138712 KB Output is correct
33 Correct 99 ms 143272 KB Output is correct
34 Correct 99 ms 143316 KB Output is correct
35 Correct 98 ms 142260 KB Output is correct
36 Correct 82 ms 138436 KB Output is correct
37 Correct 127 ms 145560 KB Output is correct
38 Correct 109 ms 144856 KB Output is correct
39 Correct 108 ms 144876 KB Output is correct
40 Correct 110 ms 144904 KB Output is correct
41 Correct 106 ms 144848 KB Output is correct
42 Correct 87 ms 138060 KB Output is correct
43 Correct 84 ms 137968 KB Output is correct
44 Correct 82 ms 137924 KB Output is correct
45 Correct 235 ms 160212 KB Output is correct
46 Correct 206 ms 160192 KB Output is correct
47 Correct 190 ms 172148 KB Output is correct
48 Correct 122 ms 148440 KB Output is correct
49 Correct 123 ms 144340 KB Output is correct
50 Correct 102 ms 144320 KB Output is correct
51 Correct 136 ms 152388 KB Output is correct
52 Correct 145 ms 153668 KB Output is correct
53 Correct 101 ms 141920 KB Output is correct
54 Correct 81 ms 138948 KB Output is correct
55 Correct 83 ms 140240 KB Output is correct
56 Correct 89 ms 140108 KB Output is correct
57 Correct 134 ms 158020 KB Output is correct
58 Correct 92 ms 140876 KB Output is correct
59 Correct 104 ms 142248 KB Output is correct
60 Correct 101 ms 144136 KB Output is correct
61 Correct 98 ms 142776 KB Output is correct
62 Correct 169 ms 160924 KB Output is correct
63 Correct 765 ms 244164 KB Output is correct
64 Runtime error 403 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -