If you want atcoder to reschedule why you posting it here? :)

Wow, the first time I see blog about the contest late like this.

Mine will too! (I hope not though)

I hope you will

I am sorry for you bro :(

haha not as you wish :)

Maybe it's too easy for div1 users.

seriously awesome and motivating graph :)

Hard work pays off,sooner or later.

Looks like awoo have had the experience of all the ranks. From falling to grey and then rising again. Really motivating.

Why Not ?

Just right after I said it. How irony...

Regular round always rated.

yes!

Seriously though does anybody know what it means when "Submit already challenged", but it has clearly not been challenged by anybody else.

I was trying to hack skorpioas the whole time and it would not let me :( I tried both Chrome and Safari :(

Probably because they missed the registration, which ended 5 minutes before start of contest

train can go uptil 0 and s But the input constraints say current position is from 1 to s-1 So input position cannot be s

I was facing the same problem until I put endlines as they have done in the input. Also your constraints are wrong.

It was mentioned in the constraints that 1<=p<=s-1. Although the train can still go to point 0 and s, you cannot have those values as your initial position.

Oh right, I didn't see the constraint. Thanks everyone for clarifying

1. there are 4 odds (5, 7, 9, 1) but only 2 evens(6, 4).

2. it seems that it's valid.

Number of odd number cards should equal to number of even number cards

Well, you can upload directly from the problem's page.

I'm guessing its a glitch.
There were some reports yesterday about people who dropped below 1900 after the contest but still retained their colour.

Yesterday I got to green but my rating was still in grey. Some kind of bug I guess.

he gained the rating as well :)

It can backfire too

Sorry about that. I've registered as usual. I wrote to Mike. Hope he will fix it and there will be no rating changes for me. Also I didn't try to hack and no one hacked me.

100000 39 24855 75145

Yeah simulating the situation is pretty tough to implement but I'm not sure the intended solution is through simulation. I just used a bunch of if statements to solve it.

Exactly, It seems like more of math and less of logic , but yes i too want too learn how to solve such problems. I was thinking keeping this problem As Fast As Possible in mind but solution was a bit different.

I believe the idea is an event queue. When the tram passes by x₁ or x₂, we track that event.
So, we could have 2 event queues:

vector<int> event_time_x1;
vector<int> event_time_x2;

We are interested in events of second type event_time_x2, when tram passes by our target location. We just need to simulate tram's movement until we collect 2 events in the event queue event_time_x2.

After that we compare the times contained in the queue event_time_x2 with the Igor's time when he is just walking to the target. If event_time_x2[0] ≥ walking_time, then there is no point in taking tram at all. If event_time_x2[0] < walking_time, then we need to track whether it was possible for Igor to get on the tram before tram has reached the target at event_time_x2[0]. To check that — we need to find the time, when the tram crossed Igor's location x₁. If there was no event of crossing x₁ location before the event event_time_x2[0], then it was not possible for Igor to reach target location x₂ at the time the tram reached it event_time_x2[0]. After that, we check the second event.

I failed on test 18, but I believe that my idea is correct. Probably I had to collect 3 events instead of 2.

UPD: Yes, we need to store 3 passes of the tram: 23107366

Same with me :(

in C turns out you only need to consider 2 cases:

1. walk all the way

2. wait in x1 untill tram comes, then ride the tram

here is my ac code

http://mirror.codeforces.com/contest/746/submission/23108354

WA too tc 19 ):

WA on 23 :'(

Noo!! it's the case when they start in the same position! I am so stupid!

I also had troubles here. Test case 23 starts with the train and the person at the same square, so that you can board the train instantly.

So I would guess that you (like me) have a "> 0" in your code somewhere that should be ">= 0"

Haha, similar thing happened to me. A,B,C passed and D,E failed.

do you mean for F and G or the whole contest?

The same reason prevented me from even starting to implement C.

I had the exact same doubt.

Unsigned integer underflow

i = str.sz - 2 ; 

When str.size() = 1, then this value goes to a very large value.

Use this link: http://mirror.codeforces.com/blog/entry/49160

Use this link: http://mirror.codeforces.com/blog/entry/49160

Я просто зарегистрировался на контест как обычно. Написал Майку, надеюсь, пофиксят и рейтинг вернут. Никого не взламывал и никто не взломал меня во время контеста.

19 2 7 12

Use this link: http://mirror.codeforces.com/blog/entry/49160

Use this link: http://mirror.codeforces.com/blog/entry/49160