oj.uz

Submission #41411

# Submission time Handle Problem Language Result Execution time Memory
41411 2018-02-17T07:41:15 Z RockyB Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 22 ms 5276 KB 
/// In The Name Of God
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)3e4 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
 
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int n, m;
int sta, fn;
int b[N], p[N];
vector < pair <int, int> > g[N];
vector <int> a[N], dv[N];

ll d[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> b[i] >> p[i];
		a[b[i]].pb(p[i]);
		if (i == 1) sta = b[i];
		if (i == 2) fn = b[i];
	}
	for (int i = 1; i <= n; i++) {
		if (sz(a[i])) sort(all(a[i]));
	}

	for (int i = 30000; i >= 1; i--) {
		for (int j = i; j <= 30000; j += i) {
			dv[j].pb(i);
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i == j) continue;
			int df = abs(i - j);
			for (auto it : dv[df]) {
				if (binary_search(all(a[i]), it)) {
					g[i].pb({j, df / it});
					break;
				}
			}
		}
	}
	
	set < pair <ll, int > > st;
	memset(d, 0x3f, sizeof(d));
	st.insert({0, sta});
	d[sta] = 0;
	while (sz(st)) {
		pair <ll, int> v = *st.begin();
		st.erase(st.begin());
		for (auto to : g[v.s]) {
			if (d[to.f] > v.f + to.s) {
				st.erase({d[to.f], to.f});
				d[to.f] = v.f + to.s;
				st.insert({d[to.f], to.f});
			}
		}
	}
	if (d[fn] >= linf) cout << -1;
	else cout << d[fn];
	ioi
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4856 KB Output is correct
2 Correct 18 ms 4960 KB Output is correct
3 Correct 18 ms 5032 KB Output is correct
4 Correct 18 ms 5232 KB Output is correct
5 Correct 18 ms 5232 KB Output is correct
6 Correct 18 ms 5232 KB Output is correct
7 Correct 19 ms 5232 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5232 KB Output is correct
2 Correct 18 ms 5232 KB Output is correct
3 Correct 18 ms 5260 KB Output is correct
4 Correct 18 ms 5260 KB Output is correct
5 Correct 18 ms 5260 KB Output is correct
6 Correct 17 ms 5260 KB Output is correct
7 Correct 18 ms 5260 KB Output is correct
8 Correct 18 ms 5260 KB Output is correct
9 Correct 18 ms 5260 KB Output is correct
10 Correct 19 ms 5260 KB Output is correct
11 Correct 19 ms 5260 KB Output is correct
12 Correct 19 ms 5260 KB Output is correct
13 Correct 18 ms 5260 KB Output is correct
14 Correct 18 ms 5260 KB Output is correct
15 Incorrect 20 ms 5260 KB Output isn't correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 5260 KB Output is correct
2 Correct 17 ms 5260 KB Output is correct
3 Correct 18 ms 5260 KB Output is correct
4 Correct 19 ms 5260 KB Output is correct
5 Correct 19 ms 5260 KB Output is correct
6 Correct 17 ms 5260 KB Output is correct
7 Correct 19 ms 5260 KB Output is correct
8 Correct 19 ms 5260 KB Output is correct
9 Correct 17 ms 5260 KB Output is correct
10 Correct 20 ms 5260 KB Output is correct
11 Correct 18 ms 5260 KB Output is correct
12 Correct 20 ms 5260 KB Output is correct
13 Correct 20 ms 5260 KB Output is correct
14 Correct 18 ms 5260 KB Output is correct
15 Incorrect 20 ms 5260 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5260 KB Output is correct
2 Correct 22 ms 5260 KB Output is correct
3 Correct 18 ms 5260 KB Output is correct
4 Correct 17 ms 5260 KB Output is correct
5 Correct 18 ms 5260 KB Output is correct
6 Correct 22 ms 5260 KB Output is correct
7 Correct 17 ms 5260 KB Output is correct
8 Correct 18 ms 5260 KB Output is correct
9 Correct 17 ms 5260 KB Output is correct
10 Correct 19 ms 5260 KB Output is correct
11 Correct 18 ms 5260 KB Output is correct
12 Correct 20 ms 5260 KB Output is correct
13 Correct 21 ms 5260 KB Output is correct
14 Correct 19 ms 5260 KB Output is correct
15 Incorrect 22 ms 5260 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5260 KB Output is correct
2 Correct 18 ms 5260 KB Output is correct
3 Correct 18 ms 5260 KB Output is correct
4 Correct 17 ms 5276 KB Output is correct
5 Correct 17 ms 5276 KB Output is correct
6 Correct 18 ms 5276 KB Output is correct
7 Correct 18 ms 5276 KB Output is correct
8 Correct 17 ms 5276 KB Output is correct
9 Correct 18 ms 5276 KB Output is correct
10 Correct 19 ms 5276 KB Output is correct
11 Correct 19 ms 5276 KB Output is correct
12 Correct 21 ms 5276 KB Output is correct
13 Correct 19 ms 5276 KB Output is correct
14 Correct 19 ms 5276 KB Output is correct
15 Incorrect 18 ms 5276 KB Output isn't correct
16 Halted 0 ms 0 KB -