Intervals
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3623 Accepted Submission(s): 1329
Problem Description
You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.
Write a program that:
> reads the number of intervals, their endpoints and integers c1, ..., cn from the standard input,
> computes the minimal size of a set Z of integers which has at least ci common elements with interval [ai, bi], for each i = 1, 2, ..., n,
> writes the answer to the standard output
Write a program that:
> reads the number of intervals, their endpoints and integers c1, ..., cn from the standard input,
> computes the minimal size of a set Z of integers which has at least ci common elements with interval [ai, bi], for each i = 1, 2, ..., n,
> writes the answer to the standard output
Input
The first line of the input contains an integer n (1 <= n <= 50 000) - the number of intervals. The following n lines describe the intervals. The i+1-th line of the input contains three integers ai, bi and ci separated by single spaces and such that 0 <= ai <= bi <= 50 000 and 1 <= ci <= bi - ai + 1.
Process to the end of file.
Process to the end of file.
Output
The output contains exactly one integer equal to the minimal size of set Z sharing at least ci elements with interval [ai, bi], for each i = 1, 2, ..., n.
Sample Input
5 3 7 3 8 10 3 6 8 1 1 3 1 10 11 1
Sample Output
6
Author
1384
Recommend
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#define N 51000
#define inf 1e9
using namespace std;
int num,p[N],n;
struct node
{
int en,len,next;
}edg[N*10];
void add(int st,int en,int len)
{
edg[num].en=en;
edg[num].len=len;
edg[num].next=p[st]; //该节点的前一个位置
p[st]=num++; //该节点当前的位置
}
queue<int>que;
bool inque[N];
int dis[N];
void spfa(int st,int en)
{
for(int i=0;i<=en;i++)
{
dis[i]=-inf;
inque[i]=false;
}
que.push(st);
dis[st]=0;
inque[st]=true;
while(que.size())
{
int x=que.front();
que.pop();
inque[x]=false;
for(int i=p[x];i!=-1;i=edg[i].next)
{
int y=edg[i].en;
if(dis[x]+edg[i].len>dis[y])
{
dis[y]=dis[x]+edg[i].len;
if(!inque[y])
{
que.push(y);
inque[y]=true;
}
}
}
}
}
int main()
{
while(~scanf("%d",&n))
{
num=0;
memset(p,-1,sizeof(p));
int st=inf,en=-1;
for(int i=1;i<=n;i++)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
add(a,b+1,c);
st=min(st,a);
en=max(en,b+1);
}
for(int i=st;i<=en;i++)
{
add(i,i-1,-1);
add(i-1,i,0);
}
spfa(st,en);
printf("%d\n",dis[en]);
}
return 0;
}