OJ Board

Code: Select all

/*@JUDGE_ID; 55485HX 10496 C++*/
#include<stdio.h>
#include<queue>

using namespace std;

#define INF 9999999

typedef struct Cell{
	int r,c;
	bool operator !=(Cell C){
		return r!=C.r && c!=C.c;
	}
} Cell;

int change[2][4];
bool visited[25][25];
int d[25][25];
int row,col;
queue<Cell> Q;

void init(){
	change[0][0]=0;change[1][0]=1;
	change[0][1]=0;change[1][1]=-1;
	change[0][2]=1;change[1][2]=0;
	change[0][3]=-1;change[1][3]=0;
}

void init_source(Cell);
void BFS(Cell);

void main(){
	int i,j,k,n,caseno,length,min;
	Cell beeper[15],so,start;
	bool flag[15];
	init();

	scanf("%d",&caseno);

	for(;caseno;caseno--){
		scanf("%d %d",&row,&col);
		scanf("%d %d",&start.r,&start.c);
		scanf("%d",&n);
		for(i=1;i<=n;i++){
			scanf("%d %d",&beeper[i].r,&beeper[i].c);flag[i]=false;
		}
		
		length=0;
		k=0;
		so=start;
		for(i=1;i<n;i++){
			BFS(so);
			min=INF;
			for(j=1;j<=n;j++){
				if(beeper[j]!=so && !flag[j] && min>d[beeper[j].r][beeper[j].c]){
					min=d[beeper[j].r][beeper[j].c];
					k=j;
				}
			}
			length+=d[beeper[k].r][beeper[k].c];
			so=beeper[k];
			flag[k]=true;
		}

		BFS(so);
		length+=d[start.r][start.c];
		printf("The shortest path has length %d\n",length);
	}
}

void init_source(Cell s){
	int i,j;

	for(i=1;i<=row;i++){
		for(j=1;j<=col;j++){
			visited[i][j]=false;
			d[i][j]=INF;
		}
	}

	d[s.r][s.c]=0;
	visited[s.r][s.c]=true;
}

void BFS(Cell s){
	int i;
	Cell t1,t2;
	while(!Q.empty()) Q.pop();
	init_source(s);

	Q.push(s);

	while(!Q.empty()){
		t1=Q.front();
		Q.pop();

		for(i=0;i<4;i++){
			t2.r=t1.r+change[0][i];
			t2.c=t1.c+change[1][i];
			if(t2.r>0 && t2.r<=row && t2.c>0 && t2.c<=col && !visited[t2.r][t2.c]){
				visited[t2.r][t2.c]=true;
				d[t2.r][t2.c]=d[t1.r][t1.c]+1;
				Q.push(t2);
			}
		}
	}
}

Code: Select all

1
20 20
1 10
3
1 11
1 8
1 15

Code: Select all

#include <cstdio>
#include <algorithm>

#define MAX 20
#define INF 1<<29

using namespace std;

typedef struct{
	int x,y;
}Node;

bool notTaken[MAX];
Node node[MAX];
int pos,nBeep;

int abs(int n){
	if(n < 0)
		return -n;
	return n;
}

int sx,sy;
int getNext(int x,int y){
	int min = INF,dist,i;
	for(i = 0; i<nBeep; i++){
		dist = abs(x - node[i].x) + abs(y - node[i].y);
		if(min > dist && notTaken[i]){
			min = dist;
			pos  = i;
		}
	}
	notTaken[pos] = false;
	return min;
}

bool hasNext(){
	int i;
	for(i = 0; i<nBeep; i++){
		if(notTaken[i])
			return true;
	}
	return false;
}

int main(){	
	int a,b,dist,m,n,test,x,y,i;
	//freopen("in.txt","rt",stdin);
	scanf("%d",&test);
	while(test--){
		scanf("%d%d",&m,&n);
		scanf("%d%d",&sx,&sy);
		scanf("%d",&nBeep);

		for(i = 0; i<nBeep; i++){
			scanf("%d%d",&a,&b);
			node[i].x = a;
			node[i].y = b;
		}
		fill(notTaken,notTaken + nBeep, true);
		int cnt = 0;
		x = sx;
		y = sy;
		for(i = 0; hasNext(); i++){
			dist = getNext(x,y);
			cnt += dist;
			x = node[pos].x;
			y = node[pos].y;
		}
		dist = abs(sx - x) + abs(sy - y);
		cnt += dist;
		printf("The shortest path has length %d\n",cnt);
	}
	return 0;
}