Codeforces A. Knight Tournament （线段树）

最新推荐文章于 2020-01-12 15:14:12 发布

Top_Spirit

最新推荐文章于 2020-01-12 15:14:12 发布

阅读量203

点赞数

分类专栏：线段树文章标签： acm 线段树

本文链接：https://blog.csdn.net/weixin_41190227/article/details/99425344

版权

线段树专栏收录该内容

15 篇文章 0 订阅

订阅专栏

本文介绍了一个关于骑士锦标赛的编程问题，比赛中n名骑士通过m场比赛决出胜负。每场比赛由区间[l, r]内的骑士参加，获胜者编号为x。题目要求找出每个骑士被哪个骑士击败，或若为胜利者则输出0。解决方案利用线段树进行区间更新，并在查询时处理lazy标记，以确定每位骑士的败者。" 121129568,10991565,LDA与SVM实战：从原理到实现,"['机器学习', 'LDA', 'SVM', '数据集', '模型训练']

摘要由CSDN通过智能技术生成

A. Knight Tournament

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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

Copy
4 3
1 2 1
1 3 3
1 4 4
Output

Copy
3 1 4 0 
Input

Copy
8 4
3 5 4
3 7 6
2 8 8
1 8 1
Output

Copy
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，x，表示下标为l到r的骑士中胜者为x，最后让你输出每个人被谁打败了，如果是人生大赢家就输出0。

解题思路：对于没场战斗分为两段区间进行更新操作。也是有一个相当于lazy标记一样的东西，不需要每次标记完就直接pushdown，需要的时候再去pushdown。

/*
@Author: Top_Spirit
@Language: C++
*/
#include <bits/stdc++.h>
using namespace std ;
const int Maxn = 3e5 + 10 ;

#define lson l, mid, ri << 1
#define rson mid + 1, r, ri << 1 | 1

struct Node {
    int l, r, k ;
}mes[Maxn];

int no[Maxn << 2], ans[Maxn] ;
int a[Maxn], n, m ;

void Updata (int l, int r, int ri, int L, int R, int val){
    if (L <= l && R >= r) {
        no[ri] = val ;
        return ;
    }
    if (no[ri]) {
        no[ri << 1] = no[ri << 1 | 1] = no[ri] ;
        no[ri] = 0 ;
    }
    int mid = (l + r) >> 1 ;
    if (L <= mid) Updata(lson, L, R, val) ;
    if (R > mid) Updata(rson, L, R, val) ;
}

void query(int l, int r, int ri){
    if(l == r) {
        ans[l] = no[ri] ;
        return ;
    }
    if (no[ri]) {
        no[ri << 1] = no[ri << 1 | 1] = no[ri] ;
        no[ri] = 0 ;
    }
    int mid = (l + r) >> 1 ;
    query(lson) ;
    query(rson) ;
}

int main (){
    cin >> n >> m ;
    for (int i = 0; i < m; i++) cin >> mes[i].l >> mes[i].r >> mes[i].k ;
    for (int i = m - 1; i >= 0; i--){
        if (mes[i].l < mes[i].k) Updata(1, n, 1, mes[i].l, mes[i].k - 1, mes[i].k) ;
        if (mes[i].r > mes[i].k) Updata(1, n, 1, mes[i].k + 1, mes[i].r, mes[i].k) ;
    }
    query(1, n, 1) ;
    for (int i = 1; i <= n; i++) cout << ans[i] << " " ;
    cout << endl ;
    return 0 ;
}