oj.uz

Submission #41378

# Submission time Handle Problem Language Result Execution time Memory
41378 2018-02-17T06:11:57 Z RockyB Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 34984 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 b[N], p[N];
vector < pair <int, int> > g[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];
	}
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= m; j++) {
			if (i == j) continue;
			if (abs(b[i] - b[j]) % p[i] == 0) {
				g[i].pb({j, abs(b[i] - b[j]) / p[i]});
			}
		}
	}
	set < pair <ll, int > > st;
	memset(d, 0x3f, sizeof(d));
	st.insert({0, 1});
	d[1] = 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[2] >= linf) cout << -1;
	else cout << d[2];
	ioi
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1272 KB Output is correct
2 Correct 3 ms 1380 KB Output is correct
3 Correct 2 ms 1436 KB Output is correct
4 Correct 3 ms 1436 KB Output is correct
5 Correct 2 ms 1448 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 2 ms 1528 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1548 KB Output is correct
2 Correct 2 ms 1552 KB Output is correct
3 Correct 2 ms 1592 KB Output is correct
4 Correct 2 ms 1592 KB Output is correct
5 Correct 2 ms 1592 KB Output is correct
6 Correct 3 ms 1596 KB Output is correct
7 Correct 2 ms 1600 KB Output is correct
8 Correct 2 ms 1604 KB Output is correct
9 Correct 3 ms 1612 KB Output is correct
10 Correct 4 ms 1740 KB Output is correct
11 Correct 29 ms 3952 KB Output is correct
12 Correct 85 ms 33660 KB Output is correct
13 Correct 82 ms 33948 KB Output is correct
14 Correct 28 ms 33948 KB Output is correct
15 Correct 27 ms 33948 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 33948 KB Output is correct
2 Correct 3 ms 33948 KB Output is correct
3 Correct 2 ms 33948 KB Output is correct
4 Correct 2 ms 33948 KB Output is correct
5 Correct 2 ms 33948 KB Output is correct
6 Correct 3 ms 33948 KB Output is correct
7 Correct 3 ms 33948 KB Output is correct
8 Correct 3 ms 33948 KB Output is correct
9 Correct 3 ms 33948 KB Output is correct
10 Correct 4 ms 33948 KB Output is correct
11 Correct 30 ms 33948 KB Output is correct
12 Correct 88 ms 33948 KB Output is correct
13 Correct 83 ms 34080 KB Output is correct
14 Correct 28 ms 34080 KB Output is correct
15 Correct 28 ms 34080 KB Output is correct
16 Correct 7 ms 34080 KB Output is correct
17 Correct 19 ms 34080 KB Output is correct
18 Correct 8 ms 34080 KB Output is correct
19 Correct 4 ms 34080 KB Output is correct
20 Correct 79 ms 34160 KB Output is correct
21 Correct 8 ms 34160 KB Output is correct
22 Correct 5 ms 34160 KB Output is correct
23 Correct 7 ms 34160 KB Output is correct
24 Correct 19 ms 34160 KB Output is correct
25 Correct 20 ms 34160 KB Output is correct
26 Correct 75 ms 34160 KB Output is correct
27 Correct 80 ms 34160 KB Output is correct
28 Correct 24 ms 34160 KB Output is correct
29 Correct 6 ms 34160 KB Output is correct
30 Correct 2 ms 34160 KB Output is correct
31 Correct 4 ms 34160 KB Output is correct
32 Correct 4 ms 34160 KB Output is correct
33 Correct 32 ms 34160 KB Output is correct
34 Correct 26 ms 34160 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 34160 KB Output is correct
2 Correct 3 ms 34160 KB Output is correct
3 Correct 2 ms 34160 KB Output is correct
4 Correct 2 ms 34160 KB Output is correct
5 Correct 2 ms 34160 KB Output is correct
6 Correct 2 ms 34160 KB Output is correct
7 Correct 2 ms 34160 KB Output is correct
8 Correct 2 ms 34160 KB Output is correct
9 Correct 3 ms 34160 KB Output is correct
10 Correct 4 ms 34160 KB Output is correct
11 Correct 31 ms 34160 KB Output is correct
12 Correct 83 ms 34160 KB Output is correct
13 Correct 83 ms 34392 KB Output is correct
14 Correct 26 ms 34392 KB Output is correct
15 Correct 26 ms 34392 KB Output is correct
16 Correct 8 ms 34392 KB Output is correct
17 Correct 19 ms 34392 KB Output is correct
18 Correct 7 ms 34392 KB Output is correct
19 Correct 4 ms 34392 KB Output is correct
20 Correct 79 ms 34476 KB Output is correct
21 Correct 8 ms 34476 KB Output is correct
22 Correct 5 ms 34476 KB Output is correct
23 Correct 8 ms 34476 KB Output is correct
24 Correct 19 ms 34476 KB Output is correct
25 Correct 21 ms 34476 KB Output is correct
26 Correct 73 ms 34476 KB Output is correct
27 Correct 75 ms 34476 KB Output is correct
28 Correct 20 ms 34476 KB Output is correct
29 Correct 6 ms 34476 KB Output is correct
30 Correct 3 ms 34476 KB Output is correct
31 Correct 4 ms 34476 KB Output is correct
32 Correct 4 ms 34476 KB Output is correct
33 Correct 29 ms 34476 KB Output is correct
34 Correct 27 ms 34476 KB Output is correct
35 Execution timed out 1077 ms 34476 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 34476 KB Output is correct
2 Correct 2 ms 34476 KB Output is correct
3 Correct 2 ms 34476 KB Output is correct
4 Correct 2 ms 34476 KB Output is correct
5 Correct 2 ms 34476 KB Output is correct
6 Correct 2 ms 34476 KB Output is correct
7 Correct 2 ms 34476 KB Output is correct
8 Correct 2 ms 34476 KB Output is correct
9 Correct 3 ms 34476 KB Output is correct
10 Correct 4 ms 34476 KB Output is correct
11 Correct 33 ms 34476 KB Output is correct
12 Correct 83 ms 34664 KB Output is correct
13 Correct 83 ms 34932 KB Output is correct
14 Correct 26 ms 34932 KB Output is correct
15 Correct 28 ms 34932 KB Output is correct
16 Correct 8 ms 34932 KB Output is correct
17 Correct 19 ms 34932 KB Output is correct
18 Correct 9 ms 34932 KB Output is correct
19 Correct 4 ms 34932 KB Output is correct
20 Correct 82 ms 34984 KB Output is correct
21 Correct 9 ms 34984 KB Output is correct
22 Correct 5 ms 34984 KB Output is correct
23 Correct 7 ms 34984 KB Output is correct
24 Correct 20 ms 34984 KB Output is correct
25 Correct 22 ms 34984 KB Output is correct
26 Correct 83 ms 34984 KB Output is correct
27 Correct 78 ms 34984 KB Output is correct
28 Correct 20 ms 34984 KB Output is correct
29 Correct 6 ms 34984 KB Output is correct
30 Correct 3 ms 34984 KB Output is correct
31 Correct 6 ms 34984 KB Output is correct
32 Correct 4 ms 34984 KB Output is correct
33 Correct 27 ms 34984 KB Output is correct
34 Correct 26 ms 34984 KB Output is correct
35 Execution timed out 1073 ms 34984 KB Time limit exceeded
36 Halted 0 ms 0 KB -