oj.uz

Submission #523212

# Submission time Handle Problem Language Result Execution time Memory
523212 2022-02-07T08:04:13 Z mansur Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 3660 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0) 

const int inf = 1e9, N = 5e3 + 1, mod = 998244353;                    

double eps = 1e-6;

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("F.in", "r", stdin);                                                                                     
	//freopen("F.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                       
	cin.tie(NULL);
	int n, m;
	cin >> n >> m;
	int b[m + 1], p[m + 1];
	vector<int> h[n + 1];
	for (int i = 1; i <= m; i++) {
		cin >> b[i] >> p[i];
		h[b[i]].pb(p[i]);
	}    	
	set<pii> s;
	vector<int> d(n + 1, inf);
	s.insert({0, b[1]});
	d[b[1]] = 0;
	while (!s.empty()) {
		int u = (*s.begin()).ss;
		s.erase(s.begin());
		for (auto e: h[u]) {
			for (int j = u; j <= n; j += e) {	
				if (d[j] > d[u] + (j - u) / e) {
					s.erase({d[j], j});
					d[j] = d[u] + (j - u) / e;
					s.insert({d[j], j});
				}
			}
			for (int j = u - e; j >= 0; j -= e) {
				if (d[j] > d[u] + (u - j) / e) {
					s.erase({d[j], j});
					d[j] = d[u] + (u - j) / e;
					s.insert({d[j], j});
				}
			}
		} 		
	}
	if (d[b[2]] == inf) d[b[2]] = -1;
	cout << d[b[2]];
}

Compilation message

skyscraper.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
skyscraper.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 25 ms 460 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 23 ms 332 KB Output is correct
27 Correct 22 ms 440 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 4 ms 460 KB Output is correct
34 Correct 4 ms 460 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 30 ms 460 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 23 ms 440 KB Output is correct
27 Correct 23 ms 440 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 4 ms 460 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 5 ms 460 KB Output is correct
34 Correct 5 ms 460 KB Output is correct
35 Correct 7 ms 716 KB Output is correct
36 Correct 2 ms 460 KB Output is correct
37 Correct 9 ms 716 KB Output is correct
38 Correct 8 ms 820 KB Output is correct
39 Correct 11 ms 840 KB Output is correct
40 Correct 9 ms 792 KB Output is correct
41 Correct 9 ms 844 KB Output is correct
42 Correct 379 ms 824 KB Output is correct
43 Correct 379 ms 820 KB Output is correct
44 Correct 387 ms 844 KB Output is correct
45 Correct 10 ms 844 KB Output is correct
46 Correct 10 ms 844 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 27 ms 460 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 404 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 25 ms 332 KB Output is correct
27 Correct 22 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 5 ms 460 KB Output is correct
34 Correct 5 ms 480 KB Output is correct
35 Correct 7 ms 716 KB Output is correct
36 Correct 2 ms 460 KB Output is correct
37 Correct 7 ms 716 KB Output is correct
38 Correct 8 ms 896 KB Output is correct
39 Correct 9 ms 896 KB Output is correct
40 Correct 10 ms 844 KB Output is correct
41 Correct 10 ms 844 KB Output is correct
42 Correct 375 ms 820 KB Output is correct
43 Correct 371 ms 716 KB Output is correct
44 Correct 375 ms 848 KB Output is correct
45 Correct 9 ms 844 KB Output is correct
46 Correct 10 ms 876 KB Output is correct
47 Correct 28 ms 1752 KB Output is correct
48 Correct 5 ms 1572 KB Output is correct
49 Correct 5 ms 1612 KB Output is correct
50 Correct 4 ms 1484 KB Output is correct
51 Correct 45 ms 3360 KB Output is correct
52 Correct 43 ms 3020 KB Output is correct
53 Correct 18 ms 3148 KB Output is correct
54 Correct 5 ms 1740 KB Output is correct
55 Correct 5 ms 1740 KB Output is correct
56 Execution timed out 1090 ms 3660 KB Time limit exceeded
57 Halted 0 ms 0 KB -