OJ Board

Your use of looks suspicious to me. You can enter a node with different minutes in hand - but i think your program will not consider all of them.

I can't see why I am getting WA. I tried to read the older post and got more confused. Am I missing something or there is something stupid with the dataset? #include<cstdio> #include<sstream> #include<cstdlib> #include<cctype> #include<cmath> #include<algorithm> #include<set> #include<queue> #includ...

I made the same mistake, and even some more! I should have been more careful while building the graph. X( Here are some IOs. 4 5 1 *#*~. .@*## **#.# .#~#~ 13 3 1 .*@ #.# .## #.# *@~ #.@ @** @#* @.* ~@@ #~# .#* *.@ 6 5 1 @@~~* ..*.@ ~#@#. ##~~@ ##*@* @*@#* 5 7 2 @.*~~.@ *@~@~~. @@.@@## *~@@@#@ ..~~~#...

Another important thing to notice is that, at a time there will be at most 5000000 problems in the merged problem bank & at most 100000 problems in any other bank

Does that mean, I will not insert any more problems in the bank if it already has 100000 problems ?

i think you have given one extra output.
there are nine cases in your input.

for this input 3 3 5 5 1 10 the output should be Case 1: Closest sum to 10 is 10. not this Case 1: Closest sum to 10 is 8. and after correcting that your code will fail for this 3 5 6 5 1 20 which should be Case 1: Closest sum to 20 is 11. :) Best wishes! EDIT :: even if your program outputs 8 for t...

i checked your program in my pc with all possible inputs. and after comparing with my ac program's output, my judge program printed
which astonished me! i am not sure why its not working in judge.
i used devcpp, and it works fine in my pc.

i tested your program against my program for these inputs 2 -3 15 8 18 2 9 2 4 1 60 1 111 111 your program gave these outputs Case 1: 4294967294 Case 2: 65537 Case 3: 131073 Case 4: 257 Case 5: 5 Case 6: 1 while they should be Case 1: 1 Case 2: 64897 Case 3: 8361 Case 4: 109 Case 5: 4 Case 6: 60 if ...

my AC code prints 0 for that case.
i got a lots of WA for not using long long. int overflows.
and that input made me nuts for a while!

i wasted half an hour in rio's 6th case 5 XX#.B #X##A # ##C #.... ##### (with an unwanted space instead of '.', which was not supposed to be there) till i understood whats going on! it should be 5 XX#.B #X##A #.##C #.... ##### yeah, it clogged up what i was doing with cin , and really crushed my spi...

just needed to tell you that there wont be any test case like
it will be given like this so dont worry about this type of case!

thanks!
i thought "how many valid words are there in the input"

edit : but you are telling me about probability, but they have a formula and a definition for SBC and thats different

u will get wrong answer because u misunderstood the problem. In this problem u have to calculate the SBC of all the words which start with the same latter as given word( with the same length ) then find the average and have to determine the given words SBC is "below" or "above or bel...

anyone getting confused with the problem statement and misof's definition, plz just re-read this lines, you'll get everything at a glance! ... we find many of the editors and spreadsheet applications using colors or emphasized fonts to show the nesting of the parenthesis structure... .... We may not...

I feeling sorry for you.. Caio Abrantes, mikehammer and cryu! and i really fear that no one can help you with it! :( i used to got a lot of invalid memory ref in this problem that i throw it away for months and suddenly oneday i found changing just one line gets ac.. all i can do for you is - re wri...