Codeforces Round #207 (Div. 二) C. Knight Tournament

Codeforces Round #207 (Div. 2) C. Knight Tournament
C. Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

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 l_{i and at most rihave 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 x_{i, 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·10^{5; 1?≤?m?≤?3·105) — the number of knights and the number of fights. Each of the following m lines contains three integers l_{i,?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.

  Sample test(s)input

  4 31 2 11 3 31 4 4

  output

  3 1 4 0 

  input

  8 43 5 43 7 62 8 81 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.

  
  

  感想：

  其实用set就可以过，比赛时硬要搬起石头砸自己的脚搞自己不会的线段树，哎，结果可想而知。

  思路：

  先将点全部加入，然后查找，删除就够了。

  代码：

  #include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <string>#include <map>#include <stack>#include <vector>#include <set>#include <queue>#pragma comment (linker,"/STACK:102400000,102400000")#define maxn 300005#define MAXN 300005#define mod 1000000007#define INF 0x3f3f3f3f#define pi acos(-1.0)#define eps 0.000001typedef long long ll;using namespace std;int n,m,ans,cnt;int pre[maxn];set<int>s;set<int>::iterator it,pos,its[maxn];int main(){    int i,j,t,le,ri,u,v,x;    while(~scanf("%d%d",&n,&m))    {        s.clear();        for(i=1;i<=n;i++)        {            s.insert(i);        }        for(i=1;i<=m;i++)        {            scanf("%d%d%d",&le,&ri,&x);            it=s.lower_bound(le);            cnt=0;            for(pos=it;*pos<=ri&&pos!=s.end();pos++)            {                u=*pos;                if(u==x) continue ;                pre[u]=x;                its[++cnt]=pos;            }            for(j=1;j<=cnt;j++)            {                s.erase(its[j]);            }        }        pre[*s.begin()]=0;        for(i=1;i<n;i++)        {            printf("%d ",pre[i]);        }        printf("%d\n",pre[i]);    }    return 0;}