Search found 12 matches

by Zhou Yiyan@SHU
Thu Jul 22, 2004 4:06 am
Forum: Volume 104 (10400-10499)
Topic: 10401 - Injured Queen Problem
Replies: 19
Views: 10526

Thank you, sidky! I have make out the table and solve the problem. It seems that table memorization would be more preferable when solving counting problem rather than using traditional backtrack algorithm. :D
by Zhou Yiyan@SHU
Wed Jul 21, 2004 12:59 pm
Forum: Volume 104 (10400-10499)
Topic: 10401 - Injured Queen Problem
Replies: 19
Views: 10526

I can't make out a quick method to get the answer. Normal backtrack algorithm just got TLE all the time. Is there some restrict condition to make the search faster?
by Zhou Yiyan@SHU
Wed Jul 21, 2004 12:51 pm
Forum: Volume 104 (10400-10499)
Topic: 10440 - Ferry Loading II
Replies: 10
Views: 7703

:oops: I still couldn't believe it has such a simple solution... though I got AC. It seems that I have to look back to my student book about greedy algorithm...
by Zhou Yiyan@SHU
Wed Jul 21, 2004 4:47 am
Forum: Volume 104 (10400-10499)
Topic: 10440 - Ferry Loading II
Replies: 10
Views: 7703

10440 - Ferry Loading II

10440 Ferry Loading II seems to be a search and optimization problem, but to my surprise, many solution only spent very little time. Is it a DP problem? I can't fnd the quick method, got TLE...and maybe WA that I don't ever know...
Could somebody give out some hint to solve the problem?
by Zhou Yiyan@SHU
Mon Jul 19, 2004 3:07 am
Forum: Volume 105 (10500-10599)
Topic: 10593 - Kites
Replies: 18
Views: 7034

Would O(n^3) be enough to solve this problem?
I couldn't make out a more effective way... :cry:
by Zhou Yiyan@SHU
Sun Jul 18, 2004 12:54 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 33776

That's right. Repeatedly prime test would be a much more time consuming stuff. Avoid this would save a lot of time.
by Zhou Yiyan@SHU
Sun Jul 18, 2004 12:28 pm
Forum: Volume 105 (10500-10599)
Topic: 10534 - Wavio Sequence
Replies: 44
Views: 8439

Thank you!

Finally I got accepted...
Yeah, you are right about that.
I didn't understand the problem statement clearly.
Thank you for the help.
by Zhou Yiyan@SHU
Sun Jul 18, 2004 8:52 am
Forum: Volume 105 (10500-10599)
Topic: 10534 - Wavio Sequence
Replies: 44
Views: 8439

I used LIS of O(nlogn) version, but still WA

I have read all the posts about 10534, and used double LIS of O(nlogn) version, the bi_search also have been tested. But it still got WA, can someone tell me what's wrong with my code?
[cpp]
code deleted
[/cpp]
by Zhou Yiyan@SHU
Tue Aug 06, 2002 12:24 pm
Forum: Other words
Topic: Can't receive any replys from the judge.
Replies: 2
Views: 1840

problem solved

It was my email problem. I ahve changed it and received the replys from the judge. Thank you.
by Zhou Yiyan@SHU
Tue Aug 06, 2002 3:27 am
Forum: Other words
Topic: Can't receive any replys from the judge.
Replies: 2
Views: 1840

Can't receive any replys from the judge.

Since Aug 3, I haven't received any reply from the judge of my summissions. Why? I got several compile error bu I don't know what's wrong. What happened?
by Zhou Yiyan@SHU
Tue Aug 06, 2002 3:14 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 24417

I change double to integer to make it work without floating_point error but failed. It still got error, but why??? [cpp] #include <stdio.h> #include <math.h> #define max(a,b) (((a)>(b))?(a):(b)) #define min(a,b) (((a)<(b))?(a):(b)) #define maxint 2147483647 #define dead 1e-15 #define abs(a) (((a)>=0...
by Zhou Yiyan@SHU
Tue Jul 30, 2002 9:35 am
Forum: Volume 7 (700-799)
Topic: 707 - Robbery
Replies: 12
Views: 6960

707

The problem description says, "Assuming that the robber can move at most one unit per time step". Then could the robber stay at one place for some time steps if there is no other way to go? If I find two available routes for robber to move, should I output "Nothing known"? B.T.W [cpp]3 1 4 3 1 1 1 2...

Go to advanced search