Egalitarianism3Easy.cpp

/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef unsigned long long LLU;

#define ft        first
#define sd        second
#define mp        make_pair
#define pb(x)     push_back(x)
#define all(x)    x.begin(), x.end()
#define allr(x)   x.rbegin(), x.rend()
#define mem(a, b) memset(a, b, sizeof(a))
#define meminf(a) memset(a, 126, sizeof(a))
#define inf       1e6
#define eps       1e-9
#define mod       1000000007
#define NN        1010

// cout << setfill('0') << setw(3) << a << endl;
// cout << fixed << setprecision(20) << a << endl;

int ans = 0;

int e[20][20];

vector<int> v;

int rec(int pos) {
    if (pos < 1) {
        int i, j, ret = 0, d = 0, fl = 1;
        if (v.size() > 1) {
            d = e[v[0]][v[1]];
        }
        for (i = 0; i < v.size() && fl; i++)
            for (j = 0; j < v.size() && fl; j++) {
                int k = v[i];
                int l = v[j];
                if (k == l) continue;
                if (e[k][l] != d || e[l][k] != d) {
                    fl = 0;
                }
            }
        d = v.size();
        // cout<<d;
        if (fl) ans = max(ans, d);
        return 0;
    }

    rec(pos - 1);

    v.pb(pos);
    rec(pos - 1);
    v.pop_back();

    return 0;
}

struct Egalitarianism3Easy {
    int maxCities(int n, vector<int> a, vector<int> b, vector<int> len) {
        int ret;
        int i, j, k;
        for (i = 0; i < 15; i++)
            for (j = 0; j < 15; j++) {
                e[i][j] = inf;
                if (i == j) e[i][j] = 0;
            }
        for (i = 0; i < a.size(); i++) {
            j = a[i];
            k = b[i];
            e[j][k] = len[i];
            e[k][j] = len[i];
        }
        for (k = 1; k <= n; k++)
            for (i = 1; i <= n; i++)
                for (j = 1; j <= n; j++) e[i][j] = min(e[i][j], e[i][k] + e[k][j]);
        ans = 0;
        rec(n);
        ret = ans;
        return ret;
    }

    // BEGIN CUT HERE
public:
    void run_test(int Case) {
        if ((Case == -1) || (Case == 0)) test_case_0();
        if ((Case == -1) || (Case == 1)) test_case_1();
        if ((Case == -1) || (Case == 2)) test_case_2();
        if ((Case == -1) || (Case == 3)) test_case_3();
        if ((Case == -1) || (Case == 4)) test_case_4();
    }

private:
    template <typename T>
    string print_array(const vector<T>& V) {
        ostringstream os;
        os << "{ ";
        for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\",";
        os << " }";
        return os.str();
    }
    void verify_case(int Case, const int& Expected, const int& Received) {
        cerr << "Test Case #" << Case << "...";
        if (Expected == Received)
            cerr << "PASSED" << endl;
        else {
            cerr << "FAILED" << endl;
            cerr << "\tExpected: \"" << Expected << '\"' << endl;
            cerr << "\tReceived: \"" << Received << '\"' << endl;
        }
    }
    void test_case_0() {
        int Arg0 = 4;
        int Arr1[] = {1, 1, 1};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arr2[] = {2, 3, 4};
        vector<int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
        int Arr3[] = {1, 1, 1};
        vector<int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
        int Arg4 = 3;
        verify_case(0, Arg4, maxCities(Arg0, Arg1, Arg2, Arg3));
    }
    void test_case_1() {
        int Arg0 = 6;
        int Arr1[] = {1, 2, 3, 2, 3};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arr2[] = {2, 3, 4, 5, 6};
        vector<int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
        int Arr3[] = {2, 1, 3, 2, 3};
        vector<int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
        int Arg4 = 3;
        verify_case(1, Arg4, maxCities(Arg0, Arg1, Arg2, Arg3));
    }
    void test_case_2() {
        int Arg0 = 10;
        int Arr1[] = {1, 1, 1, 1, 1, 1, 1, 1, 1};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arr2[] = {2, 3, 4, 5, 6, 7, 8, 9, 10};
        vector<int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
        int Arr3[] = {1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000};
        vector<int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
        int Arg4 = 9;
        verify_case(2, Arg4, maxCities(Arg0, Arg1, Arg2, Arg3));
    }
    void test_case_3() {
        int Arg0 = 2;
        int Arr1[] = {1};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arr2[] = {2};
        vector<int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
        int Arr3[] = {3};
        vector<int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
        int Arg4 = 2;
        verify_case(3, Arg4, maxCities(Arg0, Arg1, Arg2, Arg3));
    }
    void test_case_4() {
        int Arg0 = 1;
        int Arr1[] = {};
        vector<int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
        int Arr2[] = {};
        vector<int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
        int Arr3[] = {};
        vector<int> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
        int Arg4 = 1;
        verify_case(4, Arg4, maxCities(Arg0, Arg1, Arg2, Arg3));
    }

    // END CUT HERE
};

// BEGIN CUT HERE
int main() {
    Egalitarianism3Easy ___test;
    ___test.run_test(-1);
    int gbase;
    cin >> gbase;  // erase this line if you are not using dev-cpp! :)
    return 0;
}
// END CUT HERE