OJ Board

really strange...




Hello,

My name is Ann, and I live in Riga, Latvia.
For my exam I need to solve problems form website:http://acm.uva.es
I have already solved problems but still have hard problems for me.
If I will not solve them, I will not be allowed to pass this exam :-(

It seems, you ...

The same situation with me. Please reply...

What's the output for the following input? My program (WA) gives

Thank you very much..
I completley forgot that comparation and concetation of strings don't take O(1) time.
A stupid mistake.

This problem is driving me mad too!
This time i get TLE, and I really can't find a rational explanation for it. Can somebody help me?

#include <iostream>
#include <string>

using namespace std;

string prva,druga;

int init() {
string red;
if (!getline(cin,red)) return 0;
prva="";
druga ...

You are right, thanks. I don't read problem statements carefully enough. AC now

0 3 1 2 3 0 3 1 2 3 0 3 1 2 3 0 4

Your drive is invalid because of the sequence 3 0 3

I dont understand this sentence in problem descreption:

You are given several sparse matrix in a row, each of them described as follows.

Does it mean there are more than one matrices or just one?

I don't really think this is a hard problem. I've tried both bottom-up approach and memoization but the result is the same - WA. I just don't see the reason why.. Is there any tricky input?
Here's my source: a straightforward memoization

I'm trying to solve it using DP. I have a array best[71][6] in wich I store the lowest possible energy cost - first index shows the sign I'm currently on, and the second index shows my last move.

Moves are numbered:
0 for left foot on Left
1 for left foot on Up
2 for left foot on Down
3 for right ...

I'm really having trouble with this problem. Can someone tell me why this code gives WA? Basically i use STL set to store all the words and after that BFS to find the solution.

#include <iostream>
#include <set>
#include <string>

using namespace std;

set <string> dict;
string red,start,end ...

There's a O(nm) algorithm.

You are right. I greatly underestimated this problem. Thanks.
AC now.

If the number of words and the number of letters are both higher than 1000, how is it possible to solve this problem with brute force and checking words letter by letter? Time complexity is then O(n^3) which is (when n=1000) definetly too large to pass the time limit.

Can someone give me some I/O.
Here's mine test data:


INPUT:

2 30
10 5
0 1 3 5 7 9 11 13 15 20 99
4 13 15 19 20 25 30
3 50
10 50 100
0 10 30 40
0 20 30
0 20 50
5 1
1 2 3 4 50
0 2 6
2 3 5
3 8
1 8 20
0 1
5 1
1 2 3 4 100
0 2 6
2 3 5
3 8
1 8 20
0 1
5 0
1 2 3 4 50
0 2 6
2 3 5
3 8
1 8 20
0 1 ...

Thanx misof, i found my bug. AC now...