This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define ll long long
#define f first
#define s second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
template<typename A> void __print(const A &x) {
bool first = true;
cerr << '{';
for (const auto &i : x) {
cerr << (first ? "" : ","), __print(i);
first = false;
}
cerr << '}';
}
template<typename A, typename B> void __print(const pair<A, B> &p) {
cerr << '(';
__print(p.f);
cerr << ',';
__print(p.s);
cerr << ')';
}
template<typename... A> void __print(const tuple<A...> &t) {
bool first = true;
cerr << '(';
apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
cerr << ')';
}
template<typename T> void __print(stack<T> s) {
vector<T> debugVector;
while (!s.empty()) {
T t = s.top();
debugVector.push_back(t);
s.pop();
}
reverse(debugVector.begin(), debugVector.end());
__print(debugVector);
}
template<typename T> void __print(queue<T> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.front();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.top();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
void _print() { cerr << "]\n"; }
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
__print(H);
if (sizeof...(T)) cerr << ", ";
_print(T...);
}
#ifdef DEBUG
#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define D(...)
#endif
struct Node {
int l, r;
ll mn;
Node *lft, *rht;
Node (int tl, int tr): l(tl), r(tr), mn(1e18) {
if (l + 1 != r) {
lft = new Node(l, (l + r) / 2);
rht = new Node((l + r) / 2, r);
} else {
lft = rht = NULL;
}
}
};
void update(Node *x, int pos, ll v) {
if (pos < x->l || x->r <= pos) {
return;
}
if (x->l + 1 == x->r) {
x->mn = min(x->mn, v);
return;
}
update(x->lft, pos, v);
update(x->rht, pos, v);
x->mn = min(x->lft->mn, x->rht->mn);
}
ll query(Node *x, int l, int r) {
if (r <= x->l || x->r <= l) {
return 1e18;
}
if (l <= x->l && x->r <= r) {
return x->mn;
}
return min(query(x->lft, l, r), query(x->rht, l, r));
}
Node *rl, *rr;
int m, n, idx;
ll lc, rc, ans;
vector<tuple<int, int, int, int>> og, sm;
set<int> coords;
map<int, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> m >> n;
for (int i = 0, a, b, c, d; i < m; i++) {
cin >> a >> b >> c >> d;
og.push_back({a, b, c, d});
coords.insert(a);
coords.insert(b);
coords.insert(c);
}
coords.insert(1);
coords.insert(n);
for (int i : coords) {
mp.insert({i, idx++});
}
for (auto [a, b, c, d] : og) {
sm.push_back({mp[a], mp[b], mp[c], d});
}
rl = new Node(0, idx + 5);
rr = new Node(0, idx + 5);
ans = 1e18;
for (auto [a, b, c, d] : sm) {
lc = (a == 0 ? 0 : query(rl, a, b + 1)) + (ll) d;
rc = (b == idx - 1 ? 0 : query(rr, a, b + 1)) + (ll) d;
update(rl, c, lc);
update(rr, c, rc);
ans = min(ans, lc + rc - (ll) d);
}
cout << (ans == 1e18 ? -1 : ans) << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |