OJ Board

LlatzerandToni

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 ...

LlatzerandToni

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 ...

LlatzerandToni

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

LlatzerandToni

Try this:

Code: Select all

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

Code: Select all

no
no

LlatzerandToni

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 ...

LlatzerandToni

Someone?

LlatzerandToni

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 ...

LlatzerandToni

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 ...

LlatzerandToni

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.

Thanks in advance

LlatzerandToni

Try.

Input:

Code: Select all

IFYOURLAST1=TRADEANDYOURLAST2#NULLORMYLAST1=NULLTHENCHEATELSETRAD

E.
IFMYLAST2#NULLTHENIFMYLAST1#CHEATTHENTRADEELSECHEATELSEIFYOURLAST

2=TRADETHENCHEATELSETRADE.
#

Output:

Code: Select all

 18
-14

LlatzerandToni

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.

LlatzerandToni

I tried all the inputs here posted (same outputs) but I keep getting WA.

Input:
A:BCD;B:ACD;C:ABD;D:ABC. A B 5
A:BCD;B:AD;D:BG;F:H;G:DEH;E:FGH;H:EG;C:AD;Z. A C 3
A:BCD;B:AD;D:BG;F:H;G:DEH;E:FGH;H:EG;C:AD;Z:. A C 3
A:BCD;B:AD;D:BG;F:H;G:DEH;E:FGH;H:EG;C:AD. A C 3
A:BCD;B:AD;D:BG;F:H;G:DEH;E:FGH;H ...

LlatzerandToni

Try with

Code: Select all

return 0;

at the end of the code.

LlatzerandToni

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 ...

LlatzerandToni

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 ...

OJ Board

Search found 15 matches

Re: 204 - Robot Crash

Re: 203 - Running Lights Visibility Calculator

Re: 194 - Triangle

Re: 112 - Tree Summing

Re: 194 - Triangle

Re: 176 - City Navigation

Re: 193 - Graph Coloring

Re: 176 - City Navigation

Re: 176 - City Navigation

Re: 174 - Strategy

Re: 168 - Theseus and the Minotaur

Re: 168 - Theseus and the Minotaur

Re: 125-Numbering Paths PLZ help

122 Trees on the level - Wrong input

10274 Fans and Gems