CodeForces 357C - Knight Tournament(模拟)

C. Knight Tournament
time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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 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.

题意：
区间染色，不能染自己或者已经被染色了的，输出最后1到n的染色情况。

解题思路：
用线段树的区间更新，或者是用set模拟步骤。
将1到n放到set容器中，对于每一次更新，都把染色的从set中拿走，同时对数组进行染色，最后输出结果。

AC代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5+5;
int a[maxn];
set<int>st;
set<int> :: iterator it,cnt[maxn];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++)    st.insert(i);
    while(m--)
    {
        int l,r,c;
        scanf("%d%d%d",&l,&r,&c);
        int len = 0;
        for(it = st.lower_bound(l);*it <= r && it != st.end();it++)
        {
            if(*it != c)
            {
                a[*it] = c;
                cnt[len++] = it;
            }
        }
        for(int i = 0;i < len;i++)  st.erase(cnt[i]);
    }
    for(int i = 1;i <= n;i++)    printf("%s%d",i==1?"":" ",a[i]);
    return 0;
}