OJ Board

Hi all, I'm pretty sure I got this right but I keep getting WA.. any hint?

#include<iostream>
#include<cstring>
using namespace std;
int row[100];
int col[100];
int d1[100];
int d2[100];
int board[35][35];
int n;

inline void set(int i, int j){row[i]=col[j]=d1[i+j]=d2[i-j+31]=1;}
inline void clear ...

Hi, thanks for all your support.

I have updated with new features:
•Remembers your account info and encrypts your passwords.
•Password-less submissions.
•Checks most recent submission status.
•Template Support!
•File name completion and problem number detection *new*
•Non-interactive mode *new ...

Command line tool for the UVa Online Judge website

I made this tool for myself and want to share with everybody!

UVA-NODE is an interactive shell where you can type commands to submit and check your submissions.

Features

Remembers your account info and encrypts your passwords.
Password-less ...

anyone can explain why the sample output for the first case is 170 ?

Thanks!

I generated all edges for all pairs of cities and then used Kruskal + Union Find (with path compression and ranking)
The union find is less than 10 lines of code
Kruskal done using make_heap and pop_heap

I got WA once because I didn't realize # of states == # of railroads + 1 ........
but why is ...

Gotchas:
- M is the # of rows! N is # of columns
'x' refers to the row index!


- Can be any chars other than l and w

- The grid wraps around at column 0 and column N-1

- Only up, down, left and right are considered adjacent

- Look for largest land area except the initial one the King's on ...

I would say this problem is confusing and ambiguous.

It is straightforward but not very well explained.

Say if the input is

1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 9 9 1
1 -9 -9 1

Let row 0 be the bottommost (altitude 0) (1 -9 -9 1)
Let column 0 be the left most column ...

the biggest trick is that the input is formatted nicely for you already ...

Be very careful of the meaning of mouth/tail of snake.

The input is specified as X, Y where X is bottom of ladder or mouth of snake (Entrance)
Y is top of ladder or tail of snake (Exit)

Also terminate ASAP when a player ...

Try this:

5 3
1 2 3 4 8
3 2
4 78 9

Your solution gives an incorrect answer of 6 whereas it should be 8
I think you're close. Just have to fix this bug

* Theory:
* The minimal solution consists of a sequence of moves.
* Think of these moves as a series of XOR operations .. (m1 XOR m2 XOR m3 ...) = BOARD_CLEAR
* The usual associativity and XOR-the-same-thing-cancels-out properties
* still apply.
* So no two move should be on the same cell ...