Re: [gcj] Re: Finding another competitor on the score board?

[Bartholomew Furrow]

Luke, I'm glad you brought up what we were all thinking.

On Tue, Apr 10, 2018 at 3:53 PM Luke Pebody  wrote:

> I wholeheartedly agree with bringing back that feature. Otherwise if a
> contestant had written a solution in an outrageous choice of programming
> language, then written a python interpreter for that language, found it too
> slow and so written a C++ interpreter instead, what way would there be for
> that competitor to pointlessly show off and further inflate his/her ego?
>
> Also quite useful to see how the top competitors write solutions very
> quickly.
>
> On Tue, 10 Apr 2018, 8:36 pm Sid Vishnoi,  wrote:
>
>> On Saturday, April 7, 2018 at 7:14:57 PM UTC+5:30, meir wrote:
>> > I seem unable to find a way to look up another player in the scoreboard.
>> > I used to do this, to track both real life friends and other notable
>> competitors I become aware of.
>> > Is this feature missing from current incarnation? or am I just not
>> seeing it?
>>
>> It's missing. That was a nice feature. Lets request it back from the
>> feedback form they provided:
>> https://docs.google.com/forms/d/e/1FAIpQLSfE09X8Zdotkf8FYe-YczYs2eUBZtOC1yoxObpJrQiMAo0Qqg/viewform
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Google Code Jam" group.
>> To unsubscribe from this group and stop receiving emails from it, send an
>> email to google-code+unsubscr...@googlegroups.com.
>> To post to this group, send email to google-code@googlegroups.com.
>> To view this discussion on the web visit
>> https://groups.google.com/d/msgid/google-code/daa639ee-53bb-4ae4-ad6f-50d91e02%40googlegroups.com
>> .
>> For more options, visit https://groups.google.com/d/optout.
>>
> --
> You received this message because you are subscribed to the Google Groups
> "Google Code Jam" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to google-code+unsubscr...@googlegroups.com.
> To post to this group, send email to google-code@googlegroups.com.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/google-code/CAECKw-Onv%2BHSmAodm%3DJfPUeZkJJvV6qPSMTEoJ33Uh%3D9n1Zr%3DA%40mail.gmail.com
> 
> .
> For more options, visit https://groups.google.com/d/optout.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/CAHaiWHOn1C%3DX-AYhtTyfvjVMrc8dWVGhudZu_naO0zynsYaRtA%40mail.gmail.com.
For more options, visit https://groups.google.com/d/optout.

Re: [gcj] Re: Finding another competitor on the score board?

[Luke Pebody]

I wholeheartedly agree with bringing back that feature. Otherwise if a
contestant had written a solution in an outrageous choice of programming
language, then written a python interpreter for that language, found it too
slow and so written a C++ interpreter instead, what way would there be for
that competitor to pointlessly show off and further inflate his/her ego?

Also quite useful to see how the top competitors write solutions very
quickly.

On Tue, 10 Apr 2018, 8:36 pm Sid Vishnoi,  wrote:

> On Saturday, April 7, 2018 at 7:14:57 PM UTC+5:30, meir wrote:
> > I seem unable to find a way to look up another player in the scoreboard.
> > I used to do this, to track both real life friends and other notable
> competitors I become aware of.
> > Is this feature missing from current incarnation? or am I just not
> seeing it?
>
> It's missing. That was a nice feature. Lets request it back from the
> feedback form they provided:
> https://docs.google.com/forms/d/e/1FAIpQLSfE09X8Zdotkf8FYe-YczYs2eUBZtOC1yoxObpJrQiMAo0Qqg/viewform
>
> --
> You received this message because you are subscribed to the Google Groups
> "Google Code Jam" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to google-code+unsubscr...@googlegroups.com.
> To post to this group, send email to google-code@googlegroups.com.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/google-code/daa639ee-53bb-4ae4-ad6f-50d91e02%40googlegroups.com
> .
> For more options, visit https://groups.google.com/d/optout.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/CAECKw-Onv%2BHSmAodm%3DJfPUeZkJJvV6qPSMTEoJ33Uh%3D9n1Zr%3DA%40mail.gmail.com.
For more options, visit https://groups.google.com/d/optout.

Re: [gcj] The Qual Round is over!

[Bartholomew Furrow]

That's a good point about not being able to test your new solution on the
same input that you know you got right, Dmitriy. A few other thoughts:

- I don't know whether the UI makes this clear -- note to team, hopefully
there's a really clear indication that you still have points from previous
submissions -- but *you can't lose points you have earned on a visible
dataset*, no matter what you submit later.

- I agree that it isn't without penalty, but I don't think 4 penalty
minutes is a very significant cost. I also don't think there's anything
wrong with that cost being present.

- When writing an analysis, it's often helpful to first consider a simpler
version of a problem before you consider a more complex version. I believe
that's what they're doing here.

- Although there are a couple of things that make it less appealing -- lack
of ability to test on a Google-generated dataset, and the extra 4 penalty
minutes -- it's still totally reasonable to code up a solution that solves
the Visible and not the Invisible set. For example, what if you don't know
*how* to solve the invisible one? Or, as we've discussed here, what if
you're planning on submitting the Invisible set later if you get a chance?

Cheers,
Bartholomew

On Tue, Apr 10, 2018 at 1:21 PM Дмитрий Кузьминов 
wrote:

> Bartholomew: there is another concern. Let's imagine that I've solved the
> Visible dataset, and I know for sure that this doesn't solve the Hidden
> one. I submit the solution, I get the positive verdict, and I start the
> better implementation. In the old platform I can always compare the results
> that the old (less effective) solution produces with the results that the
> better solution gives me, and that comes for free: I don't need to spend an
> attempt with a penalty. Now it is not free. Moreover, I even don't know
> which attempt will be taken to score my visible dataset (shall I submit my
> correct solution for the second time?).
>
> Today we've got a Qual Round analysis, and the analyst still assumes that
> old rules are valid. Let's regard the "Saving The Universe Again": as usual
> we have a clue that if we know that "Since there is at most one C
> instruction in this test set, we can solve the two cases independently"!
> Who cares now of the solutions that doesn't solve both datasets?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Google Code Jam" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to google-code+unsubscr...@googlegroups.com.
> To post to this group, send email to google-code@googlegroups.com.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/google-code/3684c25d-ffce-4f4e-ae74-b82113e69d54%40googlegroups.com
> .
> For more options, visit https://groups.google.com/d/optout.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/CAHaiWHN2Sss%3DHpq-OgOhox3vFpZBb3zq29Xdgz%3DewSA8LCHGTA%40mail.gmail.com.
For more options, visit https://groups.google.com/d/optout.

[gcj] Re: Finding another competitor on the score board?

[Sid Vishnoi]

On Saturday, April 7, 2018 at 7:14:57 PM UTC+5:30, meir wrote:
> I seem unable to find a way to look up another player in the scoreboard. 
> I used to do this, to track both real life friends and other notable 
> competitors I become aware of. 
> Is this feature missing from current incarnation? or am I just not seeing it?

It's missing. That was a nice feature. Lets request it back from the feedback 
form they provided: 
https://docs.google.com/forms/d/e/1FAIpQLSfE09X8Zdotkf8FYe-YczYs2eUBZtOC1yoxObpJrQiMAo0Qqg/viewform

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/daa639ee-53bb-4ae4-ad6f-50d91e02%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[gcj] Re: Getting "Runtime error" as result but don't have a clue why.

[Anamika Mathur]

You are not checking for "WRONG_ANSWER" condition

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/f2bd75e8-83f4-4a36-9d88-0d36e47bd718%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[gcj] Re: Will common libraries be available?

[ghost9992706]

so are only standard libraries supported?

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/d717a3d3-190b-48f5-a61e-375085cc44a4%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[gcj] Why this code is wrong (practise session Q.1) - not accepted

[piyush ohri]

#include 
using namespace std;
int main()
{int t ;
 cin>>t;
 for(int i=0;i>a>>b;
 cin>>n;
 for(int j=0;j>x;
 if(x>b) cout<<"TOO_BIG"<

Re: [gcj] The Qual Round is over!

[Дмитрий Кузьминов]

Bartholomew: there is another concern. Let's imagine that I've solved the 
Visible dataset, and I know for sure that this doesn't solve the Hidden one. I 
submit the solution, I get the positive verdict, and I start the better 
implementation. In the old platform I can always compare the results that the 
old (less effective) solution produces with the results that the better 
solution gives me, and that comes for free: I don't need to spend an attempt 
with a penalty. Now it is not free. Moreover, I even don't know which attempt 
will be taken to score my visible dataset (shall I submit my correct solution 
for the second time?).

Today we've got a Qual Round analysis, and the analyst still assumes that old 
rules are valid. Let's regard the "Saving The Universe Again": as usual we have 
a clue that if we know that "Since there is at most one C instruction in this 
test set, we can solve the two cases independently"! Who cares now of the 
solutions that doesn't solve both datasets?

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/3684c25d-ffce-4f4e-ae74-b82113e69d54%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Re: [gcj] The Qual Round is over!

[Bartholomew Furrow]

For me the issue is whether we're looking at something closer to 1e7 or 1e9
operations per second, which has a pretty significant impact on what
algorithms can work to solve a problem.

On Tue, Apr 10, 2018 at 1:13 PM  wrote:

> Actually you can figure out for yourself without running the code if a
> idea will got TLE or not. It is normally if you know the complexity of your
> solution and compare it to problem restriction. For example, it is
> obviously that O(T * n^2) will got TLE in Trouble sort problem, because the
> size of array might be up to 1e5. And this means that your solution needs
> to do 1e12 operations in order to solve the entire set, in worst case. A
> normal computer can hold ~1e7 operations per second. And 1e12/1e7=1e5
> seconds...but the limit was 20.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Google Code Jam" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to google-code+unsubscr...@googlegroups.com.
> To post to this group, send email to google-code@googlegroups.com.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/google-code/8bee126a-8c6d-4e3a-9e6e-d24906f54f3c%40googlegroups.com
> .
> For more options, visit https://groups.google.com/d/optout.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/CAHaiWHOyLBAk8cv6gtqiibT%2BTfXgXZFzgAZyLes8yGeh9NGa2g%40mail.gmail.com.
For more options, visit https://groups.google.com/d/optout.

Re: [gcj] The Qual Round is over!

[ninicu . cristian97]

Actually you can figure out for yourself without running the code if a idea 
will got TLE or not. It is normally if you know the complexity of your solution 
and compare it to problem restriction. For example, it is obviously that O(T * 
n^2) will got TLE in Trouble sort problem, because the size of array might be 
up to 1e5. And this means that your solution needs to do 1e12 operations in 
order to solve the entire set, in worst case. A normal computer can hold ~1e7 
operations per second. And 1e12/1e7=1e5 seconds...but the limit was 20.

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/8bee126a-8c6d-4e3a-9e6e-d24906f54f3c%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[gcj] Re: The Qual Round is over!

[Ki Chun TONG]

On Monday, April 9, 2018 at 2:29:36 AM UTC+8, newbie007 wrote:
> Usually in the qualification round the first two problems are simple and with 
> no tricks.
> 
> I got A and B correct for the small data sets, so I assumed it was fine.
> 
> But then wrong for A large and time exceed for B large. Oo
> 
> Probably I was too careless, but I think CodeJam missed the qualification 
> round purpose this year.

I agree that the first two problems should be simple and straightforward, but I 
believe that A and B this year is nothing beyond that. The B of 2015 
Qualification Round, for example, is in my opinion much harder than these two.

To put it simply, the A this year is just a bubble sort with some counting 
arrays. The B requires the realisation that there are essentially two 
independent arrays, one even index, another odd index. Sort them with the best 
algorithm you have (it doesn't even have to be stable), compare against each 
other and you're done.

The C this year, is surprisingly very easy if you take the time to read the 
lengthy problem description (to a certain extent easier than A and B because 
the limit is too forgiving to be challenging). You only need to stay on the 
same row, wait for the 9 farms to be digged, then you increment the column by 3 
until it tells you the answer has been found.

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/73381f0d-adeb-4a24-9763-4ee991e62818%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[gcj] Keeping old rounds open for training?

[Rui Gonçalves]

One strength of the old contest format was that it's very easy for you to keep 
the judge system up and running after the contest - it just needed to provide 
small and large inputs and check that the uploaded solutions match the correct 
answers.

What will you do in this new contest format? Do you plan to keep the judge 
running for previous rounds (practice and qualification sessions), just like 
Codeforces and other competitive programming websites do? I'd be very 
disappointed if I stopped being able to train with old rounds or improve my 
submitted solutions.

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/0c294450-0fb4-46cf-a05f-495e640aa2fb%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.