Distinct Values

最新推荐文章于 2023-01-30 16:35:19 发布

尒轩窗

最新推荐文章于 2023-01-30 16:35:19 发布

阅读量580

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/lml11111/article/details/81174894

版权

贪心专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Problem Description

Chiaki has an array of n positive integers. You are told some facts about the array: for every two elements ai and aj in the subarray al..r (l≤i<j≤r ), ai≠aj holds.
Chiaki would like to find a lexicographically minimal array which meets the facts.

Input

There are multiple test cases. The first line of input contains an integer T , indicating the number of test cases. For each test case:

The first line contains two integers n and m (1≤n,m≤105 ) -- the length of the array and the number of facts. Each of the next m lines contains two integers li and ri (1≤li≤ri≤n ).

It is guaranteed that neither the sum of all n nor the sum of all m exceeds 106 .

Output

For each test case, output n integers denoting the lexicographically minimal array. Integers should be separated by a single space, and no extra spaces are allowed at the end of lines.

Sample Input

3 2 1 1 2 4 2 1 2 3 4 5 2 1 3 2 4

Sample Output

1 2 1 2 1 2 1 2 3 1 1

题意：

在同一个区间不能有相同的数，满足所有区间条件的最小的一组是

分析：

用优先队列实现贪心，队列了有元素就用，没有就增大范围，左边的边界只要小于区间左端点就弹回优先队列

代码：

#include<bits/stdc++.h>
using namespace std;
int a[100005];
struct node
{
    int date;
    bool operator<(const node &aa)const
    {
        return date>aa.date;
    }
};
priority_queue<node>q;
struct line
{
    int u,to;
    bool operator<(const line &aa)
    {
        if(u!=aa.u)
        return u<aa.u;
        return to<aa.to;
    }
}v[200005];
int main()
{
    int t,i,j,str,n,m,l;
    node now;
    scanf("%d",&t);
    while(t--)
    {
        while(!q.empty())
        {
            q.pop();
        }
        scanf("%d%d",&n,&m);
        str=1;
        for(i=0;i<m;i++)
            scanf("%d%d",&v[i].u,&v[i].to);
        for(j=i,i=1;i<=n;i++,j++)
            v[j].u=v[j].to=i;
        m=j;
        sort(v,v+m);
        for(i=0,j=0,l=0;i<m&&j<n;i++)
        {
           // printf("aaaa %d %d\n",l,v[i].u);
            while(l<v[i].u-1)
            {
                now.date=a[l];
                q.push(now);
                l++;
            }
            while(j<v[i].to)
            {
                if(q.empty())
                {
                    //printf("ssss  %d %d\n",j,str);
                    a[j++]=str;
                    str++;
                }
                else
                {
                    //printf("ok  %d %d\n",j,str);
                    now=q.top();
                    a[j++]=now.date;
                    q.pop();
                }
            }

        }
        printf("%d",a[0]);
        for(i=1;i<n;i++)
        printf(" %d",a[i]);
        printf("\n");

    }
}