void Traveler::WidenCities(int w)
{
	//INIT POMOCNICZE
	int **path2 = new int*[t];

	int ***cities2 = new int**[t]; //[]
	cities2[0] = new int*[N[0]];
	for (int j = 0; j < N[0]; j++)
	{
		cities2[0][j] = new int[N[0]]; //[][][]
	}

	for (int i = 0; i < t; i++)
	{
		path2[i] = new int[2 * N[0]];
	}

	int *LB2 = new int[t];
	int *status2 = new int[t];
	int *N2 = new int[t];
	int *C2 = new int[t];

	//KOPIUJ DO POMOCNICZYCH
	for (int i = 0; i < t; i++)
	{
		for (int j = 0; j < 2 * N[0]; j++)
		{
			path2[i][j] = path[i][j];
		}
	}
	for (int i = 0; i < t; i++)
	{
		for (int j = 0; i < N[0]; j++)
		{
			for (int k = 0; k < N[0]; k++)
			{
				cities2[i][j][k] = cities[i][j][k];
			}
		}
	}

	for (int i = 0; i < t; i++)
	{
		LB2[i] = LB[i];
		status2[i] = status[i];
		N2[i] = N[i];
		C2[i] = C[i];
	}
	//DELETE 1
	for (int i = 0; i < w; i++)
	{
		for (int j = 0; j < w; j++)
		{
			delete[] cities[i][j];
		}
	}
	for (int i = 0; i < t; i++)
	{
		delete[] cities[i];
	}
	delete[] cities;

	for (int i = 0; i < 2 * N[0]; i++)
	{
		delete[] path[i];
	}
	delete[] path;
	delete[] LB;
	delete[] N;
	delete[] C;
	delete[] status;
	//INIT PIERWSZE
	t += t;

	path = new int*[t];

	cities = new int**[t]; //[]
	cities[0] = new int*[N2[0]];
	for (int j = 0; j < N2[0]; j++)
	{
		cities[0][j] = new int[N2[0]]; //[][][]
	}

	for (int i = 0; i < t; i++)
	{
		path[i] = new int[2 * N2[0]];
	}

	for (int i = 0; i < t; i++)
	{
		for (int j = 0; j < 2 * N2[0]; j++)
		{
			path[i][j] = 0;
		}
	}

	LB = new int[t];
	status = new int[t];
	N = new int[t];
	C = new int[t];

	for (int i = 0; i < t; i++)
	{
		LB[i] = 0;
		status[i] = 0;
		N[i] = 0;
		C[i] = 0;
	}

	//KOPIUJ Z POMOCNICZYCH
	for (int i = 0; i < t/2; i++)
	{
		for (int j = 0; j < 2 * N2[0]; j++)
		{
			path[i][j] = path2[i][j];
		}
	}
	for (int i = 0; i < t/2; i++)
	{
		for (int j = 0; i < N2[0]; j++)
		{
			for (int k = 0; k < N2[0]; k++)
			{
				cities[i][j][k] = cities2[i][j][k];
			}
		}
	}

	for (int i = 0; i < t/2; i++)
	{
		LB[i] = LB2[i];
		status[i] = status2[i];
		N[i] = N2[i];
		C[i] = C2[i];
	}
	//USUN POMOCNICZE
	for (int i = 0; i < w; i++)
	{
		for (int j = 0; j < w; j++)
		{
			delete[] cities2[i][j];
		}
	}
	for (int i = 0; i < t/2; i++)
	{
		delete[] cities2[i];
	}
	delete[] cities2;

	for (int i = 0; i < 2 * N[0]; i++)
	{
		delete[] path2[i];
	}
	delete[] path2;
	delete[] LB2;
	delete[] N2;
	delete[] C2;
	delete[] status2;

}