Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 44 | School Team Contest 2 (Winter Computer School 2010/11) | FINISHED | False | 18000 | 487364423 | Nov. 6, 2010, 11 a.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 79 ) | F | BerPaint | PROGRAMMING | geometry graphs | 2600 |
Anfisa the monkey got disappointed in word processors as they aren't good enough at reflecting all the range of her emotions, that's why she decided to switch to graphics editors. Having opened the BerPaint, she saw a white rectangle W × H in size which can be painted on. First Anfisa learnt to navigate the drawing tool which is used to paint segments and quickly painted on that rectangle a certain number of black-colored segments. The resulting picture didn't seem bright enough to Anfisa, that's why she turned her attention to the "fill" tool which is used to find a point on the rectangle to paint and choose a color, after which all the area which is the same color as the point it contains, is completely painted the chosen color. Having applied the fill several times, Anfisa expressed her emotions completely and stopped painting. Your task is by the information on the painted segments and applied fills to find out for every color the total area of the areas painted this color after all the fills. The first input line has two integers W and H ( 3 ≤ W , H ≤ 10 4 ) — the sizes of the initially white rectangular painting area. The second line contains integer n — the number of black segments ( 0 ≤ n ≤ 100 ). On the next n lines are described the segments themselves, each of which is given by coordinates of their endpoints x 1 , y 1 , x 2 , y 2 ( 0 < x 1 , x 2 < W , 0 < y 1 , y 2 < H ). All segments have non-zero length. The next line contains preset number of fills m ( 0 ≤ m ≤ 100 ). Each of the following m lines defines the fill operation in the form of " x y color ", where ( x , y ) are the coordinates of the chosen point ( 0 < x < W , 0 < y < H ), and color — a line of lowercase Latin letters from 1 to 15 symbols in length, determining the color. All coordinates given in the input are integers. Initially the rectangle is "white" in color, whereas the segments are drawn "black" in color. For every color present in the final picture print on the single line |
| School Team Contest #2 (Winter Computer School 2010/2011): tutorial of A-E, H, J. |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 4264183 | ftiasch | F | Aug. 11, 2013, 6:01 a.m. | OK | GNU C++ | TESTS | 60 | 124 | 2355200 | 2600 | |
| 40993454 | ReaLNero1 | F | July 31, 2018, 1:58 a.m. | OK | GNU C++ | TESTS | 60 | 124 | 18124800 | 2600 | |
| 4322607 | data_h | F | Aug. 22, 2013, 5:43 a.m. | OK | GNU C++ | TESTS | 60 | 124 | 18329600 | 2600 | |
| 4397398 | TankEngineer | F | Sept. 2, 2013, 1:45 p.m. | OK | GNU C++ | TESTS | 60 | 248 | 2355200 | 2600 | |
| 4263881 | _gXX | F | Aug. 11, 2013, 4:07 a.m. | OK | GNU C++ | TESTS | 60 | 248 | 20787200 | 2600 | |
| 625966 | AHdoc MinakoKojima | F | Aug. 22, 2011, 12:45 p.m. | OK | GNU C++ | TESTS | 60 | 280 | 2560000 | 2600 | |
| 566504 | sevenkplus zbwmqlw | F | July 26, 2011, 5:24 p.m. | OK | GNU C++ | TESTS | 60 | 280 | 2560000 | 2600 | |
| 4264042 | liuq901 | F | Aug. 11, 2013, 5:12 a.m. | OK | GNU C++ | TESTS | 60 | 280 | 20787200 | 2600 | |
| 626026 | AHdoc MinakoKojima | F | Aug. 22, 2011, 1:30 p.m. | OK | GNU C++ | TESTS | 60 | 300 | 2560000 | 2600 | |
| 568982 | sevenkplus zbwmqlw | F | July 29, 2011, 3:02 a.m. | OK | GNU C++ | TESTS | 60 | 300 | 2560000 | 2600 | |
| 514493 | DDDDDDDDDDDDDDDDDDDDDDDD | F | June 30, 2011, 10:54 a.m. | OK | GNU C++0x | TESTS | 60 | 200 | 2457600 | 2600 | |
| 2881454 | AHdoc MinakoKojima | F | Jan. 7, 2013, 8:21 p.m. | OK | GNU C++0x | TESTS | 60 | 359 | 1228800 | 2600 | |
| 2881434 | AHdoc MinakoKojima | F | Jan. 7, 2013, 8:11 p.m. | OK | GNU C++0x | TESTS | 60 | 390 | 1228800 | 2600 | |
| 19207510 | IlyaLos denniean | F | July 18, 2016, 8:47 a.m. | OK | GNU C++11 | TESTS | 60 | 124 | 19660800 | 2600 | |
| 17408612 | 2016 | F | April 20, 2016, 4:59 p.m. | OK | GNU C++11 | TESTS | 60 | 312 | 3174400 | 2600 | |
| 15695278 | Y-MP | F | Jan. 31, 2016, 1:49 p.m. | OK | GNU C++11 | TESTS | 60 | 4522 | 2662400 | 2600 | |
| 17204272 | Los_Angelos_Laycurse | F | April 7, 2016, 1:28 p.m. | OK | GNU C++11 | TESTS | 60 | 4710 | 67072000 | 2600 | |
| 68721804 | Crusaderr | F | Jan. 13, 2020, 4:32 p.m. | OK | GNU C++14 | TESTS | 60 | 92 | 1638400 | 2600 | |
| 62251278 | calabash_boy | F | Oct. 10, 2019, 9:21 a.m. | OK | GNU C++14 | TESTS | 60 | 156 | 2355200 | 2600 | |
| 68328797 | hpfdf | F | Jan. 6, 2020, 5:54 p.m. | OK | GNU C++14 | TESTS | 60 | 996 | 6758400 | 2600 | |
| 67588047 | RNS_CUS | F | Dec. 25, 2019, 9:02 a.m. | OK | GNU C++17 | TESTS | 60 | 62 | 1638400 | 2600 | |
| 17204446 | Los_Angelos_Laycurse | F | April 7, 2016, 1:37 p.m. | OK | MS C++ | TESTS | 60 | 4366 | 67174400 | 2600 |
Back to search problems