Knight can't step on the cell with the horned demon

I've already run throw every test i've found here and some that I thpught myself.
I dont understand what is test #23.
Can someone post some test to run?

Edited by author 08.03.2021 04:25

Edited by author 25.03.2021 12:41

Input
3 3 1
1 1
3 3
Output
0
is it correct?

Here's my code-

#include <bits/stdc++.h>
using namespace std;

bool upp,downn,leftt,rightt,avleftt,avrightt,avupp,avdownn;


bool vis[105][105],vis2[105][105];
int dist[105][105];
int dist2[105][105];
int xmov[4]={0,-1,0,1};
int ymov[4]={-1,0,1,0};
int main()
{
    // cout << "Hello World!" << endl;
    ios::sync_with_stdio(false);
    for(int i=1;i<105;i++)for(int j=1;j<105;j++)dist[i][j]=INT_MAX;
    int n,m,l,x1,y1,x2,y2;
    cin>>n>>m>>l;
    cin>>x1>>y1;
    cin>>x2>>y2;

    queue <pair <int,int> > q;
    queue <int> distt;
    int ans=0;
    if(abs(x1-x2)+abs(y1-y2)==1){
        ans=1;
    }
    vis[x1][y1]=true;
    dist[x1][y1]=0;
    vis[x2][y2]=true;
    q.push(make_pair(x1,y1));
    distt.push(0);


    while(q.empty()==0){
        pair <int,int> topp=q.front();
        int curdist=distt.front();
        q.pop();
        distt.pop();
        int curx,cury,nextx,nexty;
        curx=topp.first;
        cury=topp.second;
        for(int i=0;i<4;i++){
            nextx=curx+xmov[i];
            nexty=cury+ymov[i];
            if(nextx>=1&&nextx<=n&&nexty>=1&&nexty<=m){

                if(vis[nextx][nexty]==false){
                    vis[nextx][nexty]=true;
                    q.push(make_pair(nextx,nexty));
                    distt.push(curdist+1);
                    dist[nextx][nexty]=curdist+1;
                }
            }
        }
    }


    q.push(make_pair(x2,y2));
    distt.push(-1);
    vis2[x2][y2]=true;
    dist2[x2][y1]=-1;
     while(q.empty()==0){
        pair <int,int> topp=q.front();
        int curdist=distt.front();
        q.pop();
        distt.pop();
        int curx,cury,nextx,nexty;
        curx=topp.first;
        cury=topp.second;
        for(int i=0;i<4;i++){
            nextx=curx+xmov[i];
            nexty=cury+ymov[i];
            if(nextx>=1&&nextx<=n&&nexty>=1&&nexty<=m){

                if(vis2[nextx][nexty]==false){
                    vis2[nextx][nexty]=true;
                    q.push(make_pair(nextx,nexty));
                    distt.push(curdist+1);
                    dist2[nextx][nexty]=curdist+1;
                }
            }
        }
    }

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(i==x2&&j==y2){
                continue;
            }

            if(dist[i][j]!=INT_MAX){
                cout<<i<<" ::::: "<<j<<"\n";
                int totaldist=dist[i][j]+dist2[i][j];
                if(totaldist<=l){
                    ans=max(ans,max(abs(y2-j),abs(x2-i))+1);
                }
            }

        }
    }

    cout<<ans;
    return 0;
}

Can the knight run back and forward on the segment? Does it count as run up?

Example:

The monster is at (1,3), the knight is at (1,1)

If the knight does
(1,1) -> (1,2) -> (1,1) -> (1,2) -> Strike
the strike force is 4 or 2?

Thanks in advance

please give test case!
i checked all test case which came to my mind.
thanks

Please, gimme some tests equal test8

Edited by author 08.01.2010 02:59

now i  have AC!

Edited by author 25.05.2009 11:45

Funny simple problem :)

Thanks.

Please, give me some tests on #21

Thanks.

I understood my mistake

Edited by author 19.10.2006 02:40