kowalsk1's blog

By kowalsk1, history, 4 months ago, In English

First of all, I'd like to thank the CF admins for giving my design a shot. My friends were literally calling me in the middle of the night to tell me the news, and unfortunately I was sleeping, but when I woke up I saw all the messages and it just made my day. As of this moment, I think the voting between Nikhil's version and the current logo is pretty neck and neck, and a lot of people seemed to have liked it, so we decided to improve it to the point that it would be a real candidate.

Finally, I want to thank nikhil1_raghav for improving my original idea (It's basically a joint project at this point), and also imachug for creating the voting post, and, at last, those who shared their feedback, which was much appreciated.

Now to the logo itself: OG CF Colors, denoting the rating distributions, just like in the current one. Also added the Telegram Sponsorship text and some other adjustments. Let me know what you guys think!

This is how the homepage would look like

Designed some t-shirts, check out all of them here

Read more »

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

By kowalsk1, history, 4 months ago, In English

I've been working on this little project lately of making a new logo for codeforces, just for fun. The link to check it out is below, and please send your feedback.

Edit: Just a little side note for those unfamiliar with behance: You can scroll down to see the whole presentation.

https://www.behance.net/gallery/110153699/Codeforescom-Rebranding-Concept

Read more »

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

By kowalsk1, history, 3 years ago, In English

Does anyone know the name of the font that is used to display source code here on cf?

Thanks in advance.

Read more »

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

By kowalsk1, history, 3 years ago, In English

I submitted the following solution for today's B during the contest: http://codeforces.com/contest/1005/submission/40123027 But even later when i saw the test case, i couldn´t figure out what i did wrong, cause i think my logic is correct. Can someone explain why is my algorithm failing? Are there any corner cases in this problem?

Thanks in advance, have a great day.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By kowalsk1, history, 3 years ago, In English

I remapped the keybindings in Sublime Text 3 so that ctrl+v pastes the text and also indents it correctly, but i've tested it with codeforces and my code continues the same as before (when i didn't use paste and indent) : with a huge tab size. Although it´s not a huge problem, i'd like to see it fixed because it´s bugging me a little bit. So, if someone has experienced something similar before or has a clue of what might be causing this problem, please share it in the comments.

Thanks in advance.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By kowalsk1, history, 3 years ago, In English

I´m having a hard time implementing the swap function for a wavelet tree, which would be:

Given an index i, swap the elements at positions i and i + 1.

Can anyone point any references that would help?

Read more »

 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

By kowalsk1, history, 3 years ago, In English

So here´s the problem:

Given two sequences of numbers s and r, such that all elements from the sequences are distinct, find the longest common subsequence of both sequences.

Now, i know the DP solution for the general case, which is executed in O(n2), but in this problem i need to get as efficient as O(nlg(n)). I found an explanation on stack overflow about how to use the LIS (Longest Increasing Subsequence) algorithm to achieve this complexity, but i didn´t understand very well. So does anyone how to explain a faster than quadratic algorithm to solve this problem?

Thanks ahead.

Read more »

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

By kowalsk1, history, 3 years ago, In English

Consider the following problem:

Given an initial array of n integers, you´re asked to perform q queries of the form:

I x V : Add V to the x-th position on the array. If it is not empty (equals 0) then add it between the positions x and x + 1.

S x y : Calculate the sum of all elements from index x to y, inclusively.

My teacher has advised us to use RMQ or an Offline Segment Tree for this one, but i would like to know if there´s a way of adapting the Fenwick Tree to support this sort of shift that may need to be done on the vector efficiently.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By kowalsk1, history, 3 years ago, In English

So after today´s contests i tried to solve problem B (yeah, i didn´t do that great hehe), and then submmited a solution that amazingly got WA only in test number 95, here it is:

https://imgur.com/a/pRNkGr8

I don´t necesserily think i broke a record, but i figured it would be fun to see if you guys can also share on the comments some possibly record breaking submissions like: most test cases passed before TLE, most test cases passed before WA and stuff like that. Maybe even tell more about the code involved in each of those submissions and why things went wrong.

Read more »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it

By kowalsk1, history, 3 years ago, In English

Does anyone know an algorithm to solve the following problem:

Given a sequence of points in the plane that represent a polygon (not necessarily convex), output the maximum possible radius of a circle that can fit inside this polygon.

It would be good if it was below O(n2), but any references are welcome. Thanks ahead.

Read more »

 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

By kowalsk1, history, 3 years ago, In English

I´d like to know what is the process to suggest a new organization to be added to the list.

Read more »

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

By kowalsk1, history, 3 years ago, In English

I have an idea for a very neat problem envolving trees and mathematics. Althought it´s not trivial, math-minded folks will likely solve it in no more than a few minutes. So i´d like to know where can i propose only this problem, so that it is avaible to be used in future contests if it interests anyone.

Read more »

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