deltixlab's blog

By deltixlab, 5 weeks ago, In English

We are excited to announce a new educational resource that is coming soon under the Deltix umbrella. Here is a list of paid part-time positions for teachers who want to join our rock star team:

  • Math & statistics
  • Algorithms & data structures
  • Data science
  • Advanced programming languages
  • Systems architecture
  • Networks and clouds
  • Practical time-series analysis
  • Machine learning
  • Security
  • Real-time backend (architecture)
  • Operating systems
  • Product strategy, vision, marketing and innovation

Each discipline will include lectures and practical exercises. Some of them will also offer mentorship for the final project.

Our resource will not be publicly available.

Excited about the opportunity? Complete the form at https://forms.gle/spXr3DaSYmRYePER9 and we will get back to you with further information.

Fill free to drop us a line at epic@epam.com if you have any questions.

Read more »

 
 
 
 
  • Vote: I like it
  • +25
  • Vote: I do not like it

By deltixlab, 6 months ago, In English
Tutorial is loading...

Prepared by Vladik.
Solution: 137274527

Tutorial is loading...

Prepared by AleXman111.
Solution: 137274647

Tutorial is loading...

Prepared by AleXman111.
Solution: 137274769

Tutorial is loading...

Prepared by 4llower.
Solution with $$$O(n \cdot log(n))$$$: 137274837

Tutorial is loading...

Prepared by AleXman111.
Solution: 137274954

Tutorial is loading...

1609G - A Stroll Around the Matrix

Let's try to solve the problem without asking for changes. Note that in the matrix constructed in this way for the move from (i, j) it is always profitable to go to the cell with the smallest number. This can be seen more clearly in the matrix of the first test case:

This allows you to solve the problem with complexity $$$O(n + m)$$$, but this is not enough for a complete solution. Let's introduce two new arrays of the difference between the adjacent elements of the arrays $$$da_i = a_{i + 1} - a_i$$$ and $$$db_i = b_{i + 1} - b_i$$$.

Note that our greedy decision turns right out of the cell $$$(i, j)$$$, when $$$da_i > db_j$$$. For clarity, below is an illustration of the turns:

Each time such a turn to the right in the cell $$$(i, j)$$$ decreases our total sum by $$$(da_i - db_j) + (da_{i + 1} - db_j) + \dots + (da_{n - 1} - db_j) = (\sum_{t=i}^{n - 1} da_t) - db_j \cdot (n - i)$$$. Which is actually equivalent to the sum of $$$da_i - db_j$$$ for all $$$da_i > db_j$$$.

Such a sum can be considered by recognizing for each $$$i$$$ by a binary search the last $$$db_j$$$ for which the expression $$$da_i> db_j$$$ is true. This allows us to solve the problem in $$$O(n \cdot log(m))$$$ using the prefix sums of the $$$db$$$ array.

Now let's get back to change requests. Because the size of the $$$da$$$ array is small enough, then we can change the values of its elements by a simple. To store the $$$db$$$ array, you will need to use a segment tree supporting the following operations:
- Adding a number at the suffix (since we are working with an array $$$db$$$, not $$$b$$$, then all elements will change by one number equal to the step of the arithmetic progression).
- Sum of array numbers on array prefix so far $$$element_i < X$$$. ($$$da_i$$$ will act as $$$X$$$).

Prepared by Vladik.
Total complexity: $$$O(q \cdot n \cdot log(m))$$$.

Tutorial is loading...

Prepared by Nebuchadnezzar.

Read more »

 
 
 
 
  • Vote: I like it
  • +69
  • Vote: I do not like it

By deltixlab, 6 months ago, translation, In English

deltix

Hi, Codeforces!

We are DELTIX. Founded in 2005, DELTIX is one of the market leaders in software development for financial research and products for systematic and algorithmic trading. In 2020 DELTIX joined the EPAM family. Our mission is to turn promising ideas into breakthrough products fast.

We are experts in:

  • aggregation, storage, and processing large volumes of time-series data
  • data modeling
  • testing and deployment of quantitative models

In our team we value such skills as:

  • knowledge of algorithms
  • high-performance coding
  • low latency data streams processing

We are excited to announce that we have released TimeBase Web Admin Community Edition.

More about DELTIX

Throughout the year, once per quarter, we will be inviting you to join DELTIX rounds at Codeforces. Today, we are excited to welcome you to the third installment of our rounds (joined Div1 и Div2) Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2), that will start on Nov/28/2021 17:35 (Moscow time). It is an open and rated round for both divisions.

We have prepared the following trophies for you:

1st place: Samsung Galaxy Z Flip3
2nd place: Samsung Galaxy Tab S7+
3rd place: Samsung Galaxy Watch4
1-100 places: branded t-shirts

Another 100 t-shirts will be distributed randomly between participants outside the top-100 but within the top-1000 and who participated in rated Codeforces rounds before.

Problems, except the last one, have been prepared by members of our team: Vladik, 4llower and AleXman111.

We would like to say a word of appreciation to:

We will offer participants 8 problems and 150 minutes to solve them. We wish everybody good luck and high ratings!

Fill out a short contact form if you are interested in employment opportunities or would like to speak with recruiters or members of our team.

Contact Form →

UPD: The scoring distribution is 500 — 1000 — 15002000 — 2750 — 3000 — 3250 — 3750.

Thank you all for participating! (editorial)

Congratulations to the winners:
1. tourist
2. DmitryGrigorev
3. xtqqwq
4. Maksim1744
5. greenheadstrange
6. maroonrk
7. jiangly
8. slime
9. QAQAutoMaton
10. emptyhope

We were especially delighted with the result tourist, who was able to solve all 8 problems, congratulations!

Read more »

 
 
 
 
  • Vote: I like it
  • +221
  • Vote: I do not like it

By deltixlab, 9 months ago, In English
Tutorial is loading...

Prepared by AleXman111.

Tutorial is loading...

Prepared by AleXman111.

Tutorial is loading...

Prepared by Vladik.

Tutorial is loading...

Prepared by Vladik.

Tutorial is loading...

Prepared by netman.

Tutorial is loading...

Prepared by netman.

Tutorial is loading...

Prepared by netman.

Tutorial is loading...

Prepared by 300iq.

P.S. Editorial for problems E and G will appear a little later.

Read more »

 
 
 
 
  • Vote: I like it
  • +66
  • Vote: I do not like it

By deltixlab, 9 months ago, In English

deltix

Hi Codeforces!

We are DELTIX. Founded in 2005, DELTIX is one of the market leaders in software development for financial research and products for systematic and algorithmic trading. In 2020 DELTIX joined the EPAM family. Our mission is to turn promising ideas into breakthrough products fast.

We are experts in:

  • aggregation, storage, and processing large volumes of time-series data
  • data modeling
  • testing and deployment of quantitative models

In our team we value such skills as:

  • knowledge of algorithms
  • high-performance coding
  • low latency data streams processing

We are excited to announce that one of our products TimeBase Community Edition joined a FinTech Open-Source Foundation (FINOS) on the 14th of July.

TimeBase is a multi-faceted, open-source data-streaming powerhouse, combining a time-series database, message broker, data modeling, and a well-optimized serialization framework. Originally, TimeBase was designed to address use cases in the financial domain. Nevertheless, we take on new challenges in other areas such as IoT, cloud computing, clustering, high-performance computing, parallel data processing, and Big Data to name a few.

Learn more about DELTIX

Throughout the year, once per quarter, we will be inviting you to join DELTIX rounds at Codeforces. Today, we are excited to welcome you to the second installment of our rounds (joined Div. 1 and Div. 2) — Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2), that will start on Aug/29/2021 17:35 (Moscow time).

It is an open and rated round for both divisions.

We have prepared the following trophies for you:

  • 1st place = MacBook Air
  • 2nd place = iPad Pro
  • 3rd place = iPad Air
  • 1-100 = branded t-shirts

Another 100 t-shirts will be distributed randomly between participants outside the top-100 but within the top-1000 and who participated in rated Codeforces rounds before.

All problems, except the last one, have been prepared by members of our team: Vladik, netman and AleXman111.

We would like to say a word of appreciation to:

We will offer participants 8 problems and 150 minutes to solve them. We wish everybody good luck and high ratings!

Fill out a short contact form if you are interested in employment opportunities or would like to speak with recruiters or members of our team.

Contact Form →

UPD: After processing all testers' feedback, we decided to extend the competition by 15 minutes. The total duration is 150 minutes.

UPD2: The scoring distribution is 500 — 1000 — 15001500 — 2000 — 2500 — 3000 — 3500. Note the equal complexity of C and D.

Thank you all for participating! (editorial)

Congratulations to the winners:
1. slime
2. jiangly
3. Benq
4. Egor
5. TLE
6. ainta
7. Radewoosh
8. Golovanov399
9. ecnerwala
10. maroonrk

Read more »

 
 
 
 
  • Vote: I like it
  • +595
  • Vote: I do not like it

By deltixlab, 12 months ago, In English
Tutorial is loading...

Prepared by Vladik.

Tutorial is loading...

Prepared by AleXman111.

Tutorial is loading...

Prepared by netman.

Tutorial is loading...

Prepared by Vladik.

Tutorial is loading...

Prepared by AleXman111.

Tutorial is loading...

Prepared by netman.

Tutorial is loading...

Prepared by Vladik.

Tutorial is loading...

Prepared by 74TrAkToR.

Read more »

 
 
 
 
  • Vote: I like it
  • +33
  • Vote: I do not like it

By deltixlab, 12 months ago, translation, In English

deltix

Hi Codeforces!

We are DELTIX. Founded in 2005, DELTIX is one of the market leaders in software development for financial research and products for systematic and algorithmic trading. In 2020 DELTIX joined the EPAM family. Our mission is to turn promising ideas into breakthrough products fast.

We are experts in:

  • aggregation, storage, and processing large volumes of time-series data
  • data modeling
  • testing and deployment of quantitative models

In our team we value skills like:

  • knowledge of algorithms
  • high-performance coding
  • low latency data streams processing

Learn more about DELTIX

Throughout the year, once per quarter, we will be inviting you to join DELTIX rounds at Codeforces. Today, we are excited to welcome you to the first installment of our rounds (joined Div1 и Div2) — Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2), that will start on May/30/2021 17:35 (Moscow time).

It is an open and rated round for both divisions.

We have prepared the following trophies for you:

  • 1st place = the most desired console of 2021 — PlayStation 5!
  • 2nd place = Nintendo Switch
  • 3rd place = Nintendo Switch Lite
  • 1-100: branded t-shirts

Another 100 t-shirts will be distributed randomly between 100 participants outside of top-100 and who have solved at least one problem and participated in rated Codeforces rounds before.

Problems have been prepared by our employees: Vladik, netman, AleXman111 and sdryapko.

We would like to say a word of appreciation:

We will offer participants 8 problems and 135 minutes to solve them. We wish everybody good luck and high ratings!

Fill out a short contact form if you are interested in internship and/or employment opportunities or would like to speak with recruiters or members of our team.

Contact Form →

UPD: The scoring distribution is 500 — 1000 — 1500 — 2250 — 2250 — 3000 — 3250 — 3250.

Thank you all for participating! (editorial)

Congratulations to the winners:
1. tourist
2. Radewoosh
3. Um_nik
4. maroonrk
5. ecnerwala
6. jiangly
7. SSRS_
8. Petr
9. scott_wu
10. Maksim1744

We would like to express our special congratulations to the top three leaders! We will try to send you your well-deserved prizes as soon as possible :) Unfortunately, we can not list the people who received 100 random T-shirts due to the fact that the search for cheaters is not completed.

Read more »

 
 
 
 
  • Vote: I like it
  • +198
  • Vote: I do not like it