oj.uz

Submission #79749

# Submission time Handle Problem Language Result Execution time Memory
79749 2018-10-16T05:04:22 Z qkxwsm Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 59872 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];
map<int, int> dist[MAXN];
vector<int> vals[MAXN];
deque<pair<int, pii> > q;
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.PB({0, arr[0]});
	while(!q.empty())
	{
		int d = q.front().fi, x = q.front().se.fi, m = q.front().se.se;
		if (x == arr[1].fi)
		{
			cout << d << '\n';
			return 0;
		}
		q.pop_front();
		if (d != getdist(x, m))
		{
			continue;
		}
		if (x - m >= 0 && getdist(x - m, m) > d + 1)
		{
			dist[x - m][m] = d + 1;
			q.PB({d + 1, {x - m, m}});
		}
		if (x + m < N && getdist(x + m, m) > d + 1)
		{
			dist[x + m][m] = d + 1;
			q.PB({d + 1, {x + m, m}});
		}
		for (int v : vals[x])
		{
			if (getdist(x, v) > d)
			{
				dist[x][v] = d;
				q.PF({d, {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 4 ms 2424 KB Output is correct
2 Correct 4 ms 2548 KB Output is correct
3 Correct 4 ms 2548 KB Output is correct
4 Correct 4 ms 2640 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 43.0

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