Codeforces 822C Hacker, pack your bags!【排序+二分】

最新推荐文章于 2018-07-26 11:48:40 发布

mengxiang000000

最新推荐文章于 2018-07-26 11:48:40 发布

阅读量2.1k

点赞数

分类专栏：思维二分查找文章标签： Codeforces 822C

本文链接：https://blog.csdn.net/mengxiang000000/article/details/74407180

版权

思维同时被 2 个专栏收录

692 篇文章 0 订阅

订阅专栏

二分查找

142 篇文章 0 订阅

订阅专栏

It's well known that the best way to distract from something is to do one's favourite thing. Job is such a thing for Leha.

So the hacker began to work hard in order to get rid of boredom. It means that Leha began to hack computers all over the world. For such zeal boss gave the hacker a vacation of exactly x days. You know the majority of people prefer to go somewhere for a vacation, so Leha immediately went to the travel agency. There he found out that n vouchers left. i-th voucher is characterized by three integers l_i, r_i, cost_i — day of departure from Vičkopolis, day of arriving back in Vičkopolis and cost of the voucher correspondingly. The duration of the i-th voucher is a value r_i - l_i + 1.

At the same time Leha wants to split his own vocation into two parts. Besides he wants to spend as little money as possible. Formally Leha wants to choose exactly two vouchers i and j (i ≠ j) so that they don't intersect, sum of their durations is exactly x and their total cost is as minimal as possible. Two vouchers i and j don't intersect if only at least one of the following conditions is fulfilled: r_i < l_j or r_j < l_i.

Help Leha to choose the necessary vouchers!

Input

The first line contains two integers n and x (2 ≤ n, x ≤ 2·10⁵) — the number of vouchers in the travel agency and the duration of Leha's vacation correspondingly.

Each of the next n lines contains three integers l_i, r_i and cost_i (1 ≤ l_i ≤ r_i ≤ 2·10⁵, 1 ≤ cost_i ≤ 10⁹) — description of the voucher.

Output

Print a single integer — a minimal amount of money that Leha will spend, or print - 1 if it's impossible to choose two disjoint vouchers with the total duration exactly x.

Examples

Input

Output

Input

Output

-1

Note

In the first sample Leha should choose first and third vouchers. Hereupon the total duration will be equal to (3 - 1 + 1) + (6 - 5 + 1) = 5 and the total cost will be 4 + 1 = 5.

In the second sample the duration of each voucher is 3 therefore it's impossible to choose two vouchers with the total duration equal to 2.

题目大意：

现在一共有N个旅游表，时间是从Li到Ri花费为Ci.

现在主人公想要选取两个旅游项目，使得总共的旅游天数恰好为x天，并且希望花费最小。

两个旅游项目不能重叠。

思路：

我们用vector<node >a[i]存入旅游天数为i天的所有旅游信息。

那么对于每个a【i】对其进行时间排序，以开始时间从小到大排序。

然后我们枚举出来任意一个旅游项目，假设此旅游项目为k天，那么对应我们在x-k天中的数组中二分一个位子，使得这个位子之后的所有旅游项目都可以进行选择（不重叠了）

那么在这里我们维护一个后缀最小值即可。

过程模拟一下，不难。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
struct node
{
    int x,y,w;
}a[350000];
int ans[350000];
vector<node>mp[350000];
vector<int>minn[350000];
int cmp(node a,node b)
{
    return a.x<b.x;
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=200000;i++)mp[i].clear(),minn[i].clear();
        for(int i=0;i<n;i++)scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w);
        sort(a,a+n,cmp);
        for(int i=0;i<n;i++)
        {
            mp[a[i].y-a[i].x+1].push_back(a[i]);
        }
        for(int i=1;i<=200000;i++)
        {
            for(int j=mp[i].size()-1;j>=0;j--)
            {
                if(j==mp[i].size()-1)ans[j]=mp[i][j].w;
                else ans[j]=min(mp[i][j].w,ans[j+1]);
            }
            for(int j=0;j<mp[i].size();j++)
            {
                minn[i].push_back(ans[j]);
            }
        }
        int output=2e9+7;
        for(int i=1;i<=200000;i++)
        {
            if(m-i<0)break;
            for(int j=0;j<mp[i].size();j++)
            {
                int pos=-1;
                int l=0;
                int r=mp[m-i].size()-1;
                while(r-l>=0)
                {
                    int mid=(l+r)/2;
                    if(mp[m-i][mid].x>mp[i][j].y)
                    {
                        pos=mid;
                        r=mid-1;
                    }
                    else l=mid+1;
                }
                if(pos==-1)continue;
                else output=min(output,mp[i][j].w+minn[m-i][pos]);
            }
        }
        if(output==2e9+7)printf("-1\n");
        else printf("%d\n",output);
    }
}