oj.uz

Submission #98301

# Submission time Handle Problem Language Result Execution time Memory
98301 2019-02-22T00:39:42 Z qkxwsm Pinball (JOI14_pinball) C++14
51 / 100
 327 ms 13560 KB 
#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>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
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>
void 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);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

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 140013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef pair<pii, pii> ppp;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M;
ppp arr[MAXN];
vi compress;
ll lt[MAXN], rt[MAXN];
ll ans = LLINF;

struct segtree
{
	ll seg[2 * MAXN];
	ll DNE = LLINF;
	ll comb(ll a, ll b)
	{
		return min(a, b);
	}
	void update(int w, int L, int R, int a, ll v)
	{
		if (a < L || R < a)
		{
			return;
		}
		if (L == R)
		{
			ckmin(seg[w], v);
			return;
		}
		int mid = (L + R) >> 1;
		update(w << 1, L, mid, a, v);
		update(w << 1 | 1, mid + 1, R, a, v);
		seg[w] = comb(seg[w << 1], seg[w << 1 | 1]);
		return;
	}
	ll query(int w, int L, int R, int a, int b)
	{
		if (b < L || R < a)
		{
			return DNE;
		}
		if (a <= L && R <= b)
		{
			return seg[w];
		}
		int mid = (L + R) >> 1;
		return comb(query(w << 1, L, mid, a, b), query(w << 1 | 1, mid + 1, R, a, b));
	}
};

segtree seg[2];

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> M;
	FOR(i, 0, N)
	{
		cin >> arr[i].fi.fi >> arr[i].fi.se >> arr[i].se.fi >> arr[i].se.se;
		compress.PB(arr[i].fi.fi);
		compress.PB(arr[i].fi.se);
		compress.PB(arr[i].se.fi);
	}
	compress.PB(1); compress.PB(M);
	sort(ALL(compress));
	compress.erase(unique(ALL(compress)), compress.end());
	FOR(i, 0, N)
	{
		arr[i].fi.fi = LB(ALL(compress), arr[i].fi.fi) - compress.begin();
		arr[i].fi.se = LB(ALL(compress), arr[i].fi.se) - compress.begin();
		arr[i].se.fi = LB(ALL(compress), arr[i].se.fi) - compress.begin();
	}
	M = SZ(compress);
	FOR(i, 0, 2)
	{
		FOR(j, 0, 2 * MAXN)
		{
			seg[i].seg[j] = LLINF;
		}
	}
	seg[0].update(1, 0, M - 1, 0, 0);
	seg[1].update(1, 0, M - 1, M - 1, 0);
	FOR(i, 0, N)
	{
		ll res0 = seg[0].query(1, 0, M - 1, arr[i].fi.fi, arr[i].fi.se), res1 = seg[1].query(1, 0, M - 1, arr[i].fi.fi, arr[i].fi.se);
		seg[0].update(1, 0, M - 1, arr[i].se.fi, res0 + arr[i].se.se);
		seg[1].update(1, 0, M - 1, arr[i].se.fi, res1 + arr[i].se.se);
		ckmin(ans, res0 + res1 + arr[i].se.se);
		// DBG(res0); DBG(res1); DBG(arr[i].se.se);
	}
	if (ans == LLINF) ans = -1;
	cout << ans << '\n';
	// FOR(i, 0, N)
	// {
	// 	cerr << arr[i].fi.fi << ' ' << arr[i].fi.se << ' ' << arr[i].se.fi << ' ' << arr[i].se.se << endl;
	// }
	//each time u do it, it's like saying, any range containing x can be expanded to y
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4736 KB Output is correct
2 Correct 6 ms 4736 KB Output is correct
3 Correct 6 ms 4708 KB Output is correct
4 Correct 5 ms 4736 KB Output is correct
5 Correct 7 ms 4736 KB Output is correct
6 Correct 7 ms 4736 KB Output is correct
7 Correct 5 ms 4736 KB Output is correct
8 Correct 6 ms 4736 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4736 KB Output is correct
2 Correct 6 ms 4736 KB Output is correct
3 Correct 6 ms 4708 KB Output is correct
4 Correct 5 ms 4736 KB Output is correct
5 Correct 7 ms 4736 KB Output is correct
6 Correct 7 ms 4736 KB Output is correct
7 Correct 5 ms 4736 KB Output is correct
8 Correct 6 ms 4736 KB Output is correct
9 Correct 7 ms 4736 KB Output is correct
10 Correct 6 ms 4736 KB Output is correct
11 Correct 6 ms 4736 KB Output is correct
12 Correct 6 ms 4708 KB Output is correct
13 Correct 6 ms 4736 KB Output is correct
14 Correct 6 ms 4736 KB Output is correct
15 Correct 6 ms 4728 KB Output is correct
16 Correct 7 ms 4736 KB Output is correct
17 Correct 8 ms 4864 KB Output is correct
18 Correct 9 ms 4836 KB Output is correct
19 Correct 7 ms 4864 KB Output is correct
20 Correct 7 ms 4864 KB Output is correct
21 Correct 6 ms 4736 KB Output is correct
22 Correct 7 ms 4864 KB Output is correct
23 Correct 6 ms 4864 KB Output is correct
24 Correct 7 ms 4864 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4736 KB Output is correct
2 Correct 6 ms 4736 KB Output is correct
3 Correct 6 ms 4708 KB Output is correct
4 Correct 5 ms 4736 KB Output is correct
5 Correct 7 ms 4736 KB Output is correct
6 Correct 7 ms 4736 KB Output is correct
7 Correct 5 ms 4736 KB Output is correct
8 Correct 6 ms 4736 KB Output is correct
9 Correct 7 ms 4736 KB Output is correct
10 Correct 6 ms 4736 KB Output is correct
11 Correct 6 ms 4736 KB Output is correct
12 Correct 6 ms 4708 KB Output is correct
13 Correct 6 ms 4736 KB Output is correct
14 Correct 6 ms 4736 KB Output is correct
15 Correct 6 ms 4728 KB Output is correct
16 Correct 7 ms 4736 KB Output is correct
17 Correct 8 ms 4864 KB Output is correct
18 Correct 9 ms 4836 KB Output is correct
19 Correct 7 ms 4864 KB Output is correct
20 Correct 7 ms 4864 KB Output is correct
21 Correct 6 ms 4736 KB Output is correct
22 Correct 7 ms 4864 KB Output is correct
23 Correct 6 ms 4864 KB Output is correct
24 Correct 7 ms 4864 KB Output is correct
25 Correct 22 ms 5504 KB Output is correct
26 Correct 68 ms 6392 KB Output is correct
27 Correct 165 ms 9324 KB Output is correct
28 Correct 166 ms 11372 KB Output is correct
29 Correct 140 ms 8172 KB Output is correct
30 Correct 208 ms 11500 KB Output is correct
31 Incorrect 327 ms 13560 KB Output isn't correct
32 Halted 0 ms 0 KB -