Good day, Codeforces!
I can't wait to give you a good news that a new competition for div1 participants is appeared in the list of events. This competition is a broadcast of the Saratov Team Olympiad on Programming and therefore will be held by the ACMICPC rules. Especially for div1 participants, we complicate this school competition a bit, so that everyone was interested to solve the problems.
This Competition is individual, it will be rated for both divisions.
Please note that the start time of the competition is different from the usual. Also note the unusual length of the competition.
See you at Codeforces Round #145! I hope that everyone will find the time to participate in the competition.
UPD. The competition finished, the editorial will come soon.
Thanks for this great time,when I am in school :(((((((
I don't understand why there are so many negative comments about the time. This contest is a translation of the real competition for school students in Saratov, and it will be held at the same time. So the time can't be changed. If you can't participate, because you go to school and so on, you can solve a virtual contest later.
ya

Because problemset in div1 and div2 differs :)
Thx..
x( i'm at school too beside there is no point in virtual contest :((
I don't know what about others but for me the time is so lucky ) thanks.
Can anyone tell how many problems there will be for div2? I haven't ever participated in a 3:30 long contest in Codeforces before so i do not know... Thnx..
I think the author will update the number of problems in both divisions right before the contest.
That's a great idea...
It'll take place at 4AM here in Brazil. But, I found time to participate in the competition, it's a good way to learn.
What is it mean ACMICPC rules? I can't find about ACMICPC rules. Can you explain or give a link for me please?
Here ACMICPC rules means, there will be no pretest or pending submission. You will get "Accepted" or "Wrong Answer" as a verdict right after submission and it will be final.
But the Duration of contest or Number of problems may differ from usual. :)
Why durations of div1 and div2 are different? (div1 2h, div2 3.5h)
Sorry, i haven't see previous post. I know it now.
Will the problems be sorted according to the difficulty?
In ACMICPC, the problems are never sorted. So I am guessing no :)
Love it..
w.t.f?
I hope this will be a good practice session for the upcoming regional in my country next month :)
Can someone explain me why need big time,
Nice contest. It was worth waking up early.
Is this contest rated?(I believe it's rated contest)
"This Competition is individual, it will be rated for both divisions."
thank you,I have missed it...
I skipped my class to play in the contest. XD!!!!
Watch Out! We've got a badass over here
Contest is over now, but I still can't see the solutions of other participants. Kindly fix this.
I need upsolving. pls be fast
Eagerly waiting for the rating to change....why is it taking so long today :(
:w
i can't view others submissions nor has the rating changed , why is it taking so long
The problem E can be modeled as Minimum Arborescence.
But I used to know the algorithm of it is O(VE)...
With nothing to do at last so I write one for a try...
But to my surprise it passed...
And I found the actually complexity of that is indeed O(E logV)....
here's a link:http://en.wikipedia.org/wiki/Edmonds'_algorithm
Maybe it's helpful.
I found my implementation is still O(VE) :( ...
Thank for cherudim to give me such kind of tests.
Anyway...There's fast implementation as O(E logV).
OHHHH next contest alsoooo 11 PM when I am in school !!!!!!!!!!!!!!!!!!!!!!!!!!
Will there be an editorial ?
Could someone please tell me how to solve Div.2 H / Div.1 D problem Merging Two Decks?
Many solutions to 240E  Ремонт дорог are wrong including mine. wuyiqi told me a test: 3 3 2 3 0 1 3 1 3 2 1
It is guaranteed that there is not more than one road between the cities in each direction.
I think there can be two roads between two city while they are in different directions.
Some pairs of cities have monodirectional roads built between them.
Many solutions to 240E — Road Repairs are wrong including mine like this: 4 4 1 2 1 2 3 0 3 4 1 4 2 0 mamy solutions output 1.but the answer is 2 1 3
Hi A shortsolution programming contest will hold on October 24 at gpac.blog.ir For more information go to the link.
I'm still waiting for your editorial :(
Will there by editorial for this contest?
How's the editorial coming? I'd love to read something about E ;)
I found the tag "greedy" after I solved problem E in O(V+E). Is it true that there is a correct (not accepted) greedy solution for this problem? How? I hope someone or the editorial would tell me something about it.
try 3 3 1 2 1 2 3 1 3 2 0
Could you please upload the editorial ?
How's the editorial coming?
By train :P
By a toy* train.
i don't think the statement of problem e satisfy the truth.
There is no editorial until now !!! :/ Will it be published ??? Or already published in any other blog ???
Why am I getting a TLE on the 1st test case
http://ideone.com/0PewNN
Please help
Can anyone tell me how the answer for "Cinema" for this test case is 0, 2: 100 1 1 2 ab 17 0 0 0 0 0 0 0 0 0 0 0 2 3 4 5 6 7 abb 1 2 The 1st movie need not contain his favorite actor hence I think the answer is 2, 2. Pls. help
I like this contest 52150518:)
my AC code(cpp):52150518
234E  Лига Чемпионов
How to solve Div 2 F.Fence? I know its DP but what will be the transition?