oj.uz

Submission #79751

# Submission time Handle Problem Language Result Execution time Memory
79751 2018-10-16T05:19:35 Z qkxwsm Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 134444 KB 
/*
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
    unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM; x += 11400714819323198485ull;
        x = (x ^ (x >> 30)) * 13787848793156543929ull;
        x = (x ^ (x >> 27)) * 10723151780598845931ull;
        return x ^ (x >> 31);
    }
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
T nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
#define sz(x) ((int) (x.size()))

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 30013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, M;
pii arr[MAXN];
hash_table<int, int> dist[MAXN];
vector<int> vals[MAXN];
pair<int, pii> q[2 * MAGIC * MAXN];
int ql = MAGIC * MAXN, qr = MAGIC * MAXN;
int ans;

int getdist(int x, int y)
{
	if (dist[x].find(y) == dist[x].end())
	{
		return INF;
	}
	return dist[x][y];
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// freopen ("file.in", "r", stdin);
	// freopen ("file.out", "w", stdout);
	cin >> N >> M;
	for (int i = 0; i < M; i++)
	{
		//loc, mod
		cin >> arr[i].fi >> arr[i].se;
		vals[arr[i].fi].PB(arr[i].se);
	}
	for (int i = 0; i < N; i++)
	{
		sort(vals[i].begin(), vals[i].end());
		vals[i].erase(unique(vals[i].begin(), vals[i].end()), vals[i].end());
	}
	//(loc, mod)
	dist[arr[0].fi][arr[0].se] = 0;
	q[qr] = MP(0, arr[0]);
	while(ql <= qr)
	{
		int d = q[ql].fi, x = q[ql].se.fi, m = q[ql].se.se;
		ql++;
		if (x == arr[1].fi)
		{
			cout << d << '\n';
			return 0;
		}
		if (d != getdist(x, m))
		{
			continue;
		}
		if (x - m >= 0 && getdist(x - m, m) > d + 1)
		{
			dist[x - m][m] = d + 1;
			qr++;
			q[qr] = MP(d + 1, MP(x - m, m));
		}
		if (x + m < N && getdist(x + m, m) > d + 1)
		{
			dist[x + m][m] = d + 1;
			qr++;
			q[qr] = MP(d + 1, MP(x + m, m));
		}
		for (int v : vals[x])
		{
			if (getdist(x, v) > d)
			{
				dist[x][v] = d;
				ql--;
				q[ql] = MP(d, MP(x, v));
			}
		}
	}
	cout << "-1\n";
	//oh wait, there's only a total of NsqrtN ordered pairs (guy i, loc i)
	//RUN A BFS I THINK!
	//location, distance
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7416 KB Output is correct
2 Correct 10 ms 7420 KB Output is correct
3 Correct 11 ms 7592 KB Output is correct
4 Correct 10 ms 7640 KB Output is correct
5 Correct 11 ms 7720 KB Output is correct
6 Correct 10 ms 7720 KB Output is correct
7 Correct 15 ms 7720 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12540 KB Output is correct
2 Correct 12 ms 12540 KB Output is correct
3 Correct 10 ms 12540 KB Output is correct
4 Correct 10 ms 12540 KB Output is correct
5 Correct 10 ms 12540 KB Output is correct
6 Correct 11 ms 12540 KB Output is correct
7 Correct 15 ms 12540 KB Output is correct
8 Correct 10 ms 12540 KB Output is correct
9 Correct 14 ms 12540 KB Output is correct
10 Correct 12 ms 12540 KB Output is correct
11 Correct 12 ms 12540 KB Output is correct
12 Correct 16 ms 12540 KB Output is correct
13 Correct 10 ms 12540 KB Output is correct
14 Correct 13 ms 12540 KB Output is correct
15 Correct 12 ms 12540 KB Output is correct
16 Correct 10 ms 12540 KB Output is correct
17 Correct 12 ms 12540 KB Output is correct
18 Correct 10 ms 12540 KB Output is correct
19 Correct 10 ms 12540 KB Output is correct
20 Correct 11 ms 12540 KB Output is correct
21 Correct 11 ms 12540 KB Output is correct
22 Correct 10 ms 12540 KB Output is correct
23 Correct 13 ms 12540 KB Output is correct
24 Correct 12 ms 12540 KB Output is correct
25 Correct 11 ms 12540 KB Output is correct
26 Correct 11 ms 12540 KB Output is correct
27 Correct 12 ms 12540 KB Output is correct
28 Correct 16 ms 12540 KB Output is correct
29 Correct 24 ms 12540 KB Output is correct
30 Correct 15 ms 12540 KB Output is correct
31 Correct 18 ms 12540 KB Output is correct
32 Correct 14 ms 12540 KB Output is correct
33 Correct 32 ms 12540 KB Output is correct
34 Correct 23 ms 12540 KB Output is correct
35 Correct 37 ms 12540 KB Output is correct
36 Correct 12 ms 12540 KB Output is correct
37 Correct 24 ms 12540 KB Output is correct
38 Correct 30 ms 12540 KB Output is correct
39 Correct 18 ms 12540 KB Output is correct
40 Correct 20 ms 12540 KB Output is correct
41 Correct 21 ms 12540 KB Output is correct
42 Correct 19 ms 12540 KB Output is correct
43 Correct 17 ms 12540 KB Output is correct
44 Correct 17 ms 12540 KB Output is correct
45 Correct 193 ms 25852 KB Output is correct
46 Correct 154 ms 25852 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 25852 KB Output is correct
2 Correct 10 ms 25852 KB Output is correct
3 Correct 10 ms 25852 KB Output is correct
4 Correct 10 ms 25852 KB Output is correct
5 Correct 14 ms 25852 KB Output is correct
6 Correct 15 ms 25852 KB Output is correct
7 Correct 11 ms 25852 KB Output is correct
8 Correct 12 ms 25852 KB Output is correct
9 Correct 15 ms 25852 KB Output is correct
10 Correct 11 ms 25852 KB Output is correct
11 Correct 11 ms 25852 KB Output is correct
12 Correct 12 ms 25852 KB Output is correct
13 Correct 12 ms 25852 KB Output is correct
14 Correct 15 ms 25852 KB Output is correct
15 Correct 14 ms 25852 KB Output is correct
16 Correct 10 ms 25852 KB Output is correct
17 Correct 13 ms 25852 KB Output is correct
18 Correct 14 ms 25852 KB Output is correct
19 Correct 11 ms 25852 KB Output is correct
20 Correct 12 ms 25852 KB Output is correct
21 Correct 11 ms 25852 KB Output is correct
22 Correct 11 ms 25852 KB Output is correct
23 Correct 12 ms 25852 KB Output is correct
24 Correct 13 ms 25852 KB Output is correct
25 Correct 13 ms 25852 KB Output is correct
26 Correct 11 ms 25852 KB Output is correct
27 Correct 11 ms 25852 KB Output is correct
28 Correct 16 ms 25852 KB Output is correct
29 Correct 23 ms 25852 KB Output is correct
30 Correct 13 ms 25852 KB Output is correct
31 Correct 18 ms 25852 KB Output is correct
32 Correct 16 ms 25852 KB Output is correct
33 Correct 31 ms 25852 KB Output is correct
34 Correct 22 ms 25852 KB Output is correct
35 Correct 38 ms 25852 KB Output is correct
36 Correct 12 ms 25852 KB Output is correct
37 Correct 36 ms 25852 KB Output is correct
38 Correct 30 ms 25852 KB Output is correct
39 Correct 18 ms 25852 KB Output is correct
40 Correct 20 ms 25852 KB Output is correct
41 Correct 32 ms 25852 KB Output is correct
42 Correct 17 ms 25852 KB Output is correct
43 Correct 16 ms 25852 KB Output is correct
44 Correct 25 ms 25852 KB Output is correct
45 Correct 209 ms 25956 KB Output is correct
46 Correct 151 ms 25956 KB Output is correct
47 Correct 24 ms 25956 KB Output is correct
48 Correct 27 ms 25956 KB Output is correct
49 Correct 17 ms 25956 KB Output is correct
50 Correct 15 ms 25956 KB Output is correct
51 Correct 63 ms 25956 KB Output is correct
52 Correct 37 ms 25956 KB Output is correct
53 Correct 23 ms 25956 KB Output is correct
54 Correct 11 ms 25956 KB Output is correct
55 Correct 12 ms 25956 KB Output is correct
56 Correct 22 ms 25956 KB Output is correct
57 Correct 12 ms 25956 KB Output is correct
58 Correct 24 ms 25956 KB Output is correct
59 Correct 23 ms 25956 KB Output is correct
60 Correct 22 ms 25956 KB Output is correct
61 Correct 24 ms 25956 KB Output is correct
62 Correct 191 ms 28532 KB Output is correct
63 Correct 871 ms 126592 KB Output is correct
64 Execution timed out 1031 ms 134444 KB Time limit exceeded
65 Halted 0 ms 0 KB -