### heyyolol's blog

By heyyolol, 4 days ago, ,

Can someone teach me how to do that qn? I tried finding the announcement blog, but there wasn't any solutions posted abt this qn and google translating the official editorial didn't work well enug for me to understand.

https://oj.uz/problem/view/JOI18_wild_boar

• +5

By heyyolol, history, 4 weeks ago, ,

Hi, recently I noticed that JOI SC and final round problems (from 2016 and before) were not available in English. I know google translate is an option, but sometimes that doesn't really work very well enough to understand the question. So may I ask if any of ur know if there is any online judge which had them translated?

• +13

By heyyolol, history, 2 months ago, ,

Hi everyone, does (2D range add update, and range sum queries) fenwick and segment tree exist?

If there is could someone kindly provide me ur code? Thanks :)

I tried googling but I didn't find anything really useful. :( Edit: Like by range I mean for e.g. (a,b) to (c,d), for a<=c && b<=d.

• +2

By heyyolol, history, 3 months ago, ,

Given n (<= 10^5) bitmasks of length k (<= 22) find number of pairs of bitmasks which AND to 0. Time limit is 2 secs

Can anyone provide an idea for this? Thanks! :)

• +2

By heyyolol, history, 3 months ago, ,

Recently I tried using getchar to take in char input (c++), the sample works fine on my compiler , but got idleness limit exceeded on judge, I tried the code in custom invocation, and it turns out getchar was reading random characters lol. My code is something like

for(int i=0;i<n;++i) for(int j=0;j<n;++j) while(grid[i][j]!='.'&&grid[i][j]!='#') grid[i][j]=getchar()

Does anyone know how to fix this problem? Thank you!! :)

• +5