Search found 100 matches

by DJWS
Tue Mar 20, 2007 4:25 pm
Forum: Bugs and suggestions
Topic: 270 Format
Replies: 4
Views: 2327

One more thing. Although I can't lookup the submission id currently, I can remember that a few of my submissions get WA within 0.002 seconds. And that is the main reason causes me to suspect the input format. Fortunately, everything seems okay now, but you can examine the last WA submissions for det...
by DJWS
Tue Mar 20, 2007 4:11 pm
Forum: Bugs and suggestions
Topic: 270 Format
Replies: 4
Views: 2327

I re-submitted my code just before and got AC. Everything seems okay now. Maybe my mistake. :-? I'm sorry. Here is a part of my code, which is for reading input: int main() { int cs; // number of input cases cin >> cs; cin.getline(s, 100); cin.getline(s, 100); // for first blank line while (cs--) { ...
by DJWS
Tue Mar 20, 2007 11:57 am
Forum: Bugs and suggestions
Topic: 270 Format
Replies: 4
Views: 2327

270 Format

I just found that there are some redundant characters (spaces?) between the input data sets. Eh, I confront such problem for the first time. Is it some sort of blank line? :-? The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of th...
by DJWS
Mon Mar 19, 2007 10:06 am
Forum: Bugs and suggestions
Topic: 242
Replies: 1
Views: 1723

242

According to the problem statement, the problem has multiple solution. But, in the problem list of volumn II, the problem was marked as a red flag. It needs corrected. :) If multiple sets in a sequence yield the same maximal no-gap coverage, have the same number of denominations, and have equal larg...
by DJWS
Wed Feb 07, 2007 10:26 am
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32127

Re: get AC

The best cpu time of this problem is near 1sec, so I think it will be hard to avoid TLE using STL. I modified xlspace's code and got AC in 3.787 sec. It's possible to get AC using STL. :) I get AC now, first I not use substr function in string second , I use pair<unsigned int, unsigned int> to repr...
by DJWS
Mon Feb 05, 2007 6:34 am
Forum: Bugs and suggestions
Topic: users' nickname
Replies: 7
Views: 2872

http://acm.uva.es/problemset/statusjudge.php?h=5312661
I guess sa072686 is concerned about this. :)
by DJWS
Tue Jan 09, 2007 11:06 am
Forum: Bugs and suggestions
Topic: turnning-page links in the personal submission status page
Replies: 2
Views: 1997

turnning-page links in the personal submission status page

Here is my personal submission status page: http://acm.uva.es/problemset/statusjudge.php?h=5153584&r=60&c=16&u=27931 The link "next 16" below the web page just simply add the submission id by 16, and it does not show exactly the next 16 submissions of mine. At least the link "pervious 16" works well...
by DJWS
Mon Oct 16, 2006 7:54 am
Forum: Algorithms
Topic: How To Compute Shortest Distance Between Two Lines
Replies: 5
Views: 2556

http://softsurfer.com/
This website contains a lot of algorithms about computational geometry.
You can search in this site and see what you want.

Here is a related problem in uva: 10514 River Crossing.
Give a try. :D
--
DJWS, a newbie in programming :wink:
by DJWS
Mon Oct 02, 2006 6:09 am
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32127

Hi.
Could anyone help check the output of these cases?
2 ababcdcd
2 cdcdabab
10 a
1 a
--
DJWS, a newbie in programming :wink:
by DJWS
Wed Sep 27, 2006 9:46 am
Forum: Volume 107 (10700-10799)
Topic: 10798 - Be wary of Roses
Replies: 58
Views: 19941

Hi,
What is the answer of this case:

Code: Select all

5
RRRRR
RRRRR
..P..
.....
.....
Is it 1? Or 2?

--
DJWS, a newbie in programming :wink:
by DJWS
Thu Aug 31, 2006 8:39 am
Forum: Volume 106 (10600-10699)
Topic: 10682 - Forró Party
Replies: 14
Views: 9060

About one year is past. Here is the verified input from yours. (I just modified the road number.) 2 a b 20 b c 19 a c 2 a b 20 b c 19 c a 5 a b 10 b e 10 e d 10 a c 10 c d 10 a d 5 a b 10 b e 10 e d 10 a c 10 c d 10 d a And here is the output. No valid route. c b a a c d d c a -- DJWS, a newbie in p...
by DJWS
Wed Aug 30, 2006 5:52 pm
Forum: Volume 8 (800-899)
Topic: 870 - Intersecting Rectangles
Replies: 8
Views: 5352

EDIT:
I misunderstood the problem statement. AC now. :D
Thank for Darko's help.
--
DJWS, a newbie in programming :wink:
by DJWS
Wed Aug 30, 2006 6:24 am
Forum: Volume 8 (800-899)
Topic: 870 - Intersecting Rectangles
Replies: 8
Views: 5352

I have no idea why getting WA. :(

Is it right?

Code: Select all

friend bool intersect(const Rect& r1, const Rect& r2) {
	if (r1.x1 > r2.x2 || r2.x1 > r1.x2) return false;
	if (r1.y1 > r2.y2 || r2.y1 > r1.y2) return false;
	return true;
}
--
DJWS, a newbie in programming :wink:
by DJWS
Tue Aug 29, 2006 10:50 am
Forum: Volume 8 (800-899)
Topic: 870 - Intersecting Rectangles
Replies: 8
Views: 5352

It's the only thread. Thus I post here.

Please help verify this test data:

Code: Select all

2
2
1 1 2 2
2 2 3 3
2
1 2 2 3
2 1 5 4
Thanks a lot!
--
DJWS, a newbie in programming :wink:
by DJWS
Mon Aug 28, 2006 4:43 pm
Forum: Volume 109 (10900-10999)
Topic: 10949 - Kids in a Grid
Replies: 30
Views: 11895

Unfortunately, most papers I have found don't mention how to get min(m,n-p) time per contour - they just state it as fact. (Getting O(m) is really easy, though). I agree you. Maybe there is a way to satisfy that condition, but having no idea about it now. Keep discussing anyway. :) And I don't know...

Go to advanced search