If the rules have not been updated recently, people from Div.1 only are able to create groups. You'll have a Create group option in the Group section once you acquire the ability.

Using ideone is not the problem here. The problem is, if your code is public in ideone, someone might copy that solution without notice. Read the blog I linked above for better understanding.

Or did you use ideone (story)?

According to this post: Participants from the first division can participate out of competition.

Can't register. Showing "rating should be 0...1899 to register ..."

Keeps loading forever in Safari. Working fine in Chrome though.

Why don't you just google it?

No. I've found at least 6 solutions doing this, in my room :|

Maybe there is restriction on age. Keep that in mind too.

He saw your code, understood it was for problem A of today's round and submitted your code faster than you! scary :|

Recently saw a blog about c++14 being slow for scanf,printf. Didn't expect it to be faster in case of cin,cout!!
And about c++11: putting cin.tie(0), cout.tie(0) passes some more cases, still TL at test 29.

check this

Why u do this man? Even downvoting required effort :|

Last year I've been < 50 and < 100 few times, one of my friends was 20th in some round. Yet no call :P

Scanning once like this is not enough. Do the whole thing again and again until no more updates can be made. It requires 2-3 iterations maximum to settle every cell.
Edit: I made that mistake. Though I don't know if you have the same problem, give it a try.

Did that in last minute but failed systest because of integer overflow -_-

Try with scanf once instead of cin.

Can you share your idea?

Let A<=B<=C. My solution is O(C-B) and it passed system test in 1.8s :|
In practice session though :(

Frustrated about GCJ Round 1A? Wondering if lack of Ahmed Aly did this :|

Thanks. It's better than the editorial. To me at least.
BTW you can insert new line by typing < br > (without spaces).

This link takes everyone to their own hack section, not yours.

You could've done better if you didn't forget to seal your AC xD

Code until you go bald :P

What about live scoreboard?

And problem statement clearly said that- Vladislav drew a graph with n vertices and m edges containing no loops and multiple edges.,
I mean if we combine "u!=v" and the above statement then this problem becomes something else. So what nighthowler said makes sense.
UPD: Looks like i messed up "loop" with "cycle" in graph. Thanks to Swistakk for correcting.

Don't forget to try your case at "custom invocation" first.

That constrain was totally deceiving >_<

Why didn't you say anything about top 200 getting T-shirt? :/ I think that would have drawn more attention.

i'm in

I couldn't open the challenges page, so clicked "try next challenge" after solving the second one & got the hardest problem(shortest path revisited) as third -_-

Yes it is. We did that.

no

Read previous comments above or editorial. DP won't pass.

I don't know the details of these but when u have to take too many inputs or output too many things, try using cin.tie(0) or cout.tie(0) for faster results. If in doubt, just go for scanf printf. That's what i learned (in the hard way of course).

I've iterated 500 times & got AC. Try using std::ios_base::sync_with_stdio(0);cin.tie(0);

222 is almost same as this one

I've been using this code and got AC in several problems. So your comment is kind of frightening ! :| Can you point the error out (& correction if possible)?

Try custom invocation. Miraculously it gives correct ans for this and all other cases -_-

ignore.
didn't read the complete editorial.

I've solved it using multiset link
so multiset might not be the reason for TLE

I've used similar idea. But couldn't find bug in your code. See if this helps

You are right. My code runs as expected after taking input as int array instead of double. Thanks. Learned sth new :)

Has anyone else notice that ios_base::sync_with_stdio(0);cin.tie(0); is not working(almost) anymore in CF?
I've seen cin,cout is slower in CF comparing to other judges. But this much? My B was a narrow escape.
using scanf 155 ms
using cin 904 ms
Is this because of some recent changes in system or it was always like this and i never noticed?!

Don't just wait. Look around :)

I was going to hack a O(n³), then thought of running simple addition 2000^3 times in custom invocation and it took .7s. I was like "brace yourself, something terrible is coming :|"
10^8 iterations theory doesn't apply to CF

Is a O(n³) solution worth 2000 points? Seriously?

I thought xor was way slower than & | operators. Seems i was wrong. Thanks for pointing out. I should have said % instead of ^. i'll update that comment

It depends on the type of computation you are doing. For example, 10^9 + or — or ifelse may pass in 2 seconds but if you are doing * or / or % then you might be in danger. If you really need to depend on such a solution, you can always try "custom invocation" to test how your solution acts on big tests (in CF of course).

These are valid test cases. If you are talking about hacking, u need to put a newline at the end.

Maybe it came from Doraemon :P

What i'm saying is, in div2 only contests,there are around 1000 participants to make unnecessary submissions in worst case (as their ratings are not affected) but in div1 only, this number could be 4times bigger

This is just a hunch.
If they allow div 2 participants to take part unofficially, there might be too many submissions for the servers to run the contest smoothly.

I didn't know that the commands are different for windows and linux, i'll update the title. If what [user:wild93] says is correct, then you can add that command in place of WI,--stack... that should execute the command every time

You should not ask for the solution of a problem from a running contest. Try yourself or wait for the contest to end.

interesting problems. though i could solve only the first two :|

i was wondering about cases like:

1 2 1 2

first query: 1 4

next query : 2 4

for this keeping maximum frequency seemed troublesome but now i realize it's easily possible using the "suf" array you mentioned!

then how to find max frequency in O(1)?

maybe u can maintain tow maps. one for counting frequencies and the other is for counting occurrences of that frequencies. for example if u have an array like this:

1 2 1 1 2 3 3

map1[1] = 3

map1[2] = 2

map1[3] = 2

map2[2] = 2

map2[3] = 1

when u access out of bounds of an array, it's not defined in c++ what will happen. undefined behavior

i got the input file when only 10 seconds were left & couldn't submit ultimately. i've sent feedback immediately but as this happened at the last hour, i'm afraid i will be asked to submit the source code before the round ends. what do i do? :/