OJ Board

Posted: **Tue Nov 18, 2008 11:13 am**

My algo is
run floyd to find shortest path.
Run TSP on graph with vertices as opera store1,opera store2 ... with starting as vertex 0.

What is wrong in my code ? I tried all the inputs in the forum and on uvatoolkit . All of them given correct answers from uvatoolkit. Can you please suggest what is wrong in this code ? Any inputs that gets it wrong ?

Code: Select all

Removed after  getting AC thanks darko 
 2 things learnt
1) multiple edges between 2 vertices , so store the smallest cost 
ie 1 3 5 , 1 3 4  , 1 3 6 input , store 1->3 (cost 4)
2) precision precision add EPS, do conversions in integers until end.

Posted: **Tue Nov 18, 2008 5:40 pm**

There might be more than one road connecting two places. And there is a precision issue there, too.

This is too close to AC, please remove the code after you get it

Posted: **Sun Aug 21, 2011 7:53 am**

Hello, I have tried anything suggested before and still got WA
Here is my code

Code: Select all

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
using namespace std;

typedef pair<int,int> ii;
typedef long long LL;

#define INF 1000000000
#define PI 3.14159265

#define FOR(i,a,n) for(int i=a,_n=n; i<_n; i++)
#define FOREACH(it,arr) for (__typeof((arr).begin()) it=(arr).begin(); it!=(arr).end(); it++)

#define DEBUG(x) cout << '>' << #x << ':' << x << '\n';

int arr[55][55];
int n_store;
int price[15];  
int memo[1<<12][15];
map <int, int> store;

int f(int aa, int last){
    if ( memo[aa][last] != -1 ) return memo[aa][last];
    
    int ret = 0;
    FOR (i, 0, n_store){
        if ( ( (1<<i) | aa )  == aa ) continue;
        int next = store[i]; int prev = store[last];
        int benefit = f(( 1<<i) | aa, i) + price[i] - arr[prev][next];
        if ( benefit > ret ) ret = benefit;    
    }  
    
    if ( ret == 0 ) ret -= arr[store[last]][0];
    
    return memo[aa][last] = ret;     
}

int main(){
    int t; scanf("%d", &t);
    
    while (t--){
          memset(memo, -1, sizeof memo);
          store.clear();
          FOR (i, 0, 55) FOR (j, 0, 55) arr[i][j] = INF;
          FOR (i, 0, 55) arr[i][i] = 0;
          
          int n, m; scanf("%d %d", &n, &m);
          
          FOR (i, 0, m){
              int a, b, xx, yy;
              scanf("%d %d %d.%d", &a, &b, &xx, &yy);
              int temp = (xx*100) + yy;
              arr[a][b] = min(arr[a][b], temp);
              arr[b][a] = min(arr[b][a], temp);   
          }      
          
          FOR (k, 0, n+1){
              FOR (i, 0, n+1){
                  FOR (j, 0, n+1){
                      arr[i][j] = min(arr[i][j], arr[i][k]+arr[k][j]);    
                  }    
              }    
          }
          
          scanf("%d", &n_store);
          FOR (i, 0, n_store){
              int xx, yy, a;
              scanf("%d %d.%d",&a, &xx, &yy);
              store[i] = a;
              price[i] = (xx*100) + yy;    
          }
          
          int ret = 0; 
          FOR (i, 0, n_store){
              int next = store[i];
              int benefit = f(1<<i, i) + price[i] - arr[0][next];
              if ( benefit > ret )ret = benefit;    
          }
          
          if ( ret <= 0 ) puts("Don't leave the house");
          else{
               int xx = ret/100; int yy = ret%100;
               printf("Daniel can save $%d.%02d\n", xx, yy);     
          }
    }
    
    return 0;
}

Is there any critical input that i might miss? thx before

Posted: **Wed Oct 19, 2011 7:01 pm**

@FelixP

For any particular opera, he can opt not to drive to the store to buy it, since he can just order it from Amazon.

May your algorithm didn't cover it.

Posted: **Wed Feb 13, 2013 11:12 am**

I used Floyd then ran tsp on this problem.
I didn't use floats and only worked with integer numbers but still no luck in getting AC.

My program outputs the correct answer for sample inputs in the forum and question.
Can anyone give me some input that on which it fails or some hints on the glitch it has???
Thanks in advance.

Code: Select all

#include <cstdio>
#include <math.h>
#include <cstring>
#include <algorithm>

#define INF 100000000

using namespace std;

int N/*stores*/, M/*roads*/, P/*number of DVDs*/, finalMask;
int minDistances[52][52]; //after floyd is done
int memo[14][5000]; //for tsp
int dvdsInfo[15][2]; /* dvd place/amount we can save */

void floyd(){
	int I, J, K;
	for(K=1; K<=N; K++)
		for(I=0; I<=N; I++)
			for(J=0; J<=N; J++)
				minDistances[I][J] = min(minDistances[I][J], minDistances[I][K]+minDistances[K][J]);
}

int tsp(int di, int collDVDs){ //DVD index & collected DVDs
	if(collDVDs == finalMask)
		return minDistances[ dvdsInfo[di][0] ][0]; //returing from last DVDs store to the home
	if(memo[di][collDVDs]!=-1)
		return memo[di][collDVDs];

	int diS=dvdsInfo[di][0], ndS;
	int minDst = INF, dst;
	for(int nd=1; nd<=P; nd++){
		if(nd!=di && !( (1<<nd) & collDVDs )){
			ndS = dvdsInfo[nd][0];
			dst = minDistances[diS][ndS] + tsp(nd, (1<<nd) | collDVDs);
			if(dst<minDst)
				minDst = dst;
		}
	}

	return memo[di][collDVDs] = minDst;
}


int main(){
#ifndef ONLINE_JUDGE
	freopen("J:\\acm\\shoptrip.in", "r", stdin);
	//freopen("J:\\acm\\pricetown.out", "w", stdout);
#endif // !ONLINE_JUDGE
	int TC, f, t, I, J, selDVDs;
	int tmp1, tmp2;
	int maxMoney, dst, diffPrices;
	char fpart[3]={0};

	scanf("%d", &TC);
	dvdsInfo[0][0] = 0;
	while( TC-- ){
		scanf("\n");
		scanf("%d %d", &N, &M);
		//memset(minDistances, 1, sizeof(minDistances));
		memset(memo, -1, sizeof(memo));
		for(I=0; I<=N; I++){
			for(J=0; J<=N; J++)
				minDistances[I][J] = INF;
			minDistances[I][I] = 0;
		}

		for(I=0; I<M; I++){
			scanf("%d %d", &f, &t);
			scanf("%d.%d", &tmp1, &tmp2);
			tmp1 = 100*tmp1 + tmp2;
			if(minDistances[f][t] > tmp1)
				minDistances[t][f] = minDistances[f][t] = tmp1;
		}

		scanf("%d", &P);
		for(I=1; I<=P; I++){
			scanf("%d %d.%d", &dvdsInfo[I][0], &tmp1, &tmp2);
			dvdsInfo[I][1] = 100*tmp1 + tmp2;
		}
		floyd();

		maxMoney = 0;
		finalMask = (1<<(P+1))-1;
		for(I=1; I<finalMask-1; I++){
			dst = tsp(0, (I | 1));
			diffPrices = 0;

			for(J=1; J<=P; J++)
				if( !(I & (1<<J)) )
					diffPrices += dvdsInfo[J][1];

			diffPrices -= dst;
			if(diffPrices>maxMoney)
				maxMoney = diffPrices;
		}

		if(maxMoney > 0 && maxMoney<INF){
			tmp1 = maxMoney/100;
			maxMoney%=100;
			fpart[0] = (maxMoney/10)+'0';
			fpart[1] = (maxMoney%10)+'0';
			printf("Daniel can save $%d.%s\n", tmp1, fpart );
		}else
			printf("Don't leave the house\n");
	}

	return 0;
}

Posted: **Wed Feb 13, 2013 6:25 pm**

@AKJ88: try this input:

Code: Select all

The output should be:

Code: Select all

Daniel can save $0.02

Posted: **Thu Feb 14, 2013 10:35 am**

@felix_halim
Thanks for your reply, I didn't take into account situations that he could buy sth, come back home and go for another shop!!!:)
Now I handle these cases correctly but still no luck! Sorry to bother you but would you please give me another test case for which my program fails???
Thanks in advance.
My new code is here:

Code: Select all

#include <cstdio>
#include <math.h>
#include <cstring>
#include <algorithm>

#define INF 10000000

using namespace std;

int N/*stores*/, M/*roads*/, P/*number of DVDs*/, finalMask;
int minDistances[52][52]; //after floyd is done
int memo[14][5000]; //for tsp
int dvdsInfo[15][2]; /* dvd place/amount we can save */

void floyd(){
	int I, J, K;
	for(K=1; K<=N; K++)
		for(I=0; I<=N; I++)
			for(J=0; J<=N; J++)
				minDistances[I][J] = min(minDistances[I][J], minDistances[I][K]+minDistances[K][J]);
}

int tsp(int di, int collDVDs){ //DVD index & collected DVDs
	if(collDVDs == finalMask)
		return minDistances[ dvdsInfo[di][0] ][0]; //returing from last DVDs store to the home
	if(memo[di][collDVDs]!=-1)
		return memo[di][collDVDs];

	int diS=dvdsInfo[di][0], ndS;
	int minDst = INF, dst;
	for(int nd=1; nd<=P; nd++){
		if(nd!=di && !( (1<<nd) & collDVDs )){
			ndS = dvdsInfo[nd][0];
			dst = minDistances[diS][ndS] + tsp(nd, (1<<nd) | collDVDs);
			if(dst<minDst)
				minDst = dst;
		}
	}

	return memo[di][collDVDs] = minDst;
}


int main(){
#ifndef ONLINE_JUDGE
	freopen("J:\\acm\\shoptrip.in", "r", stdin);
	//freopen("J:\\acm\\pricetown.out", "w", stdout);
#endif // !ONLINE_JUDGE
	int TC, f, t, I, nI, J, selDVDs;
	int tmp1, tmp2;
	int maxMoney, dst1, dst2, diffPrices1, diffPrices2, diffPrices;
	char fpart[3]={0};

	scanf("%d", &TC);
	dvdsInfo[0][0] = 0;
	while( TC-- ){
		scanf("\n");
		scanf("%d %d", &N, &M);
		memset(memo, -1, sizeof(memo));
		for(I=0; I<=N; I++){
			for(J=0; J<=N; J++)
				minDistances[I][J] = INF;
			minDistances[I][I] = 0;
		}

		for(I=0; I<M; I++){
			scanf("%d %d", &f, &t);
			scanf("%d.%d", &tmp1, &tmp2);
			tmp1 = 100*tmp1 + tmp2;
			if(minDistances[f][t] > tmp1)
				minDistances[t][f] = minDistances[f][t] = tmp1;
		}

		scanf("%d", &P);
		for(I=1; I<=P; I++){
			scanf("%d %d.%d", &dvdsInfo[I][0], &tmp1, &tmp2);
			dvdsInfo[I][1] = 100*tmp1 + tmp2;
		}
		floyd();

		maxMoney = 0;
		finalMask = (1<<(P+1))-1;
		for(I=1; I<finalMask-1; I++){
			dst1 = tsp(0, I|1);
			nI = ~I & finalMask;
			dst2 = tsp(0, nI|1);

			diffPrices1 = 0;
			diffPrices2 = 0;
			for(J=1; J<=P; J++)
				if( !(I & (1<<J)) )
					diffPrices1 += dvdsInfo[J][1];
				else if( !(nI & (1<<J)) )
					diffPrices2 += dvdsInfo[J][1];

			if(dst1 > 0)
				diffPrices1 -= dst1;
			if(dst2 > 0)
				diffPrices2 -= dst2;
			diffPrices = 0;
			if(diffPrices1 > 0)
				diffPrices += diffPrices1;
			if(diffPrices2 > 0)
				diffPrices += diffPrices2;
			if(diffPrices>maxMoney)
				maxMoney = diffPrices;
		}

		if(maxMoney > 0 && maxMoney<INF){
			tmp1 = maxMoney/100;
			maxMoney%=100;
			fpart[0] = (maxMoney/10)+'0';
			fpart[1] = (maxMoney%10)+'0';
			printf("Daniel can save $%d.%s\n", tmp1, fpart );
		}else
			printf("Don't leave the house\n");
	}

	return 0;
}

Posted: **Thu Feb 14, 2013 4:26 pm**

You haven't solved the coming home problem:

Code: Select all

Code: Select all

Daniel can save $0.03

Posted: **Wed Jul 31, 2013 4:36 am**

I keep getting WA, help please !!

Code: Select all


#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define lowBit(S) (S & (-S))
#define setAll(S, n) (S = (1 << n) - 1)

using namespace std;


int n, m, p, storeIndex[15];
double dist[55][55], memo[55][1 << 13], storesDVD[15];

double tsp(int pos, int bitmask) {
    if (bitmask == (1 << (p + 1)) - 1)
        return dist[pos][0] * -1.0;
    if (memo[pos][bitmask] != -1) return memo[pos][bitmask];


    double ans = INF_MIN, temp, temp1, temp2;

    for (int i = 0; i <= p; i++) {
        if (!isOn(bitmask, i)) {
            int dIn = storeIndex[i];
            double d = dist[pos][storeIndex[i]];
            double storePrice = storesDVD[storeIndex[i]];
            temp = storesDVD[storeIndex[i]] - dist[pos][storeIndex[i]];
            temp1 = temp + tsp(storeIndex[i], bitmask | (1 << i));
            ans = max(ans, temp1);

        }
    }

    temp2 = tsp(pos, (1 << (p + 1)) - 1);
    ans = max(ans, temp2);

    return memo[pos][bitmask] = ans;
}

int main(int argc, char** argv) {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d %d", &n, &m);

        for (int i = 0; i <= n; i++)
            for (int j = 0; j <= n; j++)
                dist[i][j] = INF_MAX;

        Set(storesDVD, 0);
        Set(storeIndex, 0);

        for (int i = 0; i < 55; i++)
            for (int j = 0; j < (1 << 13); j++)
                memo[i][j] = -1;

        int a, b;
        double cost;
        for (int i = 0; i < m; i++) {
            scanf("%d %d %lf", &a, &b, &cost);
            dist[a][b] = min(dist[a][b], cost);
            dist[b][a] = min(dist[b][a], cost);
        }

        for (int k = 0; k <= n; k++)
            for (int i = 0; i <= n; i++)
                for (int j = 0; j <= n; j++)
                    if (dist[i][k] != INF_MAX && dist[k][j] != INF_MAX) {
                        if (i == j)
                            dist[i][j] = 0;
                        else
                            dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
                    }


        double totalSaved = 0;
        scanf("%d", &p);
        int countRep = 0;
        for (int i = 1; i <= p; i++) {
            scanf("%d %lf", &a, &cost);
            if (storesDVD[a]) {
                countRep++;
            }else
                storeIndex[i - countRep] = a;
            storesDVD[a] += cost;
            totalSaved += cost;
        }
        
        p -= countRep;

        double ans = tsp(0, 1);

        if (ans <= 0)
            printf("Don't leave the house\n");
        else
            printf("Daniel can save $%.2lf\n", ans);
    }
    return 0;
}

Posted: **Wed Jul 31, 2013 8:32 am**

try solving it without using floating point.

Posted: **Wed Jul 31, 2013 4:18 pm**

@brianfry Still WA

Code: Select all

#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define lowBit(S) (S & (-S))
#define setAll(S, n) (S = (1 << n) - 1)

using namespace std;

/*
 * 
 */

int n, m, p, storeIndex[15];
long long dist[55][55], memo[55][1 << 13], storesDVD[15];

long long tsp(int pos, int bitmask) {
    if (bitmask == (1 << (p + 1)) - 1)
        return dist[pos][0] * -1;
    if (memo[pos][bitmask] != -1) return memo[pos][bitmask];


    long long ans = INF_MIN, temp, temp1, temp2;

    for (int i = 0; i <= p; i++) {
        if (!isOn(bitmask, i)) {
            int dIn = storeIndex[i];
            long long d = dist[pos][storeIndex[i]];
            long long storePrice = storesDVD[storeIndex[i]];
            temp = storesDVD[storeIndex[i]] - dist[pos][storeIndex[i]];
            temp1 = temp + tsp(storeIndex[i], bitmask | (1 << i));
            ans = max(ans, temp1);

        }
    }

    temp2 = tsp(pos, (1 << (p + 1)) - 1);
    ans = max(ans, temp2);

    return memo[pos][bitmask] = ans;
}

int main(int argc, char** argv) {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d %d", &n, &m);

        for (int i = 0; i <= n; i++)
            for (int j = 0; j <= n; j++)
                dist[i][j] = INF_MAX;

        Set(storesDVD, 0);
        Set(storeIndex, 0);

        for (int i = 0; i < 55; i++)
            for (int j = 0; j < (1 << 13); j++)
                memo[i][j] = -1;




        int a, b, c, d;
        for (int i = 0; i < m; i++) {
            scanf("%d %d %d.%d", &a, &b, &c, &d);
            long long x = 100 * c + d;
            dist[a][b] = min(dist[a][b], x);
            dist[b][a] = min(dist[b][a], x);
        }

        for (int k = 0; k <= n; k++)
            for (int i = 0; i <= n; i++)
                for (int j = 0; j <= n; j++)
                    if (dist[i][k] != INF_MAX && dist[k][j] != INF_MAX) {
                        if (i == j)
                            dist[i][j] = 0;
                        else
                            dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
                    }


        double totalSaved = 0;
        scanf("%d", &p);
        int countRep = 0;
        for (int i = 1; i <= p; i++) {
            scanf("%d %d.%d", &a, &c, &d);
            if (storesDVD[a]) {
                countRep++;
            }else
                storeIndex[i - countRep] = a;
            long long x = 100 * c + d;
            storesDVD[a] += x;
            totalSaved += x;
        }
        
        p -= countRep;

        long long ans = tsp(0, 1);
        
        if (ans <= 0)
            printf("Don't leave the house\n");
        else{
            int ansMod = ans % 100;
            int div = ans/100;
            printf("Daniel can save $%d.%02d\n", div, ansMod);
        }
    }
    return 0;
}

Posted: **Wed Jul 31, 2013 8:14 pm**

From uhunt:
AKJ88> a.elbashandy, I thinks I realized the reason you get WA. Store numbers and those which have dvds are somehow mixed in your code. In your tsp function you use both pos and storesindex for getting dist. pos is not always a dvd store
AKJ88> unless you make an extra matrix for saving minimum distance between dvd stores and don't use dist matrix.

Posted: **Thu Aug 01, 2013 5:13 am**

AKJ88 Yes i use extra matrix for saving minimum distance between dvd stores and the initial position only

Posted: **Fri Aug 02, 2013 12:14 am**

Input:

Code: Select all

AC output:

Code: Select all

Daniel can save $12.08
Don't leave the house
Don't leave the house
Daniel can save $1.66
Daniel can save $3.96
Daniel can save $0.99
Daniel can save $11.71
Daniel can save $15.15
Daniel can save $18.55
Daniel can save $15.32

Posted: **Fri Apr 25, 2014 5:57 pm**

Can someone help me see what is wrong? I keep getting WA with all my variables integers. Is it possible to get the value out of 32-bit integer?

Code: Select all

#include <cstdio>
#include <cstring>

#define MAXIN (1 << 30) - 1;

int a[51][51];
int b[13][2];
int c[13][13];
int d[1<<13][13];
int ok[1<<13][13];
int best;

int dp(int s, int m, int k, int n) {
    int t;
    int i;
    
    if (ok[s][k])
        return d[s][k];
    if (m == 1)
        return c[0][k] - b[k][1];
    for (i = 1; i <= n; i++) {
        if (i != k && (s & (1 << i))) {
            t = dp(s ^ (1 << k), m-1, i, n) + c[i][k] - b[k][1];
            if (t < d[s][k]) {
                d[s][k] = t;
                ok[s][k] = 1;
            }
        }
    }
    if (d[s][k] + c[k][0] < best)
        best = d[s][k] + c[k][0];
    return d[s][k];
}

int main()
{
    int se, n, m, p, i, j, k, s, fl, x, y;
    int t;
    
    scanf("%d", &se);
    while (se--) {
        for (i = 0; i < 51; i++)
            for (j = 0; j < 51; j++)
                a[i][j] = MAXIN;
        memset(b, 0, sizeof(b));
        memset(c, 0, sizeof(c));
        memset(ok, 0, sizeof(ok));
        for (i = 0; i < 1 << 13; i++)
            for (j = 0; j < 13; j++)
                d[i][j] = MAXIN;
        scanf("%d %d", &n, &m);
        for (i = 0; i <= n; i++)
            a[i][i] = 0;
        while (m--) {
            scanf("%d %d %d.%d", &i, &j, &x, &y);
            t = x * 100 + y;
            if (t < a[i][j])
                a[i][j] = a[j][i] = t;
        }
        for (k = 0; k <= n; k++)
            for (i = 0; i <= n; i++)
                for (j = 0; j <= n; j++)
                    if (a[i][j] > a[i][k] + a[k][j])
                        a[i][j] = a[i][k] + a[k][j];
        scanf("%d", &p);
        s = 0;
        while (p--) {
            scanf("%d %d.%d", &k, &x, &y);
            t = x * 100 + y;
            for (i = 1; i <= s; i++) {
                fl = 0;
                if (b[i][0] == k) {
                    b[i][1] += t;
                    fl = 1;
                    break;
                }
            }
            if (!fl) {
                b[++s][0] = k;
                b[s][1] = t;
            }
        }
        b[0][0] = 0;
        b[0][1] = 0;
        for (i = 0; i <= s; i++)
            for (j = 0; j <= s; j++)
                c[i][j] = a[b[i][0]][b[j][0]];
        best = MAXIN;
        d[1][0] = 0;
        for (i = 1; i <= s; i++)
            dp((1 << (s+1)) - 1, s, i, s);
        if (best < 0) {
            best = -best;
            if (best % 100 < 10)
                printf("Daniel can save $%d.0%d\n", best / 100, best % 100);
            else
                printf("Daniel can save $%d.%d\n", best / 100, best % 100);
        }
        else
            printf("Don't leave the house\n");
    }
    return 0;
}

OJ Board

11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip

Re: 11284 - Shopping Trip