首页 > 代码库 > poj 5024&&&2014 ACM/ICPC Asia Regional Guangzhou Online 1003(预处理)

poj 5024&&&2014 ACM/ICPC Asia Regional Guangzhou Online 1003(预处理)

2024-07-23 14:02:19   221人阅读

http://acm.hdu.edu.cn/showproblem.php?pid=5024

分析：预处理每个点在八个方向的射线长度，再枚举八种L形状的路，取最大值。

注意题意是求一条最长路，要么一条直线，要么只有一个90角，即L型。其实直线就是L形的一个方向长度为0。

代码:

#include<iostream>
#include<map>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#define MOD 1000000007
typedef long long ll;
using namespace std;

char g[105][105];
int num[105][105][8];

int n;

void init()
{
    memset(num,0,sizeof num);
    for(int i=0;i<n;i++)
    {
        num[0][i][0]=g[0][i]=='.',num[i][0][0]=g[i][0]=='.';
        num[0][i][1]=g[0][i]=='.';
        num[0][i][2]=g[0][i]=='.',num[i][n-1][2]=g[i][n-1]=='.';
        num[i][n-1][3]=g[i][n-1]=='.';
        num[n-1][i][4]=g[n-1][i]=='.',num[i][n-1][4]=g[i][n-1]=='.';
        num[n-1][i][5]=g[n-1][i]=='.';
        num[n-1][i][6]=g[n-1][i]=='.',num[i][0][6]=g[i][0]=='.';
        num[i][0][7]=g[i][0]=='.';
    }
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
            if(i&&j)num[i][j][0]=g[i][j]=='.'?num[i-1][j-1][0]+1:0;
            if(i)num[i][j][1]=g[i][j]=='.'?num[i-1][j][0]+1:0;
            if(i&&j){int jj=n-1-j;num[i][jj][2]=g[i][jj]=='.'?num[i-1][jj+1][2]+1:0;}
            if(j){int jj=n-1-j;num[i][jj][3]=g[i][jj]=='.'?num[i][jj+1][3]+1:0;}
            if(i&&j){int ii=n-1-i,jj=n-1-j;num[ii][jj][4]=g[ii][jj]=='.'?num[ii+1][jj+1][4]+1:0;}
            if(i){int ii=n-1-i;num[ii][j][5]=g[ii][j]=='.'?num[ii+1][j][5]+1:0;}
            if(i&&j){int ii=n-1-i;num[ii][j][6]=g[ii][j]=='.'?num[ii+1][j-1][6]+1:0;}
            if(j)num[i][j][7]=g[i][j]=='.'?num[i][j-1][7]+1:0;
        }
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        for(int i=0;i<n;i++)
            scanf("%s",g[i]);
        int ans=0;
        init();
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
            {
                ans=max(ans,num[i][j][0]+num[i][j][2]-1);
                ans=max(ans,num[i][j][2]+num[i][j][4]-1);
                ans=max(ans,num[i][j][4]+num[i][j][6]-1);
                ans=max(ans,num[i][j][6]+num[i][j][0]-1);
                ans=max(ans,num[i][j][1]+num[i][j][3]-1);
                ans=max(ans,num[i][j][3]+num[i][j][5]-1);
                ans=max(ans,num[i][j][5]+num[i][j][7]-1);
                ans=max(ans,num[i][j][7]+num[i][j][1]-1);
            }
        printf("%d\n",ans);
        /*for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                for(int k=0;k<8;k++)
                    printf("%d%c",num[i][j][k],k==7?'\n':' ');*/
    }
    return 0;
}

Wang Xifeng‘s Little Plot

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 114    Accepted Submission(s): 76


Problem Description
《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly regarded as the best one. This novel was created in Qing Dynasty, by Cao Xueqin. But the last 40 chapters of the original version is missing, and that part of current version was written by Gao E. There is a heart breaking story saying that after Cao Xueqin died, Cao‘s wife burned the last 40 chapter manuscript for heating because she was desperately poor. This story was proved a rumor a couple of days ago because someone found several pages of the original last 40 chapters written by Cao. 

In the novel, Wang Xifeng was in charge of Da Guan Yuan, where people of Jia family lived. It was mentioned in the newly recovered pages that Wang Xifeng used to arrange rooms for Jia Baoyu, Lin Daiyu, Xue Baochai and other teenagers. Because Jia Baoyu was the most important inheritor of Jia family, and Xue Baochai was beautiful and very capable , Wang Xifeng didn‘t want Jia Baoyu to marry Xue Baochai, in case that Xue Baochai might take her place. So, Wang Xifeng wanted Baoyu‘s room and Baochai‘s room to be located at two ends of a road, and this road should be as long as possible. But Baoyu was very bad at directions, and he demanded that there could be at most one turn along the road from his room to Baochai‘s room, and if there was a turn, that turn must be ninety degree. There is a map of Da Guan Yuan in the novel, and redists (In China English, one whose job is studying 《Dream of the Red Chamber》is call a "redist") are always arguing about the location of Baoyu‘s room and Baochai‘s room. Now you can solve this big problem and then become a great redist.
 

Input
The map of Da Guan Yuan is represented by a matrix of characters ‘.‘ and ‘#‘. A ‘.‘ stands for a part of road, and a ‘#‘ stands for other things which one cannot step onto. When standing on a ‘.‘, one can go to adjacent ‘.‘s through 8 directions: north, north-west, west, south-west, south, south-east,east and north-east.

There are several test cases.

For each case, the first line is an integer N(0<N<=100) ,meaning the map is a N × N matrix.

Then the N × N matrix follows.

The input ends with N = 0.
 

Output
For each test case, print the maximum length of the road which Wang Xifeng could find to locate Baoyu and Baochai‘s rooms. A road‘s length is the number of ‘.‘s it includes. It‘s guaranteed that for any test case, the maximum length is at least 2.
 

Sample Input
3
#.#
##.
..#
3
...
##.
..#
3
...
###
..#
3
...
##.
...
0
 

Sample Output
3
4
3
5
 

Source
2014 ACM/ICPC Asia Regional Guangzhou Online
 

Recommend
hujie
 


poj 5024&&&2014 ACM/ICPC Asia Regional Guangzhou Online 1003(预处理)


联系
我们