hdu1010

  
Online Judge Online Exercise Online Teaching Online Contests Exercise Author 
F.A.Q
Hand In Hand
Online Acmers 
Forum | Discuss
Statistical Charts
 Problem Archive
Realtime Judge Status
Authors Ranklist
        C/C++/Java Exams     
ACM Steps
Code Challenge
Contest LiveCast
ICPC@China
 STD Contests 
VIP Contests 
Virtual Contests 
    DIY | Web-DIY beta
Recent Contests
  high
 Mail 0(0)
 Control Panel 
 Sign Out 
 

（免费宾馆住宿 + 实习工资）阿里巴巴实习生招聘信息（仅限2013届本、硕毕业生）
 
View Code
Problem : 1010 ( Tempter of the Bone )     Judge Status : Time Limit Exceeded
RunId : 5357179    Language : C++    Author : high
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta
#include<iostream>
#include<string.h>
#include<stdlib.h>
using namespace std;
char map[9][9];
int n,m,t,di,dj;
bool escape;
int dir[4][2]={{0,-1},{0,1},{1,0},{-1,0}};
void dfs(int  si,int sj,int cnt)
{
    int i,temp;
    if(si>n||sj>m||si<=0||sj<=0)return;
    if(cnt==t&&si==di&&sj==di)escape=1;
    if(escape)return;
    temp=(t-cnt)-abs(si-di)-abs(sj-dj);
    if(temp<0||temp&1)return;
    for(i=0;i<4;i++)
    {
        if(map[si+dir[i][0]][sj+dir[i][1]]!='X')
        {
            map[si+dir[i][0]][sj+dir[i][1]]='X';
            dfs(si+dir[i][0],sj+dir[i][1],cnt+1);
            map[si+dir[i][0]][sj+dir[i][1]]='.';
        }
    }
    return;
}
int main()
{
    int i,j,si,sj;
    while(cin>>n>>m>>t)
    {
        if(n==0&&m==0&&t==0)break;
        int wall=0;
        for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            cin>>map[i][j];
            if(map[i][j]=='X')wall++;
            else if(map[i][j]=='S'){
                si=i;sj=j;
            }
            else if(map[i][j]=='D'){
                di=i;dj=j;
            }
        }
        if(n*m-wall<=t){
            cout<<"NO"<<endl;
            continue;
        }
        escape=0;
        dfs(si,sj,0);
        if(escape)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}
#include<iostream>
#include<string.h>
#include<stdlib.h>
using namespace std;
char map[9][9];
int n,m,t,di,dj;
bool escape;
int dir[4][2]={{0,-1},{0,1},{1,0},{-1,0}};
void dfs(int  si,int sj,int cnt)
{
    int i,temp;
    if(si>n||sj>m||si<=0||sj<=0)return;
    if(cnt==t&&si==di&&sj==di)escape=1;
    if(escape)return;
    temp=(t-cnt)-abs(si-di)-abs(sj-dj);
    if(temp<0||temp&1)return;
    for(i=0;i<4;i++)
    {
        if(map[si+dir[i][0]][sj+dir[i][1]]!='X')
        {
            map[si+dir[i][0]][sj+dir[i][1]]='X';
            dfs(si+dir[i][0],sj+dir[i][1],cnt+1);
            map[si+dir[i][0]][sj+dir[i][1]]='.';
        }
    }
    return;
}
int main()
{
    int i,j,si,sj;
    while(cin>>n>>m>>t)
    {
        if(n==0&&m==0&&t==0)break;
        int wall=0;
        for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            cin>>map[i][j];
            if(map[i][j]=='X')wall++;
            else if(map[i][j]=='S'){
                si=i;sj=j;
            }
            else if(map[i][j]=='D'){
                di=i;dj=j;
            }
        }
        if(n*m-wall<=t){
            cout<<"NO"<<endl;
            continue;
        }
        escape=0;
        dfs(si,sj,0);
        if(escape)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}
[ Copy to Clipboard ]    [ Save to File]



 
Home | Top Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2012 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000627(s) query 1, Server time : 2012-02-15 18:52:55, Gzip enabled  Administration  
 

仿hdu的课件写的，竟然超时，实在是。。哪天在改吧。。