TSP – Live with passion

112

Asif NaeemNovember 21, 2015

Tree Summing.

#include <iostream>
#include <cstdio>
#include <sstream>
#include <string>

using namespace std;

int I;
string str;
int next_index;
bool PATHFOUND;
bool isEmpty(int a,int b)
{
	if(a+1==b && str[a]=='(' && str[b]==')')
	return 1;
	return 0;
}

int findnum(int idx)
{
	int numfoundAt=-1;
	int num=0;
	bool negative=false;
	for(int i=idx;i<str.size();i++)
	{
		if(str[i]!='(' && str[i]!=')')
		{
			numfoundAt = i;
			if(str[i]=='-')
				negative = 1,
				numfoundAt+=1;
			break;
		}
	}
	while( numfoundAt<str.size() && (str[numfoundAt]-'0')>=0 && (str[numfoundAt]-'0')<=9)
	{
		num*=10;
		num+=(str[numfoundAt]-'0');
		numfoundAt+=1;
	}
	if(negative)
	num*=(-1);
	next_index = numfoundAt;
	return num;
}
//(5 (4 (11 (7()()) (2()()) )  () )
void calc(int a,int b,int sum)
{
	int number = findnum(a);
	int j=next_index;
	int start1,start2,finish1,finish2;
	int left=0,right=0;
	while(j<str.size() && str[j]!='(')
		j+=1;
	left=1;
	start1=j;
	j+=1;
	while(left!=right)
	{
		if(str[j]=='(')
		left+=1;
		if(str[j]==')')
		right+=1;
		j+=1;
	}
	finish1=j-1;

	left=1;right=0;
	start2=j;
	j+=1;
	while(left!=right)
	{
		if(str[j]=='(')
		left+=1;
		if(str[j]==')')
		right+=1;
		j+=1;
	}
	finish2=j-1;
	bool f1 = isEmpty(start1,finish1);
	bool f2 = isEmpty(start2,finish2);
	if(f1==1 && f2==1)
	{
		if(sum+number==I)
		{
			PATHFOUND=1;
			return;
		}
	}
	else if(f1)
	{
		calc(start2,finish2,sum+number);
	}
	else if(f2)
	{
		calc(start1,finish1,sum+number);
	}
	else
	{
		calc(start1,finish1,sum+number);
		calc(start2,finish2,sum+number);
	}
}
//22 (5(4(11(7()())(2()()))())   (8(13()())(4()(1()()))))
int main()
{
	char ch;
	int j,start1,start2,finish1,finish2;
	bool foundNum,neg;
	int left,right,num,counter;
	while(scanf("%d",&I)!=EOF)
	{
		str="";
		while(scanf("%c",&ch))
			if(ch=='(')
			break;
		str+='(';
		left=1;right=0;
		while(left!=right)
		{
			scanf("%c",&ch);
			if(ch!=' ' && ch!='\n')
			str+=ch;
			if(ch=='(')
			left+=1;
			if(ch==')')
			right+=1;
		}
		//cout<<str<<"\n";
		if(str[0]=='(' && str[1]==')')
		cout<<"no\n";
		else
		{
			PATHFOUND=0;
			int number = findnum(0);
			//left tree
			j=next_index;
			left=0;right=0;
			while(j<str.size() && str[j]!='(')
				j+=1;
			left=1;
			start1=j;
			j+=1;
			while(left!=right)
			{
				if(str[j]=='(')
				left+=1;
				if(str[j]==')')
				right+=1;
				j+=1;
			}
			finish1=j-1;
			left=1;right=0;
			start2=j;
			j+=1;
			while(left!=right)
			{
				if(str[j]=='(')
				left+=1;
				if(str[j]==')')
				right+=1;
				j+=1;
			}
			finish2=j-1;
			bool f1 = isEmpty(start1,finish1);
			bool f2 = isEmpty(start2,finish2);
			//cout<<f1<<" "<<f2<<"\n";
			//cout<<start1<<" "<<finish1<<" "<<start2<<" "<<finish2<<"\n";
			if(f1==1 && f2==1)
			{
				if(number==I)
				PATHFOUND=1;
				else
				PATHFOUND=0;
			}
			else if(f1)
			{
				calc(start2,finish2,number);
			}
			else if(f2)
			{
				calc(start1,finish1,number);
			}
			else
			{
				calc(start1,finish1,number);
				calc(start2,finish2,number);
			}

			if(PATHFOUND)
			cout<<"yes\n";
			else
			cout<<"no\n";
		}
	}
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

#include <iostream>

#include <cstdio>

#include <sstream>

#include <string>

using namespace std;

int I;

string str;

int next_index;

bool PATHFOUND;

bool isEmpty(int a,int b)

{

if(a+1==b && str[a]=='(' && str[b]==')')

return 1;

return 0;

}

int findnum(int idx)

{

int numfoundAt=-1;

int num=0;

bool negative=false;

for(int i=idx;i<str.size();i++)

{

if(str[i]!='(' && str[i]!=')')

{

numfoundAt = i;

if(str[i]=='-')

negative = 1,

numfoundAt+=1;

break;

}

while( numfoundAt<str.size() && (str[numfoundAt]-'0')>=0 && (str[numfoundAt]-'0')<=9)

{

num*=10;

num+=(str[numfoundAt]-'0');

numfoundAt+=1;

}

if(negative)

num*=(-1);

next_index = numfoundAt;

return num;

}

//(5 (4 (11 (7()()) (2()()) ) () )

void calc(int a,int b,int sum)

{

int number = findnum(a);

int j=next_index;

int start1,start2,finish1,finish2;

int left=0,right=0;

while(j<str.size() && str[j]!='(')

j+=1;

left=1;

start1=j;

j+=1;

while(left!=right)

{

if(str[j]=='(')

left+=1;

if(str[j]==')')

right+=1;

j+=1;

}

finish1=j-1;

left=1;right=0;

start2=j;

j+=1;

while(left!=right)

{

if(str[j]=='(')

left+=1;

if(str[j]==')')

right+=1;

j+=1;

}

finish2=j-1;

bool f1 = isEmpty(start1,finish1);

bool f2 = isEmpty(start2,finish2);

if(f1==1 && f2==1)

{

if(sum+number==I)

{

PATHFOUND=1;

return;

}

else if(f1)

{

calc(start2,finish2,sum+number);

}

else if(f2)

{

calc(start1,finish1,sum+number);

}

else

{

calc(start1,finish1,sum+number);

calc(start2,finish2,sum+number);

}

//22 (5(4(11(7()())(2()()))()) (8(13()())(4()(1()()))))

int main()

{

char ch;

int j,start1,start2,finish1,finish2;

bool foundNum,neg;

int left,right,num,counter;

while(scanf("%d",&I)!=EOF)

{

str="";

while(scanf("%c",&ch))

if(ch=='(')

break;

str+='(';

left=1;right=0;

while(left!=right)

{

scanf("%c",&ch);

if(ch!=' ' && ch!='\n')

str+=ch;

if(ch=='(')

left+=1;

if(ch==')')

right+=1;

}

//cout<<str<<"\n";

if(str[0]=='(' && str[1]==')')

cout<<"no\n";

else

{

PATHFOUND=0;

int number = findnum(0);

//left tree

j=next_index;

left=0;right=0;

while(j<str.size() && str[j]!='(')

j+=1;

left=1;

start1=j;

j+=1;

while(left!=right)

{

if(str[j]=='(')

left+=1;

if(str[j]==')')

right+=1;

j+=1;

}

finish1=j-1;

left=1;right=0;

start2=j;

j+=1;

while(left!=right)

{

if(str[j]=='(')

left+=1;

if(str[j]==')')

right+=1;

j+=1;

}

finish2=j-1;

bool f1 = isEmpty(start1,finish1);

bool f2 = isEmpty(start2,finish2);

//cout<<f1<<" "<<f2<<"\n";

//cout<<start1<<" "<<finish1<<" "<<start2<<" "<<finish2<<"\n";

if(f1==1 && f2==1)

{

if(number==I)

PATHFOUND=1;

else

PATHFOUND=0;

}

else if(f1)

{

calc(start2,finish2,number);

}

else if(f2)

{

calc(start1,finish1,number);

}

else

{

calc(start1,finish1,number);

calc(start2,finish2,number);

}

if(PATHFOUND)

cout<<"yes\n";

else

cout<<"no\n";

}

return 0;

}

10937

Asif NaeemMarch 19, 2015

#include <cstdio>
#include <queue>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>

#define INF 10000
using namespace std;

int location,target;
vector<vector<int> > dp;
int h,w;
int graph[200][200];
string str[60];

struct POINT{
	int x,y;
};

POINT pp[3030];
POINT src,tr;
int k;
int dirx[4]={1,0,0,-1};
int diry[4]={0,1,-1,0};

int bfs(int s,int t)
{
	int tmpy,tmpx;
	queue<int> q;
	bool visit[55][55];
	int dist[55][55];

	memset(dist,0,sizeof(dist));
	for(int i=0;i<55;i++)
	{
		for(int j=0;j<55;j++)
		{
			dist[i][j]=INF;
			visit[i][j]=false;
		}
	}

	tmpx = pp[s].x;
	tmpy = pp[s].y;

	q.push(tmpx);
	q.push(tmpy);

	visit[tmpx][tmpy]=1;
	dist[tmpx][tmpy]=0;

	while(!q.empty())
	{
		int a = q.front();q.pop();
		int b = q.front();q.pop();

		for(int i=0;i<4;i++)
		{
			int tx = a+dirx[i];
			int ty = b+diry[i];
			if(tx<0 || tx>=h)
			continue;
			if(ty<0 || ty>=w)
			continue;
			if(str[tx][ty]=='#')
			continue;

			if(!visit[tx][ty])
			{
				q.push(tx);q.push(ty);
				visit[tx][ty]=1;
				dist[tx][ty]=dist[a][b]+1;
			}
		}
	}

	return dist[pp[t].x][pp[t].y];
}

int tsp(int status,int location)
{
	if(dp[status][location]!=-1)
	return dp[status][location];

	dp[status][location] = 1e9;

	int mask = 1<<location;

	for(int i=0;i<k;i++)
	{
		if(i!=location && (status & (1<<i)))
		dp[status][location]= min(dp[status][location],tsp(status-mask,i)+graph[i][location]);
	}
	return dp[status][location];
}

int main()
{
	int dx[8]={1,0,0,-1,1,1,-1,-1};
	int dy[8]={0,1,-1,0,1,-1,-1,1};

	while(cin>>h)
	{
		cin>>w;
		if(h+w==0)
		break;

		for(int i=0;i<h;i++)
			cin>>str[i];
		memset(graph,0,sizeof(graph));

		int res = 0;
		for(int i=0;i<h;i++)
		{
			for(int j=0;j<w;j++)
			{
				if(str[i][j]=='~')
				{
					str[i][j]='#';
				}
				else if(str[i][j]=='*')
				{
					str[i][j]='#';
					for(int l=0;l<8;l++)
					{
						if(i+dx[l]<0 || i+dx[l]>=h)
						continue;
						if(j+dy[l]<0 || j+dy[l]>=w)
						continue;
						if(str[i+dx[l]][j+dy[l]]=='!' || str[i+dx[l]][j+dy[l]]=='@')
						res = -1;
						if(str[i+dx[l]][j+dy[l]]!='*')
							str[i+dx[l]][j+dy[l]]='#';
					}
				}
			}
		}

		if(res==-1)
		{
			cout<<-1<<"\n";
			continue;
		}
		k = 0;
		location = -1; target = -1;
		for(int i=0;i<h;i++)
		{
			for(int j=0;j<w;j++)
			{
				if(str[i][j]=='!')
				{
					pp[k].x = i; pp[k].y = j; k+=1;
				}
				else if(str[i][j]=='@')
				{
					location = k;
					pp[k].x = i; pp[k].y = j; k+=1;
				}
			}
		}

		if(k==1)
		{
			cout<<0<<"\n";
			continue;
		}
		for(int i=0;i<k;i++)
		{
			for(int j=i+1;j<k;j++)
			{
					graph[i][j]=bfs(i,j);
					graph[j][i] = graph[i][j];
			}
		}

		dp = vector< vector< int > >(1<<k,vector<int>(k,-1));
		for(int i=0;i<k;i++)
			dp[1<<i][i]=graph[location][i];

		res = tsp((1<<(k))-1,location);
		if(res>=INF)
		{
			cout<<-1<<"\n";
			continue;
		}
		cout<<res<<"\n";
	}

	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

#include <cstdio>

#include <queue>

#include <vector>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <string>

#define INF 10000

using namespace std;

int location,target;

vector<vector<int> > dp;

int h,w;

int graph[200][200];

string str[60];

struct POINT{

int x,y;

};

POINT pp[3030];

POINT src,tr;

int k;

int dirx[4]={1,0,0,-1};

int diry[4]={0,1,-1,0};

int bfs(int s,int t)

{

int tmpy,tmpx;

queue<int> q;

bool visit[55][55];

int dist[55][55];

memset(dist,0,sizeof(dist));

for(int i=0;i<55;i++)

{

for(int j=0;j<55;j++)

{

dist[i][j]=INF;

visit[i][j]=false;

}

tmpx = pp[s].x;

tmpy = pp[s].y;

q.push(tmpx);

q.push(tmpy);

visit[tmpx][tmpy]=1;

dist[tmpx][tmpy]=0;

while(!q.empty())

{

int a = q.front();q.pop();

int b = q.front();q.pop();

for(int i=0;i<4;i++)

{

int tx = a+dirx[i];

int ty = b+diry[i];

if(tx<0 || tx>=h)

continue;

if(ty<0 || ty>=w)

continue;

if(str[tx][ty]=='#')

continue;

if(!visit[tx][ty])

{

q.push(tx);q.push(ty);

visit[tx][ty]=1;

dist[tx][ty]=dist[a][b]+1;

}

return dist[pp[t].x][pp[t].y];

}

int tsp(int status,int location)

{

if(dp[status][location]!=-1)

return dp[status][location];

dp[status][location] = 1e9;

int mask = 1<<location;

for(int i=0;i<k;i++)

{

if(i!=location && (status & (1<<i)))

dp[status][location]= min(dp[status][location],tsp(status-mask,i)+graph[i][location]);

}

return dp[status][location];

}

int main()

{

int dx[8]={1,0,0,-1,1,1,-1,-1};

int dy[8]={0,1,-1,0,1,-1,-1,1};

while(cin>>h)

{

cin>>w;

if(h+w==0)

break;

for(int i=0;i<h;i++)

cin>>str[i];

memset(graph,0,sizeof(graph));

int res = 0;

for(int i=0;i<h;i++)

{

for(int j=0;j<w;j++)

{

if(str[i][j]=='~')

{

str[i][j]='#';

}

else if(str[i][j]=='*')

{

str[i][j]='#';

for(int l=0;l<8;l++)

{

if(i+dx[l]<0 || i+dx[l]>=h)

continue;

if(j+dy[l]<0 || j+dy[l]>=w)

continue;

if(str[i+dx[l]][j+dy[l]]=='!' || str[i+dx[l]][j+dy[l]]=='@')

res = -1;

if(str[i+dx[l]][j+dy[l]]!='*')

str[i+dx[l]][j+dy[l]]='#';

}

if(res==-1)

{

cout<<-1<<"\n";

continue;

}

k = 0;

location = -1; target = -1;

for(int i=0;i<h;i++)

{

for(int j=0;j<w;j++)

{

if(str[i][j]=='!')

{

pp[k].x = i; pp[k].y = j; k+=1;

}

else if(str[i][j]=='@')

{

location = k;

pp[k].x = i; pp[k].y = j; k+=1;

}

if(k==1)

{

cout<<0<<"\n";

continue;

}

for(int i=0;i<k;i++)

{

for(int j=i+1;j<k;j++)

{

graph[i][j]=bfs(i,j);

graph[j][i] = graph[i][j];

}

dp = vector< vector< int > >(1<<k,vector<int>(k,-1));

for(int i=0;i<k;i++)

dp[1<<i][i]=graph[location][i];

res = tsp((1<<(k))-1,location);

if(res>=INF)

{

cout<<-1<<"\n";

continue;

}

cout<<res<<"\n";

}

return 0;

}

10944

Asif NaeemFebruary 1, 2015

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstdlib>

#define INF 1000
using namespace std;

vector<vector<int> > dp;
int dis[25][25];

struct point{
int x;
int y;
};
point pp[405];
int x,y;
int k;
string s;
bool visit[25];
int location;
int MX;

/*
int trace(int a,int dist)
{
	visit[a]=1;
	bool f=false;
	for(int i=1;i<k;i++)
	{
		if(!visit[i])
		{
			trace(i,dist+dis[a][i]);
			visit[i]=0;
			f=1;
		}
	}
	if(!f)
	{
		int tmp = dist+dis[a][location];
		if(tmp<MX)
		MX = tmp;
	}
	return 0;
}
*/
int tsp(int status,int src)
{
	if(dp[status][src]!=-1)
	return dp[status][src];

	dp[status][src] = 1e9;

	int mask = 1<<src;

	for(int i=0;i<k;i++)
	{
		if(i!=src && (status & (1<<i)))
		dp[status][src]= min(dp[status][src],tsp(status-mask,i)+dis[i][src]);
	}
	return dp[status][src];
}

int main()
{
	while(scanf("%d %d",&x,&y)!=EOF)
	{
		k=0;
		for(int i=0;i<x;i++)
		{
			cin>>s;
			for(int j=0;j<s.size();j++)
			{
				if(s[j]=='L')
				{
					pp[k].x = i;
					pp[k].y = j;
					location = k;
					k++;
				}
				else if(s[j]=='#')
				{
					pp[k].x = i;
					pp[k].y = j;
					k++;
				}
			}
		}

		for(int i=0;i<k;i++)
		{
			for(int j=0;j<k;j++)
			{
				if(i==j)
				dis[i][j] = 0;
				else
				{
					int d = abs(pp[i].x-pp[j].x);
					int dd = abs(pp[i].y-pp[j].y);
					dis[i][j] = max(d,dd);
				}
			}
		}

		/*MX = INF;
		********This is backtrack algo but gets TLE******
		trace(location,0);
		visit[location]=0;
		cout<<MX<<"\n";
		*/
		dp = vector< vector< int > >(1<<k,vector<int>(k,-1));
		for(int i=0;i<k;i++)
			dp[1<<i][i]=dis[location][i];

		cout<<tsp((1<<(k))-1,location)<<"\n";
	}
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

#include <iostream>

#include <cstdio>

#include <vector>

#include <cstdlib>

#define INF 1000

using namespace std;

vector<vector<int> > dp;

int dis[25][25];

struct point{

int x;

int y;

};

point pp[405];

int x,y;

int k;

string s;

bool visit[25];

int location;

int MX;

int trace(int a,int dist)

{

visit[a]=1;

bool f=false;

for(int i=1;i<k;i++)

{

if(!visit[i])

{

trace(i,dist+dis[a][i]);

visit[i]=0;

f=1;

}

if(!f)

{

int tmp = dist+dis[a][location];

if(tmp<MX)

MX = tmp;

}

return 0;

}

int tsp(int status,int src)

{

if(dp[status][src]!=-1)

return dp[status][src];

dp[status][src] = 1e9;

int mask = 1<<src;

for(int i=0;i<k;i++)

{

if(i!=src && (status & (1<<i)))

dp[status][src]= min(dp[status][src],tsp(status-mask,i)+dis[i][src]);

}

return dp[status][src];

}

int main()

{

while(scanf("%d %d",&x,&y)!=EOF)

{

k=0;

for(int i=0;i<x;i++)

{

cin>>s;

for(int j=0;j<s.size();j++)

{

if(s[j]=='L')

{

pp[k].x = i;

pp[k].y = j;

location = k;

k++;

}

else if(s[j]=='#')

{

pp[k].x = i;

pp[k].y = j;

k++;

}

for(int i=0;i<k;i++)

{

for(int j=0;j<k;j++)

{

if(i==j)

dis[i][j] = 0;

else

{

int d = abs(pp[i].x-pp[j].x);

int dd = abs(pp[i].y-pp[j].y);

dis[i][j] = max(d,dd);

}

/*MX = INF;

********This is backtrack algo but gets TLE******

trace(location,0);

visit[location]=0;

cout<<MX<<"\n";

dp = vector< vector< int > >(1<<k,vector<int>(k,-1));

for(int i=0;i<k;i++)

dp[1<<i][i]=dis[location][i];

cout<<tsp((1<<(k))-1,location)<<"\n";

}

return 0;

}

Category: TSP

112

10937

10944

Archives

Categories