oj.uz

Submission #523143

# Submission time Handle Problem Language Result Execution time Memory
523143 2022-02-07T06:24:57 Z mansur Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 65644 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)
#define int long long
 
const int inf = 1e15, 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]);
	}    	
	vector<pii> adj[n + 1];
	for (int i = 0; i <= n; i++) {
		sort(rall(h[i]));
		for (int j = 0; j <= n; j++) {
			if (i == j) continue;
			int d = abs(j - i);
			for (auto e: h[i]) {
				if (d % e == 0) {
					adj[i].pb({j, d / e});
					break;
				}
			}
		}
	}
	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: adj[u]) {
			if (d[e.ff] > d[u] + e.ss) {
				s.erase({d[e.ff], e.ff});
				d[e.ff] = d[u] + e.ss;
				s.insert({d[e.ff], e.ff});
			}
		} 		
	}
	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:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main() {
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 2 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 204 KB Output is correct
7 Correct 1 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 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 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 8 ms 868 KB Output is correct
18 Correct 11 ms 504 KB Output is correct
19 Correct 13 ms 456 KB Output is correct
20 Correct 83 ms 64676 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 9 ms 456 KB Output is correct
23 Correct 10 ms 512 KB Output is correct
24 Correct 20 ms 716 KB Output is correct
25 Correct 22 ms 676 KB Output is correct
26 Correct 7 ms 652 KB Output is correct
27 Correct 8 ms 588 KB Output is correct
28 Correct 21 ms 988 KB Output is correct
29 Correct 13 ms 1068 KB Output is correct
30 Correct 8 ms 844 KB Output is correct
31 Correct 14 ms 1164 KB Output is correct
32 Correct 16 ms 948 KB Output is correct
33 Correct 26 ms 1552 KB Output is correct
34 Correct 23 ms 1476 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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 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 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 396 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 9 ms 772 KB Output is correct
18 Correct 10 ms 460 KB Output is correct
19 Correct 9 ms 460 KB Output is correct
20 Correct 80 ms 64756 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 9 ms 460 KB Output is correct
23 Correct 13 ms 588 KB Output is correct
24 Correct 21 ms 808 KB Output is correct
25 Correct 22 ms 716 KB Output is correct
26 Correct 9 ms 624 KB Output is correct
27 Correct 10 ms 632 KB Output is correct
28 Correct 21 ms 860 KB Output is correct
29 Correct 13 ms 1100 KB Output is correct
30 Correct 8 ms 844 KB Output is correct
31 Correct 11 ms 1112 KB Output is correct
32 Correct 12 ms 876 KB Output is correct
33 Correct 23 ms 1484 KB Output is correct
34 Correct 23 ms 1508 KB Output is correct
35 Correct 187 ms 3896 KB Output is correct
36 Correct 27 ms 836 KB Output is correct
37 Correct 195 ms 6800 KB Output is correct
38 Correct 306 ms 5964 KB Output is correct
39 Correct 304 ms 6360 KB Output is correct
40 Correct 299 ms 6084 KB Output is correct
41 Correct 305 ms 5808 KB Output is correct
42 Correct 12 ms 1520 KB Output is correct
43 Correct 12 ms 1412 KB Output is correct
44 Correct 83 ms 65644 KB Output is correct
45 Correct 218 ms 5688 KB Output is correct
46 Correct 224 ms 5676 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 1 ms 204 KB Output is correct
6 Correct 1 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 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 8 ms 792 KB Output is correct
18 Correct 11 ms 480 KB Output is correct
19 Correct 9 ms 460 KB Output is correct
20 Correct 78 ms 64664 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 9 ms 460 KB Output is correct
23 Correct 12 ms 588 KB Output is correct
24 Correct 23 ms 768 KB Output is correct
25 Correct 23 ms 668 KB Output is correct
26 Correct 7 ms 716 KB Output is correct
27 Correct 9 ms 588 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 14 ms 1228 KB Output is correct
30 Correct 8 ms 844 KB Output is correct
31 Correct 14 ms 1120 KB Output is correct
32 Correct 11 ms 972 KB Output is correct
33 Correct 25 ms 1488 KB Output is correct
34 Correct 25 ms 1484 KB Output is correct
35 Correct 204 ms 3932 KB Output is correct
36 Correct 29 ms 948 KB Output is correct
37 Correct 189 ms 6716 KB Output is correct
38 Correct 318 ms 5940 KB Output is correct
39 Correct 299 ms 6408 KB Output is correct
40 Correct 313 ms 6132 KB Output is correct
41 Correct 294 ms 5948 KB Output is correct
42 Correct 11 ms 1576 KB Output is correct
43 Correct 12 ms 1484 KB Output is correct
44 Correct 86 ms 65564 KB Output is correct
45 Correct 216 ms 5580 KB Output is correct
46 Correct 223 ms 5572 KB Output is correct
47 Execution timed out 1068 ms 15880 KB Time limit exceeded
48 Halted 0 ms 0 KB -