codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

356A.md (2834B)


      1 Source: https://codeforces.com/problemset/problem/356/A
      2 
      3 A. Knight Tournament
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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.
     22 
     23 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:
     24 
     25 * There are *n* knights participating in the tournament. Each knight was assigned his unique number — an integer from 1 to *n*.
     26 * 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 *r**i* have fought for the right to continue taking part in the tournament.
     27 * 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.
     28 * The winner of the last (the *m*-th) fight (the knight number *x**m*) became the winner of the tournament.
     29 
     30 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*.
     31 
     32 Write the code that calculates for each knight, the name of the knight that beat him.
     33 
     34 Input
     35 
     36 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 *l**i*, *r**i*, *x**i* (1 ≤ *l**i* < *r**i* ≤ *n*; *l**i* ≤ *x**i* ≤ *r**i*) — the description of the *i*-th fight.
     37 
     38 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.
     39 
     40 Output
     41 
     42 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.
     43 
     44 Examples
     45 
     46 Input
     47 
     48 ```
     49 4 3  
     50 1 2 1  
     51 1 3 3  
     52 1 4 4
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 3 1 4 0
     59 ```
     60 
     61 Input
     62 
     63 ```
     64 8 4  
     65 3 5 4  
     66 3 7 6  
     67 2 8 8  
     68 1 8 1
     69 ```
     70 
     71 Output
     72 
     73 ```
     74 0 8 4 6 4 8 6 1
     75 ```
     76 
     77 Note
     78 
     79 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.