## Search found 15 matches

Thu May 14, 2015 2:43 pm
Forum: Volume 2 (200-299)
Topic: 204 - Robot Crash
Replies: 26
Views: 5824

### Re: 204 - Robot Crash

I think I am also facing a precision problem. For the following input: 0 0.00000001 0.000001 10 1 0 -180 10 0 0.00000001 0.000001 10 10 0 -180 10 0 0.00000001 0.000001 10 100 0 -180 10 My code outputs: Robot Problem #1: Robots collide at (0.50,0.00) Robot Problem #2: Robots collide at (5.00,0.00) Ro...
Tue May 12, 2015 12:07 pm
Forum: Volume 2 (200-299)
Topic: 203 - Running Lights Visibility Calculator
Replies: 22
Views: 5858

### Re: 203 - Running Lights Visibility Calculator

Input Test 1 Ownship 0 0 0 0 Ship -10 0 90.00001 0.0001 Output Scenario: Test Boat ID Bearing Distance Lights (left to right) --------------------------------------------------------------- Ship 0.00 10.00 Green Red Masthead ** Collision warning -->Ship: [b]Distance = 10.00[/b] *********************...
Mon Apr 27, 2015 2:06 pm
Forum: Volume 1 (100-199)
Topic: 194 - Triangle
Replies: 22
Views: 4585

### Re: 194 - Triangle

I found my error, but I can't edit the post to delete code.

Input:

Code: Select all

``````1
52.3790777315 0.9137932778 57.2377418870 -1.0000000000 -1.0000000000 1.1820993541
``````
Otuput:

Code: Select all

``52.379078 0.913793 57.237742 1.045700 61.215192 1.182099``
Fri Mar 27, 2015 10:17 am
Forum: Volume 1 (100-199)
Topic: 112 - Tree Summing
Replies: 137
Views: 14448

### Re: 112 - Tree Summing

Try this:

Code: Select all

``````0 (1()())
0 (0(1()())(1()()))
``````

Code: Select all

``````no
no
``````
Thu Mar 26, 2015 10:42 am
Forum: Volume 1 (100-199)
Topic: 194 - Triangle
Replies: 22
Views: 4585

### Re: 194 - Triangle

I don't know why I am getting WA... Help, please? #include <algorithm> #include <bitset> #include <cmath> #include <cstdlib> #include <ctime> #include <iomanip> #include <iostream> #include <list> #include <queue> #include <sstream> #include <stack> #include <stdio.h> #include <string> #include <vec...
Mon Mar 23, 2015 2:57 pm
Forum: Volume 1 (100-199)
Replies: 20
Views: 7941

### Re: 176 - City Navigation

Someone?
Mon Mar 23, 2015 2:49 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 21765

### Re: 193 - Graph Coloring

Algorithm AC in 0.029 seconds. Create an adjacency list and mark all nodes as white. Call a recursive function backtrack(starting on node 1) backtrack(int node) { if(node == n + 1) { if more nodes are marked as black then the best solution found so far, then keep track of which nodes are marked bla...
Thu Dec 11, 2014 5:47 pm
Forum: Volume 1 (100-199)
Replies: 20
Views: 7941

### Re: 176 - City Navigation

Thanks for your help!!! Now I believe that judge is wrong. I submitted the code of that web and it got AC. But I tested one of the above cases and the answer is not correct, specifically: A11 1612 1720 A12 1508 1636 S16 1152 1250 S17 1048 1134 S17 1272 1326 # S18 1202 S18 1203 # The AC program outpu...
Wed Dec 10, 2014 7:56 pm
Forum: Volume 1 (100-199)
Replies: 20
Views: 7941

### Re: 176 - City Navigation

I am getting WA but I can't find a wrong test case... Any hints?

Also, what is the correct output to:

Code: Select all

``````A01 0100 0200
#
A01 0099 A01 0098
#``````
0? 200? I think it is not a cul de sac, so 200 must be correct. Anyway, I tried both approaches and judge gives me WA.

Thu Oct 23, 2014 6:15 pm
Forum: Volume 1 (100-199)
Topic: 174 - Strategy
Replies: 8
Views: 4181

### Re: 174 - Strategy

Try.

Input:

Code: Select all

``````IFYOURLAST1=TRADEANDYOURLAST2#NULLORMYLAST1=NULLTHENCHEATELSETRAD

E.

#``````
Output:

Code: Select all

`````` 18
-14
``````
Fri Sep 12, 2014 1:39 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 7832

### Re: 168 - Theseus and the Minotaur

ACed

The error was dealing with passages returing to he origin cave. For example:
Input:

Code: Select all

``````A:B;B:C;C:C. B A 1
#``````
Output:

Code: Select all

``B C /C``
Another hint. Don't worry about loops, I submitted a program that doesn't care about them and I didn't get TLE. Cases like:

Code: Select all

``A:B;B:C;C:D;D:BA. A D 999999999``
Cheers.
Mon Sep 08, 2014 6:05 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 7832

### Re: 168 - Theseus and the Minotaur

Tue Sep 17, 2013 11:51 am
Forum: Volume 1 (100-199)
Topic: 125 - Numbering Paths
Replies: 56
Views: 5863

### Re: 125-Numbering Paths PLZ help

Try with

Code: Select all

``return 0;``
at the end of the code.
Mon Aug 26, 2013 3:07 pm
Forum: Bugs and suggestions
Topic: 122 Trees on the level - Wrong input
Replies: 0
Views: 1491

### 122 Trees on the level - Wrong input

Instead of The input is a sequence of binary trees specified as described above. Each tree in a sequence consists of several pairs (n,s) as described above separated by whitespace. The last entry in each tree is (). No whitespace appears between left and right parentheses. All nodes contain a positi...
Sun Apr 23, 2006 1:52 pm
Forum: Volume 102 (10200-10299)
Topic: 10274 - Fans and Gems
Replies: 8
Views: 2739

### 10274 Fans and Gems

Hi! We have a problem. Our output isn't correct for the online-judge. However, the answer seems correct. We don't know if it is just a problem of output writing. We have tried this input: 26 9 8 ######## ##...1## ##..2..# #..1..## ##2...## #...1@## ###...## ####.### ######## 7 8 ######## #212121# #....