Блог пользователя mgch

Invitation to CodeChef July Lunchtime 2018!
Автор mgch, 6 лет назад, По-английски

Hello CodeForces Community!

We’re excited to announce the July Lunchtime 2018 sponsored by ShareChat. We hope to see you all join us in these 3 intense hours of coding challenges. Plus there are some exciting job and internship opportunities by ShareChat for participants of July Lunchtime. For more details please visit the contest page here: https://www.codechef.com/LTIME62

Joining me on the problem setting panel are:

  • Problem Setter: Fekete (Ivan Fekete)
  • Problem Tester: mgch (Misha Chorniy)
  • Editorialist: likecs (Bhuvnesh Jain)
  • Statement Verifier: Xellos (Jakub Safin)
  • Russian Translator: Mediocrity (Fedor Korobeinikov)
  • Mandarin Translator: huzecong (Hu Zecong)
  • Vietnamese Translator: VNOI Team

Contest Details:

Time: 28th July 2018 (1930 hrs — 2230 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone

Contest link: https://www.codechef.com/LTIME62

Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.

Prizes: Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://discuss.codechef.com/questions/51999/how-do-i-win-a-codechef-goodie. (For those who have not yet received their previous winning, please send an email to winners@codechef.com)

Good Luck! Hope to see you at the contest!

  • Проголосовать: нравится
  • +56
  • Проголосовать: не нравится

»
6 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

5 problems in both divisions.

am I right?

→ Ответить
»
6 лет назад, # |
  Проголосовать: нравится +26 Проголосовать: не нравится

system stopped :(

→ Ответить
»
6 лет назад, # |
  Проголосовать: нравится +8 Проголосовать: не нравится

Task were interesting, thanks !

I think round should be unrated, conditions were same for everyone, but again it is not same situation if you have 2 hours or 3 hours.

→ Ответить
»
6 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

how we will submit solution,if it has been locked ?

→ Ответить
»
6 лет назад, # |
  Проголосовать: нравится +6 Проголосовать: не нравится

I think "MEX and Ranges" problem is similar to this CF problem. I directly copied my online solution from that problem and submitted. Unfortunately timit limit is too strict, that is why 2 testcases in the last subtask do not pass. But I believe with some optimizations, I can get full score. My solution works in O(N5 / 3).

→ Ответить
»
6 лет назад, # |
← Rev. 3   Проголосовать: нравится +17 Проголосовать: не нравится

Editorial for the first five problems is available:

  1. SPLST

  2. PRMDIV

  3. FRCPRT

  4. GCDSUM

  5. MKSTR

  6. MEXRNG

Hope you all enjoyed the problemset. :)

→ Ответить
»
6 лет назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

well something really interesting happened today and I am having a really tough time understanding why my two solutions one Accepted and another TLE one takes 0.8s while another gives TLE at 3.1s and both are 99.9% same and the only differnce is

ACCEPTED 


------------------

long nVal = 0; 
if (present[nKey])
{
   nVal = count[nKey];
   if (sum[nKey] % sum[key] == 0)
	ans += nVal*value;
}

nKey += key;

------------------

TLE


------------------

long nVal = 0;
if (present[nKey])
   nVal = count[nKey];
 
if (sum[nKey]%sum[key] == 0 && present[nKey])
{
   ans += nVal*value;
}
 
nKey += key;

------------------

is % operation this much heavy

→ Ответить