OJ Board

TimeString

can anybody explain the problem statement?
can more than one path lay on two points?
can one path connect a point itself?

TimeString

If the judge data is the same as the original contest data, I think it is wrong: The forth case is: 1 5 0 1 0 0 0 0 0 0 1 1 1 2 10 0 0 5 0 0 5 This means that before the exchange Alice has 100, Bob has 100 and Cynthia has 25 crowns. Since Alice has to pay Bob 1 crown, and Bob has to pay Cynthia 5 c...

TimeString

i think each set of input of first line may contain a float number, not an integer number, i.e. the degree of polynomial may give like 3.0 .
i use scanf("%d") and get TLE, but use scanf("%s", word) and n = atoi(word) get AC.

TimeString

getting wrong answer a lot of times and finally ACCEPTED!!! i think it is a normal bfs problem but the starting time doesn't have a range, namely the starting time can be very large, more than 24, so after you read the starting time, you need to mod 24 , and then judge wheter it is <=6 or >=18. if s...

TimeString

the problem says the operation mod should exactly follow C language, so you needn't to determine whether a number is positive or negitive.

but when you have to determine a number is odd or not, use should carefully use mod operation, because a negative odd number mod 2 returns -1.

TimeString

rio wrote:Send a code with commenting out below part.
Code: Select all
            if(t>dp[i])
               dp[i]=t;
            if(dp[j]>dp[i])
               dp[i]=dp[j]; 
You could guess why its getting TLE.

i still don't know why.
does it mean that it costs a lot of time to do float number comparison?

TimeString

rio wrote:You code has a bug. You didn't initialize erate[0], but using in
I sent a code which initialize erate[0] with 1e9 and it got WA in 0.060 s.

thanks a lot.
but i think the bug will lead to runtime error or wrong answer, not time limited exceed = =||

TimeString

#include <stdio.h> int main(){ int en; double erate[400]; int i,j; double dp[400]; while(scanf("%d",&en)==1 && en>0){ for(i=1;i<=en;i++) scanf("%lf",&erate[i]); dp[0]=1000.0; for(i=1;i<=en;i++){ dp[i]=0.0; for(j=0;j<i;j++){ static double t; t=dp[j]/erate[j]*0.97*...

TimeString

i use O(n^2) solution but seems it does not expected, i got TLE.
it's very strange because the limit of n is 365, so i just want to check do i really have to implement an O(n) solution?

TimeString

"However its(queen's) powerful attack can be blocked with a Pawn, just like chess on Earth"

what does it means? can anybody explain? thanks ^^

TimeString

although i have accepted this problem, but i wonder what's the bug in my previous code. #include <stdio.h> #include <stdlib.h> long long int en,em; int mod(long long int n,long long int m){ if(n>0) return n%m; else return m-(-n)%m; } int cmp2(long long int a,long long int b){ if(a<b) return -1; else...

TimeString

why is the output for "bubu" is "below" ? First thing we should consider is how many vaild words are there? The problem says the first letter is the same as the given word, second and fourth letter have 5 choices separatedly, and the third letter has 21 choices. So total possibl...

TimeString

If there is empty line do you automatically output "wrong" ?? Yeah, it should print "wrong". Here are some I/O. Hope it helps. Input: 1 2 1 1 2 1 1 1 2 2 1 1 1 2 2 1 2 2 1 1 1 2 1 2 3 1 1 1 2 1 3 2 1 2 2 2 3 3 1 1 1 2 1 3 2 1 2 2 2 3 3 1 1 1 2 2 1 3 3 3 2 2 3 3 1 1 1 2 1 3 1 1 1...

TimeString

Finally, I get AC :D I use a lot of OLE and get some conclution: (In one case...) - A line may not contain exactly 2*N numbers, maybe less than it, maybe more than it. Moreover, it is possible that there are no numbers in this line!! So if you use C or C++, you'd better use gets(). - Although you do...

TimeString

shakil wrote:Why WA???? i can not find any problem. Please help.....

Try this:

Code: Select all

Correct answer is:

Code: Select all

108108
110110
108108

OJ Board

Search found 26 matches

11414 - Dream

Re: 11366 - Circle of Debt

930 - Polynomial Roots

it is an unavailable input = =||

11285 - Exchange Rates

long long int get WA ??

Re: still get WA