This is not your problem!

That's why you have to respect this simple rule : "You may edit your comment only for fixing grammar mistakes or small changes. Do not change the main idea of your comment."

Hope all.

НИчем не хуже и запятая перед "ребята".

Сомневаюсь, что человек с именем Роман Фурко китаец.

let me play for you. :D

This is life.

What kind of help do you expect?

So...please the judge system good luck and don't have fun ....please this round can be rated....I want to be rated!!

Переходи к нам (div 2), будешь чаще соревноваться -)

Ты бы еще егэ порешал, вот веселуха!

Тык.

Нет никаких ограничений! Лишь одна помеха- разные часовые пояса.

Good luck.

P.S: Your Captain Obvious

Not so "heavy" loaded. April fools day contest has 3200 registered user, and #175 has just a little more than 3000.

hv?

Нет, потому что учитывается только последняя попытка, прошедшая претесты. Сами посудите: например, вы отправили решение, оно прошло претесты. Потом вы поняли, что решение лажовое, исправили и переотправили. Почему вам должны возвращать баллы?

hmm... i'm pretty sure that you writed this contest from this account http://mirror.codeforces.com/profile/kingofnumbers2

I think, this one is worse:

my submission 3800641 came pretty close to TLEing too.....thankfully it didnt exceed 2 seconds! :)

I was going to ask the same question!

dp[i][j] = minimum cost to repair j holes from the first i holes Complexity: O(N^3)

dp[i][j] = minimum cost for fixing j holes out of first i holes.

dp[i][j] = min(seg.cost + dp[i-seg.size][j-seg.size]

where seg = {l,r,c} and all seg.r == j

I didn't submit as I was a minute late, but I believe it to be correct.

UPD: Nah, not correct logic, small modification required to it.

This is my idea but my code wasn't right for samples: First I define dp[i][j][k] = minimum const to fix at least k holes in j first holes using first i companies. while companies are sorted by their right points. And the update: dp[i][j][k] = min (dp[i — 1][j][k], dp[i — 1][j — (j — company[i].left + 1)][k — (j — company[i].left)] + company[i].cost)

I saw that the difference between second and third dimensions of dp is always the same, so I omitted third dimension. And so this dp is my solution: dp[i][j] = minimum cost to fix at least j — n + k holes in first j holes using first i companies while companies are sorted.

Is this solution right ? :-?

Очень походит на SRM 578 Div.2 — 1000 http://apps.topcoder.com/wiki/display/tc/SRM+578

Such test are included to pretests.

I think it's 100% unfair. Quick-sort is the same for every language, Java probably have more overhead, but again — I think it's unfair.

http://docs.oracle.com/javase/6/docs/api/java/util/Arrays.html#sort(int[])

The sorting algorithm used in Java for Arrays.sort(int[] arr) is tuned quicksort which offers very good average case performance.

Many contestants used Arrays.sort() today for problem C and have passed System tests. I think if the solution fails, the problem lies elsewhere.

Big number of testcases for problem C, I guess. Also, contest is merged for both divisions, so there is a lot of participants => solutions to judge

and a lot of submit in contest

Ask messi. He is best ;)
EDIT : I thought there are more FC Barca fans than others in CF and I'll get pluses. 8)

It's funny. My O(N^4) passed.

Sometimes the speedy inner loop is more important than the asymptote. I wrote carefully to eliminate 31/32 of the transitions in the dp without computing them.

haidora1, I think that the cycles

for(int n = 1 ; n <= N ; n++){
for(int k = 1 ; k <= n ; k++){
for(int i = 0 ; i < f[n].size() ; i++){
for(int h = n ; h >= 0 ; h--){
...

if f[N].size ~ M , give you O(N³ + MN²) .

The Time limit is enough, those codes probably used slow input methods

Why lol?!!

Can't agree more. The same algorithm runs in time if coded in C++, but in python it gets TLE. This happened in problem C for many Contestants.

Python is easier to write correct code in than C++.

The syntax is simpler, the edge case and corners are less likely to cause you trouble, the array bounds are checked so that errors show up right away, debugging and tooling is better, Python has a repl so you aren't always compiling-testing-compiling-timing just to try an idea, and you don't have to worry about static type declarations. C++ is a pain with cruft from legacy implementations, the syntax is verbose and cryptic, the template system is full of hidden troubles waiting to bite during a contest, and even the compiler error messages are indecipherable.

But C++ runs about ten times faster than Python.

So there are advantages and disadvantages to both. You are allowed to switch languages between problems. You can even pick your algorithm and then choose your language for each problem based on speed and convenience.

Being able to choose wisely is part of competing here.

Or just increment the time limit for certain languages

So… You have a job, your boss gives you a task and you implement it in Python. Everything is great, until customers start complaining that they have to wait minutes for your software to run. But you don't see it as a problem and tell your boss: "I know, it's Python, just tell them to wait more!" Does this sound realistic?

In my opinion, programs should be judged against real-life criteria, such as real running time and memory usage, not against arbitrarily chosen adjustments so that "different languages are equal". This is fair, and treating programs in different languages differently is not fair. If your language fails to be on par with others, then it is the language's fault, not Codeforces' fault.

It is about using the right tool for the job. C++ and Python have their advantages, and also have their disadvantages. C++ is fast, but hard to program in. Python is easy, but slow. You consider both options (which is more important — short code or fast code?) and choose the better tool in order to achieve a better result. If you knowingly chose the inferior tool, then it is your mistake and you will get penalized for that.

Now, here you might say that you had no idea your Python code would run so slow. But this is just a part of the learning process — you tried it and received negative feedback, and this will affect your future decisions (you will likely choose not to do the same thing again).

http://mirror.codeforces.com/blog/entry/102

thats really mysterious....u should probably report this issue to the admin with the above details.

Probably the way they measure the runtime of a code is not smart enough. Report it so they can do something about it, if possible. Not only your particular case but in general.

TLE code : 3799383 AC code : 3804162

Try resubmitting the exact same code that gets you TLE again. It could get AC now. A lot of participants have had this problem today. If so, I think you should report this to the authority.