The Settlers of Catan(回溯)

The Settlers of Catan

Description

Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilderness. 
You are employed by a software company that just has decided to develop a computer version of this game, and you are chosen to implement one of the game's special rules: 

When the game ends, the player who built the longest road gains two extra victory points. 
The problem here is that the players usually build complex road networks and not just one linear path. Therefore, determining the longest road is not trivial (although human players usually see it immediately). 
Compared to the original game, we will solve a simplified problem here: You are given a set of nodes (cities) and a set of edges (road segments) of length 1 connecting the nodes. 
The longest road is defined as the longest path within the network that doesn't use an edge twice. Nodes may be visited more than once, though. 

Example: The following network contains a road of length 12. 
o      o--o      o

 \    /    \    /

  o--o      o--o

 /    \    /    \

o      o--o      o--o

           \    /

            o--o

Input

The input will contain one or more test cases. 
The first line of each test case contains two integers: the number of nodes n (2<=n<=25) and the number of edges m (1<=m<=25). The next m lines describe the m edges. Each edge is given by the numbers of the two nodes connected by it. Nodes are numbered from 0 to n-1. Edges are undirected. Nodes have degrees of three or less. The network is not neccessarily connected. 
Input will be terminated by two values of 0 for n and m.

Output

For each test case, print the length of the longest road on a single line.

Sample Input

3 2
0 1
1 2
15 16
0 2
1 2
2 3
3 4
3 5
4 6
5 7
6 8
7 8
7 9
8 10
9 11
10 12
11 12
10 13
12 14
0 0
#include<cstdio>  
#include<cstring>  
using namespace std;  
int n,m,s;  
int map[26][26],vis[26][26];  
int dfs(int x,int st)  
{  
    int i,j;  
    if(st>s) s=st;  
    for(i=0;i<n;i++)  
    {  
        if(map[x][i]&&!vis[x][i])  
        {  
            vis[x][i]=vis[i][x]=1;  
            dfs(i,st+1);  
            vis[x][i]=vis[i][x]=0;  
        }  
    }  
    return s;  
}  
int main()  
{  
    int i,j,a,b,t;  
    while(scanf("%d%d",&n,&m),n||m)  
    {  
        s=0;  
        memset(map,0,sizeof map);  
        memset(vis,0,sizeof vis);  
        for(i=1;i<=m;i++)  
        {  
            scanf("%d%d",&a,&b);  
            map[a][b]=map[b][a]=1;  
        }  
        for(j=0;j<n;j++)  
        {  
            dfs(j,0);  
        }  
        printf("%d\n",s);  
    }  
    return 0;  
}  

阅读更多

Settlers of Catan

02-04

DescriptionnnThe popular board game "Settlers of Catan" starts by creating a random board. This board consists of hexagonal resource tiles containing five different resources: clay, lumber, wool, grain, and ore. For simplicity, we will denote these by the numbers 1 to 5. nRandom boards, however, often have multiple equal resource tiles next to each other. This annoys some players. Therefore, we have invented a new way of creating the playing board. Starting in the middle and spiraling outwards, each time we add a new tile to the board we choose the resource of the tile according to the following rules: n1. the new tile must be different from its neighboring tiles on the board so far; n2. in case multiple tiles are possible, we choose a resource that occurs the least number of times on the board so far; n3. in case multiple tiles are still possible, the new resource must have the lowest number possible. nThe figure underneath shows how to spiral outwards and which resource tiles are chosen first. We are curious what the number of the resource is on the nth tile that is added to the board (starting with n = 1). nnInputnnOn the first line of the input there is one integer c (1 <= c <= 200), the number of test cases. Each following test case consists of a single line with one integer n (1 <= n <= 10 000), the number of the tile we are curious about.nOutputnnFor each test case, print a single line with one integer, specifying the resource of the nth tile.nSample Inputnn4n1n4n10n100nSample Outputnn1n4n5n5

没有更多推荐了,返回首页