제출 #781836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
781836		Charizard2021	Pinball (JOI14_pinball)	C++17	0 / 100	12 ms	31572 KiB

pinball

#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
    a = max(a, b);
}
void selfMin(long long& a, long long b){
    a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}

template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};

/*

Use DSU dsu(N);

*/
struct DSU {
	vector<long long> e;
	DSU(long long N) { e = vector<long long>(N, -1); }

	// get representive component (uses path compression)
	long long get(long long x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

	bool same_set(long long a, long long b) { return get(a) == get(b); }

	long long size(long long x) { return -e[get(x)]; }

	bool unite(long long x, long long y) {  // union by size
		x = get(x), y = get(y);
		if (x == y) return false;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y]; e[y] = x;
		return true;
	}
};
/*

Run with Bit<long long> BIT

*/
template <class T> class BIT {
    private:
        long long size;
        vector<T> bit;
        vector<T> arr;
    public:
        BIT(long long size) : size(size), bit(size + 1), arr(size) {}
        void set(long long ind, long long val) { add(ind, val - arr[ind]); }
        void add(long long ind, long long val) {
            arr[ind] += val;
            ind++;
            for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
        }
        T pref_sum(long long ind) {
            ind++;
            T total = 0;
            for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
            return total;
        }
};
/*

Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;

*/
template<class T> struct Seg {
	const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
	long long n; vector<T> seg;
	void init(long long _n) { n = _n; seg.assign(2*n,ID); }
	void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(long long p, T val) {
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(long long l, long long r) {
		T ra = ID, rb = ID;
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};
const int N = 500001;
int main() {
    long long m, n;
	cin >> m >> n;
    vector<long long> total;
	total.push_back(1);
	total.push_back(n);
    long long a[m];
    long long b[m];
    long long c[m];
    long long d[m];
	for (int i = 0; i < m; i++) {
		cin >> a[i] >> b[i] >> c[i] >> d[i];
		total.push_back(a[i]);
        total.push_back(b[i]);
        total.push_back(c[i]);
        total.push_back(min(n, b[i] + 1));
        total.push_back(max(1ll, a[i] - 1));
	}
	sort(total.begin(), total.end());
	total.resize(unique(total.begin(), total.end()) - total.begin());
	for (int i = 0; i < m; i++) {
		a[i] = lower_bound(total.begin(), total.end(), a[i]) - total.begin();
		b[i] = lower_bound(total.begin(), total.end(), b[i]) - total.begin();
		c[i] = lower_bound(total.begin(), total.end(), c[i]) - total.begin();
	}
    Seg<long long> SegTree;
    SegTree.init(2 * N);
    Seg<long long> SegTree2;
    SegTree2.init(2 * N);
    long long ans = 1e18;
    SegTree.upd(0, 0);
    SegTree.upd((int)total.size() - 1, 0);
	for (int i = 0; i < m; i++) {
		ans = min(ans, SegTree.query(a[i], b[i] + 1) + SegTree2.query(a[i], b[i] + 1) + d[i]);
		SegTree.upd(c[i], SegTree.query(a[i], c[i] + 1) + d[i]);
		SegTree2.upd(c[i], SegTree2.query(c[i], b[i] + 1) + d[i]);
	}
    if(ans == 1e18){
        cout << -1 << "\n";
    }
    else{
        cout << ans << "\n";
    }
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 49