10452 - Marcus

All about problems in Volume 104. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Obaida
A great helper
Posts: 380
Joined: Wed Jan 16, 2008 6:51 am
Location: (BUBT) Dhaka,Bagladesh.

Re: 10452 - Marcus, help!

Post by Obaida » Wed Feb 24, 2010 7:37 am

I think this is an easy problem.
Easy recursive formula works here.
I just searched for the next match until last one.
try_try_try_try_&&&_try@try.com
This may be the address of success.

anis_cuet016
New poster
Posts: 15
Joined: Thu Jul 08, 2010 8:28 am

Re: 10452 - Marcus, help!

Post by anis_cuet016 » Sat Aug 28, 2010 1:46 pm

hlw vahid sanei ......
you asked for the recursive code ..... :D
please others don't just go through the code .... otherwise u will loose the interest of solving .... :wink:
can please share how u tracked the given path in BFS ????


#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define MAX 10

#define FORTH 1
#define LEFT 2
#define RIGHT 3

char mat[MAX][MAX];
int row, col;
int sx, sy, dx, dy;

char lim[] = { 'I', 'E', 'H', 'O', 'V', 'A', '#' };
int R[] = { 0, -1, 0};
int C[] = {-1, 0, 1};

void read_input()
{
int i, j;

scanf("%ld %ld", &row, &col);
for(i=0; i<row; i++)
{
getchar();
for(j=0; j<col; j++)
{
scanf("%c", &mat[j]);

if(mat[j] == '@')
sx = i, sy = j;
else if(mat[j] == '#')
dx = i, dy = j;
}
}

return ;
}

int dir[MAX * MAX];
int flag = true;

void DFS(int x, int y, char ch, int level)
{
int i;

if( (mat[x][y] == '#') || (x == dx && y == dy) )
{
flag = false;
return ;
}

for(i = 0; flag && i < 3; i++)
{
int nr = R + x;
int nc = C + y;

if(nr < 0 || nc < 0 || nr > row || nc > col)
continue;

if(mat[nr][nc] == ch)
{
mat[nr][nc] = '.';
ch = lim[level];

if( nr == x && nc < y )
dir[level] = LEFT;
else if( nr == x && nc > y )
dir[level] = RIGHT;
else if( nr < x && y == nc )
dir[level] = FORTH;

DFS(nr, nc, lim[level + 1], level + 1);
}
}

}

void print()
{
for(int i = 0; i <= 5; i++)
{
if(dir == 1)
printf("forth ");
else if(dir == 2)
printf("left ");
else if(dir == 3)
printf("right ");

dir = 0;
}
printf( dir[6] == 1 ? "forth" : dir[6] == 2 ? "left" : "right");
dir[6] = 0;

printf("\n");
}

void init()
{
int i, j;

for(i = 0; i <= row; i++)
for(j = 0; j <= col; j++)
mat[j] = 0;
flag = true;
}

int main()
{
// freopen("in.txt", "r", stdin);
int Case;

scanf("%d", &Case);
while(Case--)
{
read_input();
DFS(sx, sy, lim[0], 0);
print();

init();
}
return 0;
}

Samleo
New poster
Posts: 11
Joined: Mon Dec 03, 2012 2:39 pm

Re: 10452 - Marcus, help!

Post by Samleo » Mon Dec 03, 2012 3:00 pm

Hi, I got WA for my code (below) and I really can't understand why. Can someone help me to see if there is something wrong with my code? Thanks. (It's recursive code btw)

#include <iostream>
#include <fstream>
#include <math.h>
#include <string.h>

using namespace std;

#define LOOP(times) for(int(i)=0;i<int(times);i++);

char stones[10][10];
char letters[6] = {'I','E','H','O','V','A'};

void checkStones(int row, int col, int steps){
if(steps<6){ //see if coming to end
if(stones[row][col-1] == letters[steps]){ //left
cout << "left ";
checkStones(row,col-1,steps+1);
//return
}
else if(stones[row][col+1] == letters[steps]){ //right
cout << "right ";
checkStones(row,col+1,steps+1);
//return;
}
else if(stones[row-1][col] == letters[steps]){ //forth
cout << "forth ";
checkStones(row-1,col,steps+1);
//return;
}
else{
//something wrong..
return;
}
}
else{
if(stones[row][col-1] == '#'){ //left
cout << "left" << endl;
//return;
}
else if(stones[row][col+1] == '#'){ //right
cout << "right" << endl;
//return;
}
else if(stones[row-1][col] == '#'){ //forth
cout << "forth" << endl;
//return;
}
else{
//something is not right...
//system("pause");
return;
}
}

return;
}

int main(){
int n;
int rows, cols, startRow, startCol;

//ifstream cin;
//cin.open("temp.in");

cin >> n;

LOOP(n){
cin >> rows >> cols;
for(int b=1;b<=rows;b++){
for(int c=1;c<=cols;c++){
cin >> stones[c];
if(stones[c] == '@'){
startRow = b;
startCol = c;
}
}

}

checkStones(startRow,startCol,0);
//memset(stones, 'B', sizeof(stones[0][0])*10*10); //array must be reset to random char avoid conflict during search

}

//system("pause");
return 0;
}

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

Re: 10452 - Marcus, help!

Post by brianfry713 » Sat Dec 08, 2012 5:48 pm

Doesn't match the sample I/O. Use the code blocks.
Check input and AC output for thousands of problems on uDebug!

Shahidul.CSE
Experienced poster
Posts: 148
Joined: Sun Jul 13, 2014 4:32 am
Location: Rangpur, Bangladesh

Re: 10452 - Marcus

Post by Shahidul.CSE » Sun Jan 11, 2015 11:49 pm

Code: Select all

Ac
Last edited by Shahidul.CSE on Tue Jan 13, 2015 6:36 am, edited 1 time in total.
Md. Shahidul Islam
Dept. of CSE at Begum Rokeya University, Rangpur, Bangladesh
UVa id: http://uhunt.felix-halim.net/id/438420
My facebook account,
Email me: shahidul.cse.brur@gmail.com

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

Re: 10452 - Marcus

Post by brianfry713 » Tue Jan 13, 2015 3:00 am

Change line 50 to:
if(row > 0 && (grid[row-1][p]=='I'||grid[row-1][p]=='E'||grid[row-1][p]=='H'||grid[row-1][p]=='O'||grid[row-1][p]=='V'||grid[row-1][p]=='A'))
Check input and AC output for thousands of problems on uDebug!

Shahidul.CSE
Experienced poster
Posts: 148
Joined: Sun Jul 13, 2014 4:32 am
Location: Rangpur, Bangladesh

Re: 10452 - Marcus

Post by Shahidul.CSE » Tue Jan 13, 2015 6:35 am

Thanks. Now got Accepted! :D
Md. Shahidul Islam
Dept. of CSE at Begum Rokeya University, Rangpur, Bangladesh
UVa id: http://uhunt.felix-halim.net/id/438420
My facebook account,
Email me: shahidul.cse.brur@gmail.com

Post Reply

Return to “Volume 104 (10400-10499)”