OJ Board

mrahman

hi!

can anyone tell me what is the meaning of "If there is more than one possible answer, print the one that comes first lexicographically" in this problem?
P.S. I have solved the problem before getting a wrong answer because I had diverted by the line.

Thanks in advance

[Sorry for my poor ...

mrahman

Here is the greedy approah. First sort the array.
Then try to construct the permutation array placing each pair(highest,lowest) of integer into a blank array. Place the highest and lowest number in the middle of the permutation array. Then place the second highest number neighbouring to the lowest ...

mrahman

Hi mysword,

I have no Idea about any critical I/O about this problem.

Here is some sample I/O

Input:

Code: Select all

Output:

Code: Select all

Hope this will help.

mrahman

Hi slxst,

Try this

input #

Code: Select all

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

output #

Code: Select all

good
wrong

Hope it will help.

mrahman

Hi,

I have solved the problem using Brute Force Method. At first I am trying to find out a Mathematical Solution or A formula but after spending hours of time I have failed. Is there any possiblity to have a mathematical Solution of this problem.

Thanks in advance

Sorry for my poor english.

mrahman

Hello Lame,

Think about Simply Binary number System

Code: Select all

           16  8  4  2  1        
   6 =            1  1  0

and negative 2 (-2) base System

           16  -8  4  -2  1
   6 =      1   1  0   1  0

good luck!!

mrahman

Thanks to little joey and Darko,

I just change my Queue size to 300000 and get AC. At first I didn't think about this amount of size.

Thank you anyway

mrahman

hi all

I also have solved the problem and timing at 5.855s. But I think the timing is poor. some author have timing less than 3s. What is the method if anyone can explain. Thanks in advance.

Sorry for my poor english

mrahman

hi sakhassan

your formula is wrong. There is two formula. One for Odd number, other for even number. The input 21 and 22 is invalid.
here is the output for 2-20

Case #1: 1
Case #2: 1
Case #3: 3
Case #4: 8
Case #5: 21
Case #6: 43
Case #7: 69
Case #8: 102
Case #9: 145
Case #10: 197
Case #11: 261 ...

mrahman

Hi little joey

I have checked those already. But fail to get AC. Here is my search function

#define SIZE 100001
#define INF 1000000000
int dr[]={1,0,-1,0};
int dc[]={0,1,0,-1};
int d[301][301][3],n,m,sx,sy,tx,ty,st,end;
char grid[301][301];
typedef struct node
{
int x,y,cost,dir;
}node;
node ...

mrahman

I am getting WA several times using BFS with a distance array d[301][301][3]
Can anyone put some input/output.

Thanks in advance

mrahman

Hi,
aniket, Your approach is good. But your Input taking method failed you to accept this code. Try to use gets() function instead of scanf() function and then parse the integer from the string. and you could simplify your code like

#include<stdio.h>

long mat[105][105],total_number,total[105 ...

mrahman

I am getting Runtime Error at least 12 times and have no clue. Plz help me
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<stdlib.h>
char list[510][10001],cnt;
char str[100001],temp[10001];
int sort_function(const void *a, const void *b)
{
return (strcmp((char *)a,(char *)b ...

mrahman

Thank you smilitude for your test input.

I solved it using kp's method. But why this is O(n). Can anyone explain. Is there anyother method to solve this problem?

Thanks in advance

Sorry for my poor english

mrahman

Dear SamuraiShaz, Why you do this
if(L>100)
W = L-1;
else
W = L+1;

You don't have to determine water denoted character. If you really want to do so use digit in place of Letter. Becasue in problem statement

Maps are given as M x N tables, filled with at most two different letters denoting ...

OJ Board

Search found 25 matches

Re: 11342 - Three-square

11120 - Very Funny Mr. Feynman

928 - Eternal Truths