CodeForces - 357C. Knight Tournament

最新推荐文章于 2019-08-13 16:17:24 发布

yjt9299

最新推荐文章于 2019-08-13 16:17:24 发布

阅读量317

点赞数

分类专栏：并查集文章标签：并查集

本文链接：https://blog.csdn.net/yjt9299/article/details/76039308

版权

并查集专栏收录该内容

11 篇文章 0 订阅

订阅专栏

点击打开链接

#include<stdio.h>
#include<string.h>

int f[300005],n;

int main()
{
	int l,r,x,m,i;
	scanf("%d %d",&n,&m);
	for(i=1;i<=n;i++) f[i]=i;
	while(m--)
	{
		scanf("%d %d %d",&l,&r,&x);
		for(i=l;i<=r;i++)
		{
			if(f[i]==i) f[i]=x;
	    }
	}
	for(i=1;i<=n;i++) if(f[i]==i) f[i]=0;
	for(i=1;i<n;i++) printf("%d ",f[i]);
	printf("%d\n",f[i]);
	return 0;
}

Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.

As for you, you're just a simple peasant. There's no surprise that you slept in this morning and were late for the tournament (it was a weekend, after all). Now you are really curious about the results of the tournament. This time the tournament in Berland went as follows:

There are n knights participating in the tournament. Each knight was assigned his unique number — an integer from 1 to n.
The tournament consisted of m fights, in the i-th fight the knights that were still in the game with numbers at least li and at most ri have fought for the right to continue taking part in the tournament.
After the i-th fight among all participants of the fight only one knight won — the knight number xi, he continued participating in the tournament. Other knights left the tournament.
The winner of the last (the m-th) fight (the knight number xm) became the winner of the tournament.

You fished out all the information about the fights from your friends. Now for each knight you want to know the name of the knight he was conquered by. We think that the knight number b was conquered by the knight number a, if there was a fight with both of these knights present and the winner was the knight number a.

Write the code that calculates for each knight, the name of the knight that beat him.

Input

The first line contains two integers n, m (2 ≤ n ≤ 3·105; 1 ≤ m ≤ 3·105) — the number of knights and the number of fights. Each of the following m lines contains three integers li, ri, xi (1 ≤ li < ri ≤ n; li ≤ xi ≤ ri) — the description of the i-th fight.

It is guaranteed that the input is correct and matches the problem statement. It is guaranteed that at least two knights took part in each battle.

Output

Print n integers. If the i-th knight lost, then the i-th number should equal the number of the knight that beat the knight number i. If the i-th knight is the winner, then the i-th number must equal 0.

   Examples 
 

     input 
   
4 3
1 2 1
1 3 3
1 4 4

     output 
   
3 1 4 0 

     input 
   
8 4
3 5 4
3 7 6
2 8 8
1 8 1

     output 
   
0 8 4 6 4 8 6 1 

Note

Consider the first test case. Knights 1 and 2 fought the first fight and knight 1 won. Knights 1 and 3 fought the second fight and knight 3 won. The last fight was between knights 3 and 4, knight 4 won.

题意：一共有n个骑士 m场比赛给出区间l和r l和r 之间的每一个人都被x打败了但是他自己不能打败他自己被打败了就要离开。

最后输出这个人被谁打败了。。。最后胜出的人没有被打败，所以他输出0

很容易就可以看出样例一 2先被1打败 2离开然后1被3打败 1离开然后3被4打败最后只留下4 所以4最后输出为0

通过分析的过程就可以知道可以用STL中的vector 但是我这个菜蛋不会用所以就假设了一个数组next[] 注意next【i】数组存的是

i下边第一个没有被打败的人。这样就可以做到了优化。就可以避免了区间重复而带来的复杂度升高。

下边贴代码

#include<stdio.h>
#include<string.h>
#define N 300005

int f[N],next[N],n;

int main()
{
	int i,l,r,x,m,t;
	scanf("%d %d",&n,&m);
	for(i=1;i<=n;i++)
	{
		f[i]=0;
		next[i]=i+1;
	}
	for(int j=1;j<=m;j++)
	{
	  scanf("%d %d %d",&l,&r,&x);
	  for(i=l;i<=r;i=t)
            {
                if(f[i]==0&&i!=x) f[i]=x;
                t=next[i];
                if(i<x)
                {
                    next[i]=next[x-1];
                }
                else
                {
                    next[i]=next[r];
                }
            }
	}
	for(i=1;i<n;i++) printf("%d ",f[i]);
	printf("%d\n",f[i]);
	return 0;
}

我就想问问有木有傻家伙跟我写下边的代码

复杂啥高沙高的