Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Parazit's blog

By Parazit, history, 5 years ago, In English

Does any one know any problem about decompositioning graphs to certain subgraphs(such az triangle,star,clique or ...) in online judges?? Please give me links of them Thank you

Full text and comments »

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

By Parazit, history, 8 years ago, In English
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Parazit, history, 8 years ago, In English

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2397 it is a level 4 problem in uva online judge about segment tree.i used segment tree with lazy updates but i got time limit for 20 times!can any one help me?does this problem have some particular tip?

Full text and comments »

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

By Parazit, 10 years ago, In English

Does anyone have a good tutorial for 2sat?

Full text and comments »

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

By Parazit, 11 years ago, In English

hi! this is my code for the 3rd question of bronze division of usaco january contest. http://paste.ubuntu.com/6763413/ it compiled for 6 seconds in my computer and 0.6 seconds in my friends computer!!! i use dev c++ and he uses gvim. what is the reason of this big different???? excuse me for my english:(

Full text and comments »

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