oj.uz

Submission #250320

# Submission time Handle Problem Language Result Execution time Memory
250320 2020-07-17T11:49:11 Z mode149256 Pinball (JOI14_pinball) C++14
51 / 100
 1000 ms 3064 KB 
/*input
5 6
2 4 3 5
1 2 2 8
3 6 5 2
4 6 4 7
2 4 3 10

3 5
2 4 3 10
1 3 1 20
2 5 4 30
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = 1e15;
const int MX = 100101;

struct tral {
	int a, b, c, d;
};

struct node {
	int l, r;
	ll maz;
	node *left = nullptr;
	node *right = nullptr;
	node(int a, int b) : l(a), r(b), maz(INF) { }
	inline void add_left() { if (!left) left = new node(l, (l + r) / 2); }
	inline void add_right() { if (!right) right = new node((l + r) / 2 + 1, r); }

	void upd(int pos, ll val) {
		if (l == r) {
			maz = min(maz, val);
			return;
		}
		if (pos <= (l + r) / 2) {
			add_left();
			left->upd(pos, val);
		}
		else {
			add_right();
			right->upd(pos, val);
		}

		maz = min((left ? left->maz : INF), (right ? right->maz : INF));
	}

	ll get(int a, int b) {
		if (r < a and b < l) return INF;
		else if (a <= l and r <= b) return maz;
		else if (r <= (l + r) / 2) {
			return (left ? left->get(a, b) : INF);
		} else if ((l + r) / 2 + 1 <= l) {
			return (right ? right->get(a, b) : INF);
		} else {
			return min((left ? left->get(a, b) : INF), (right ? right->get(a, b) : INF));
		}
	}
};

int K;
unordered_map<int, int> kas;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int M, N;
	cin >> M >> N;
	vi pts = {1, N};
	vector<tral> sk(M);
	for (int i = 0; i < M; ++i)
	{
		int a, b, c, d; cin >> a >> b >> c >> d;
		sk[i] = {a, b, c, d};
		pts.emplace_back(a);
		pts.emplace_back(b);
		pts.emplace_back(c);
	}

	sort(pts.begin(), pts.end());
	pts.erase(unique(pts.begin(), pts.end()), pts.end());
	K = (int)pts.size();
	for (int i = 0; i < K; ++i)
	{
		kas[pts[i]] = i;
	}

	ll ats = INF;
	node Left(0, K);
	node Right(0, K);
	Left.upd(kas[1], 0);
	Right.upd(kas[N], 0);

	for (int i = 0; i < M; ++i)
	{
		ll l = Left.get(kas[sk[i].a], kas[sk[i].b]);
		ll r = Right.get(kas[sk[i].a], kas[sk[i].b]);

		ats = min(ats, l + r + sk[i].d);
		Left.upd(kas[sk[i].c], sk[i].d + l);
		Right.upd(kas[sk[i].c], sk[i].d + r);
	}

	if (ats >= INF) printf("-1\n");
	else printf("%lld\n", ats);

	// reverse(sk.begin(), sk.end());
}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 13 ms 640 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 19 ms 768 KB Output is correct
20 Correct 11 ms 512 KB Output is correct
21 Correct 9 ms 512 KB Output is correct
22 Correct 32 ms 768 KB Output is correct
23 Correct 27 ms 768 KB Output is correct
24 Correct 34 ms 768 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 13 ms 640 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 19 ms 768 KB Output is correct
20 Correct 11 ms 512 KB Output is correct
21 Correct 9 ms 512 KB Output is correct
22 Correct 32 ms 768 KB Output is correct
23 Correct 27 ms 768 KB Output is correct
24 Correct 34 ms 768 KB Output is correct
25 Execution timed out 1081 ms 3064 KB Time limit exceeded
26 Halted 0 ms 0 KB -