COJ Forum

hmmm, I'm still waiting for your response, I know maybe you have no time for this, so just sending me the test cases wouldn't be so harmful after 2 months waiting, BTW why the coj-forum server had been down for so long?
Thank you xshaka

The comparing function between groups asures that... Thanks...

ok, thank you, here you have it... #include <cstdio> #include <list> #include <set> using namespace std; const int MAX=100001; struct group{ int arrival, dest, size; }; bool operator<(const group& a, const group& b) { if(a.arrival!=b.arrival)return a.arrival<b.arrival; return a.size<b.size; } multis...

Does anybody else have something to say, as far I imagine, there are no dark points in my approach, I can guess that the "public" approach is the same, so what's the explanation of the WA? I would post my code here, but I know it's forbiden

Well, sorry for answering so late, my approach is just to simulate it, bus by bus, using some STL structures to make it faster, it's a bit error prone, but I've checked it more than once. Any clue on where my mistake could be?

Oh, sorry, itś just I had a feeling of another spammer in the forum, then itś alright. The problem is that it was annoying to see a recent topic in the 24th page, so that nobody would be able to read it again... You should put all those posts pointing each problem to the back of the forum. BTW can t...

Anybody???
BTW who is dovier and what's the point on posting a link to every problem????

Yep, you should infer that from the problem 1381 Fast Fly

http://coj.uci.cu/24h/problem.xhtml?abb=1571 I've seen many wrong answers to this problem, many of them in the test case 9, so it seems there's something weird here, so I ask for the admins to give at least an insight of what's wrong with that test case, or are the data tests wrong? I guess this pr...

Assume it starts from the left cycle...
PS: It's the same answer no matter the start point, or isn't this a symmetric situation??