Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1]

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
1423 Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] FINISHED False 10800 135449711 Oct. 5, 2020, 1:05 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 216 ) G Growing flowers PROGRAMMING data structures

B"Sarah has always been a lover of nature, and a couple of years ago she saved up enough money to travel the world and explore all the things built by nature over its lifetime on earth. During this time she visited some truly special places which were left untouched for centuries, from watching icebergs in freezing weather to scuba-diving in oceans and admiring the sea life, residing unseen. These experiences were enhanced with breathtaking views built by mountains over time and left there for visitors to see for years on end. Over time, all these expeditions took a toll on Sarah and culminated in her decision to settle down in the suburbs and live a quiet life. However, as Sarah's love for nature never faded, she started growing flowers in her garden in an attempt to stay connected with nature. At the beginning she planted only blue orchids, but over time she started using different flower types to add variety to her collection of flowers. This collection of flowers can be represented as an array of N flowers and the i -th of them has a type associated with it, denoted as A_i . Each resident, passing by her collection and limited by the width of his view, can only see K contiguous flowers at each moment in time. To see the whole collection, the resident will look at the first K contiguous flowers A_1, A_2, ..., A_K , then shift his view by one flower and look at the next section of K contiguous flowers A_2, A_3, ..., A_{K+1} and so on until they scan the whole collection, ending with section A_{N-K+1}, ..., A_{N-1}, A_N . Each resident determines the beautiness of a section of K flowers as the number of distinct flower types in that section. Furthermore, the beautiness of the whole collection is calculated by summing the beautiness values of each contiguous section. Formally, beautiness B_i of a section starting at the i -th position is calculated as B_i = distinct(A_i, A_{i+1}, ..., A_{i+K-1}"...

Tutorials

FinalsEditorial2020.pdf

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
94818742 TiwAirOAO G Oct. 6, 2020, 4:19 a.m. OK GNU C++11 TESTS 20 842 18227200
94792565 s_r_f G Oct. 5, 2020, 4:32 p.m. OK GNU C++11 TESTS 20 2401 16486400
94789676 hos.lyric maroonrk yosupo G Oct. 5, 2020, 3:59 p.m. OK GNU C++17 (64) TESTS 20 530 25702400
94780274 Kenb rabaiBomkarBittalBang Tlatoani G Oct. 5, 2020, 2:36 p.m. OK Kotlin TESTS 20 1933 39526400

remove filters

Back to search problems