Search found 167 matches

by Ivan Golubev
Mon Nov 04, 2002 6:51 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14615

Try this input: 1 2 A 8:04 N 2 A 15:59 N 2 A 18:35 N 2 A 20:29 Y 2 B 10:28 Y 2 B 17:49 Y 2 C 6:57 Y 2 C 11:06 N 2 C 13:33 Y 2 C 14:25 N 2 C 21:34 Y 2 C 22:41 N 2 C 23:01 Y 2 C 23:21 Y 2 D 1:11 Y 2 D 18:50 N 2 D 22:33 Y 2 E 16:36 Y 2 E 17:09 Y 2 E 17:49 Y 2 E 20:39 N 2 F 0:20 N 2 F 7:01 N 2 F 8:08 N ...
by Ivan Golubev
Sun Nov 03, 2002 6:13 pm
Forum: Volume 1 (100-199)
Topic: 110 - Meta-Loopless Sorts
Replies: 92
Views: 7642

There can be input like:

Code: Select all

2

1
2
3
4

5
6
7
8
As I can understand your solution cannot handle such input properly.
by Ivan Golubev
Sun Nov 03, 2002 6:10 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14615

Your compare function looks OK.

"Active" means that we're need to output statistics for this team (all teams from 1 to max-in-input has this attribute).

So, I have no idea what's can be wrong in your solution. If you want I can send you my source code.
by Ivan Golubev
Thu Oct 31, 2002 8:47 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14615

If a team has submitted, but solved no problems, it should appear before the other who did not submitted? No. Do I increase the rank of teams with no submissions or they receive the same rank like the teams with same score? They receive same score. My sorting function looks like:[c]int tcompare(con...
by Ivan Golubev
Mon Oct 28, 2002 12:33 pm
Forum: Volume 4 (400-499)
Topic: 420 - Supercomputer Selection, The Sequel
Replies: 4
Views: 2136

Adrian Kuegel wrote:And by using this formula you get the value of the sample output.
Yes, you can get the same value as in sample output but you won't get accepted! ;-)
by Ivan Golubev
Thu Oct 24, 2002 7:41 pm
Forum: Volume 101 (10100-10199)
Topic: 10173 - Smallest Bounding Rectangle
Replies: 18
Views: 4570

mm.. I rotate it from -PI~PI using rotation matrix, inc theta by PI/1800 May be pi/1800 is not enough precise -- my solution starts from theta == 0.1 and searching for smallest rectangle. Then decreasing theta 10 times and seaching in smaller (founded) interval. This process appling several times a...
by Ivan Golubev
Thu Oct 24, 2002 2:03 pm
Forum: Volume 101 (10100-10199)
Topic: 10173 - Smallest Bounding Rectangle
Replies: 18
Views: 4570

Even wrote:is there always one side of input polygon be the same side of the smallest rectangle ?
I'm not sure about this. My accepted solution computes convex hull and then rotates it from 0 to pi/2 to find smallest possible rectangle.
by Ivan Golubev
Tue Oct 15, 2002 12:33 am
Forum: Volume 7 (700-799)
Topic: 759 - The Return of the Roman Empire
Replies: 15
Views: 9428

Actually it can be several valid Roman numbers for one Arabic number, for example, from P185: "Note that 299 could be written as CCXCIX or CCIC".
by Ivan Golubev
Sat Oct 12, 2002 11:07 pm
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 39725

Input:
4
1 2 2 3 4 5 5 6
1 5 1 1 4 2 0 0
0
by Ivan Golubev
Sat Oct 12, 2002 9:37 pm
Forum: Volume 3 (300-399)
Topic: 361 - Cops and Robbers
Replies: 50
Views: 14397

jpfarias wrote:if there are n >= 3 cops and all n cops are colinear, can a citizen be safe?
Yes, it can be safe.
by Ivan Golubev
Fri Oct 11, 2002 3:30 pm
Forum: Volume 7 (700-799)
Topic: 701 - The Archeologists' Dilemma
Replies: 43
Views: 28027

I don't remember exactly but main idea is to use logs. We're searching x, and there must be N*10^k <= 2^x and 2^x < (N+1)*10^k, k -- number of missed digits, so log2(N*10^k) <= log2(2^x) and log2(2^x) < log2((N+1)*10^k) log2(N) + k*log2(10) <= x and x < log2(N+1) + k*log2(10) With these "equations" ...
by Ivan Golubev
Sat Oct 05, 2002 10:25 pm
Forum: Other words
Topic: General maximum time limit of 5 seconds for online contests
Replies: 9
Views: 1790

But now default time limit is 10 seconds not 30, isn't it? As I can understand this applies to "normal" submitions and online contests. However I'm also can't realize why problem B has that large time limit. It was possible to make small judge input to run within, say, 5 seconds and reject brute-for...
by Ivan Golubev
Thu Oct 03, 2002 9:25 pm
Forum: Volume 101 (10100-10199)
Topic: 10192 - Vacation
Replies: 58
Views: 14346

Output "cities" in all cases.
by Ivan Golubev
Tue Oct 01, 2002 3:36 pm
Forum: Volume 100 (10000-10099)
Topic: 10034 - Freckles
Replies: 101
Views: 32329

Now it has multiple input, read the description.
by Ivan Golubev
Wed Sep 25, 2002 5:03 pm
Forum: Volume 103 (10300-10399)
Topic: 10364 - Square
Replies: 47
Views: 14811

I don't know how about 0.000 but I've got 0.010 with backtracking. Actually I've reused code for P307 (which looks harder than this problem).

Go to advanced search