601 - The PATH

[muneeb]

ACm compiler give ma wrong answer, i can't found out my error so please give ma my mistake if you found..

#include<iostream>
#include<string>
using namespace std;
int pathVisit();
int size;
char **path;
int **ref;
int ret;
int pathVisit()
{
for(int i=0;i<size;i++)
{
if(ref[size-1]==1 && ref[0]==1)
{
ret=1;
return ret;
}
if(ref[size-1]==1 && ref[0]==0) //U W
{
if(i==size-1)
{
if(ref[1]==1 || ref[i-1][0]==1 )
{
ret=2;
return ret;
}
}else if(i==0)
{
if(ref[i+1][0]==1 || ref[1]==1)
{
ret=2;
return ret;
}
}
else
{
if(ref[i+1][0]==1 || ref[1]==1 || ref[i-1][0]==1 )
{
ret=2;
return ret;
}
}
}
if(ref[0]==1 && ref[size-1]==0) //W U
{
if(i==0)
{
if(ref[i+1][size-1]==1 || ref[size-2]==1 )
{
ret=3;
return ret;
}
}
else if(i==size-1)
{
if( ref[i][size-2]==1 || ref[i-1][size-1]==1)
{
ret=3;
return ret;
}
}
else
{
if(ref[i+1][size-1]==1 || ref[i][size-2]==1 || ref[i-1][size-1]==1)
{
ret=3;
return ret;
}
}
}
}
for(int i=0;i<size;i++)
{
if(ref[size-1][i]==2 &&ref[0][i]==2)
{
ret=4;
return ret;
}
if(ref[size-1][i]==2 && ref[0][i]==0)
{
if(ref[0][i-1]==2 || ref[1][1]==2 || ref[0][i+1]==2)
{
ret=5;
return ret;
}
}
if(ref[size-1][i]==0 && ref[0][i]==2)
{
if(ref[size-1][i-1]==2 || ref[size-1][i+1]==2 || ref[size-2][i]==2 )
{
ret=6;
return ret;
}
}
}
return 0;
}
int main()
{
string input;
do
{
cin>>size;cout<<endl;
if(size==0)
{
break;
}
path=new char*[size];
for(int i=0;i<size;i++)
{
path[i]=new char[size];
}
ref=new int*[size];
for(int i=0;i<size;i++)
{
ref[i]=new int[size];
}
for(int i=0;i<size;i++)
{
for(int j=0;j<size;j++)
{
ref[i][j]=0;
}
}
for(int i=0;i<size;i++)
{
cin>>input;
int length=input.size();
for(int j=0;j<size;j++)
{
path[i][j]=input[j];
if(input[j]=='W')
{
ref[i][j]=1;
}
else if(input[j]=='B')
{
ref[i][j]=2;
}
else
{
ref[i][j]=0;
}
}
}
int t;
t=pathVisit();
while(1)
{
if(t==0)
{
cout<<"There is no winning path."<<endl;
break;
}
else if(t==1)
{
cout<<"White has winning path."<<endl;
break;
}
else if(t==2)
{
cout<<"White can win in one move."<<endl;
break;
}
else if(t==3)
{
cout<<"White can win in one move."<<endl;
break;
}
else if(t==4)
{
cout<<"Black has winning path."<<endl;
break;
}
else if(t==5)
{
cout<<"Black can win in one move."<<endl;
break;
}
else if(t==6)
{
cout<<"Black can win in one move."<<endl;
break;
}
else
{
cout<<"There is no winning path."<<endl;
break;
}
}
}while(1);
}
muneeb
New poster

Posts: 2
Joined: Wed Dec 26, 2012 6:05 pm

[muneeb]

please help me... i get the message WRONG ANSWER, when submit cod in acm..please tell me the problem if you found....thanx...

#include<iostream>
#include<string>
using namespace std;
int pathVisit();
int size;
char **path;
int **ref;
int ret;
int pathVisit()
{
for(int i=0;i<size;i++)
{
if(ref[size-1]==1 && ref[0]==1)
{
ret=1;
return ret;
}
if(ref[size-1]==1 && ref[0]==0) //U W
{
if(i==size-1)
{
if(ref[1]==1 || ref[i-1][0]==1 )
{
ret=2;
return ret;
}
}else if(i==0)
{
if(ref[i+1][0]==1 || ref[1]==1)
{
ret=2;
return ret;
}
}
else
{
if(ref[i+1][0]==1 || ref[1]==1 || ref[i-1][0]==1 )
{
ret=2;
return ret;
}
}
}
if(ref[0]==1 && ref[size-1]==0) //W U
{
if(i==0)
{
if(ref[i+1][size-1]==1 || ref[size-2]==1 )
{
ret=3;
return ret;
}
}
else if(i==size-1)
{
if( ref[i][size-2]==1 || ref[i-1][size-1]==1)
{
ret=3;
return ret;
}
}
else
{
if(ref[i+1][size-1]==1 || ref[i][size-2]==1 || ref[i-1][size-1]==1)
{
ret=3;
return ret;
}
}
}
}
for(int i=0;i<size;i++)
{
if(ref[size-1][i]==2 &&ref[0][i]==2)
{
ret=4;
return ret;
}
if(ref[size-1][i]==2 && ref[0][i]==0)
{
if(ref[0][i-1]==2 || ref[1][1]==2 || ref[0][i+1]==2)
{
ret=5;
return ret;
}
}
if(ref[size-1][i]==0 && ref[0][i]==2)
{
if(ref[size-1][i-1]==2 || ref[size-1][i+1]==2 || ref[size-2][i]==2 )
{
ret=6;
return ret;
}
}
}
return 0;
}
int main()
{
string input;
do
{
cin>>size;cout<<endl;
if(size==0)
{
break;
}
path=new char*[size];
for(int i=0;i<size;i++)
{
path[i]=new char[size];
}
ref=new int*[size];
for(int i=0;i<size;i++)
{
ref[i]=new int[size];
}
for(int i=0;i<size;i++)
{
for(int j=0;j<size;j++)
{
ref[i][j]=0;
}
}
for(int i=0;i<size;i++)
{
cin>>input;
int length=input.size();
for(int j=0;j<size;j++)
{
path[i][j]=input[j];
if(input[j]=='W')
{
ref[i][j]=1;
}
else if(input[j]=='B')
{
ref[i][j]=2;
}
else
{
ref[i][j]=0;
}
}
}
int t;
t=pathVisit();
while(1)
{
if(t==0)
{
cout<<"There is no winning path."<<endl;
break;
}
else if(t==1)
{
cout<<"White has winning path."<<endl;
break;
}
else if(t==2)
{
cout<<"White can win in one move."<<endl;
break;
}
else if(t==3)
{
cout<<"White can win in one move."<<endl;
break;
}
else if(t==4)
{
cout<<"Black has winning path."<<endl;
break;
}
else if(t==5)
{
cout<<"Black can win in one move."<<endl;
break;
}
else if(t==6)
{
cout<<"Black can win in one move."<<endl;
break;
}
else
{
cout<<"There is no winning path."<<endl;
break;
}
}
}while(1);
//return 0;
}

[brianfry713]

don't double post.

[brianfry713]

don't double post.
Problem 601

[brianfry713]

don't double post.

[brianfry713]

Doesn't match the sample I/O.