A. Knight Tournament
来源:互联网 发布:梦幻法宝五彩娃娃数据 编辑:程序博客网 时间:2024/04/29 13:18
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 ton.
- The tournament consisted of m fights, in the i-th fight the knights that were still in the game with numbers at leastli and at mostri 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 numberxi, 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 numberb was conquered by the knight number a, if there was a fight with both of these knights present and the winner was the knight numbera.
Write the code that calculates for each knight, the name of the knight that beat him.
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 followingm 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.
Print n integers. If thei-th knight lost, then the i-th number should equal the number of the knight that beat the knight numberi. If the i-th knight is the winner, then thei-th number must equal 0.
4 31 2 11 3 31 4 4
3 1 4 0
8 43 5 43 7 62 8 81 8 1
0 8 4 6 4 8 6 1
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.
AC代码:
#include <iostream>#include <vector>#include <cstdio>#include <set>using namespace std;const int M = 1e5 * 3 + 100;int vis[M];set<int>ms;int main(){ int n,m; scanf("%d %d",&n,&m); for(int i = 1; i <= n; i++) ms.insert(i); while(m--) { int l,r,x; scanf("%d %d %d",&l,&r,&x); set<int> :: iterator it = ms.lower_bound(l); vector<int>ls; while(*it <= r && it != ms.end()) { if(*it != x) { ls.push_back(*it); vis[*it] = x; } ++it; } for(int i = 0; i < ls.size(); i++) ms.erase(ls[i]); } for(int i = 1; i <= n; i++) printf(i == n ? "%d\n" : "%d ",vis[i]); return 0;}
- 356A - Knight Tournament
- A. Knight Tournament
- CodeForces 356A Knight Tournament 【线段树】
- A. Knight Tournament----并查集
- Knight Tournament
- Knight Tournament
- codeforce 356 A. Knight Tournament(线段树覆盖,3级)
- CodeForces 356A - Knight Tournament set or 线段树
- CF 356A Knight Tournament(并查集)
- CodeForce 356A Knight Tournament(set应用)
- Codeforces 356A Knight Tournament线段树区间覆盖
- ACM->CF Knight Tournament
- codeforces356A Knight Tournament
- Knight Tournament CodeForces
- codeforces 357C Knight Tournament
- CodeForce 356A Knight Tournament(线段树的区间更新+单点询问)
- CodeForces 357C - Knight Tournament(模拟)
- Codeforces #356C: Knight Tournament 题解
- 动态计算UITableViewCell高度详解
- 更新工艺路线资源
- maven3常用命令、java项目搭建、web项目搭建详细图解
- Android sp和wp指针
- 织梦去版权方法DedeCms 5.7全站去版权去广告方法(后台)
- A. Knight Tournament
- jsp导出到word,默认显示为web视图,应该该为页面视图
- 进程间数据通信方式和特点
- Audio Policy 分析
- DPM 目标检测原理
- C++11和游戏相关。
- Android屏幕旋转时Activity的生命周期
- nginx 配置文件详解
- ALV 颜色设置