Cod sursa(job #2302379)

Utilizator pavel1289Benescu Pavel pavel1289 Data 14 decembrie 2018 15:33:35
Problema Dusman Scor 20
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.43 kb
#include <iostream>
#include <fstream>
using namespace std;

struct dusman
{
    int a, b;
};

void backtracking_submultimi(int v[100], int k, int n)
{
    if (k == n + 1)
    {
        for(int i = 1; i <= v[0]; i++)
            cout<<v[i]<<" ";
        cout<<endl;
        return ;
    }
    v[++v[0]] = k;
    backtracking_submultimi(v, k + 1, n);
    v[0]--;
    backtracking_submultimi(v, k + 1, n);
}

void backtracking_permutari(int v[100], int k, int n)
{
    if (k == n + 1)
    {
        for(int i = 1; i <= n; i++)
            cout<<v[i]<<" ";
        cout<<endl;
        return ;
    }
    int o = 0;
    while (o == 0 && v[k] < n)
    {
        v[k]++;
        o = 1;
        for(int i = 1; i < k; i++)
            if (v[i] == v[k])
            {
                o = 0;
                break;
            }
        if (o == 1)
            backtracking_permutari(v, k + 1, n);
        o = 0;
    }
    v[k] = 0;
}

void citire(dusman x[3001], int &n, int &k, int &m)
{
    ifstream f("dusman.in");
    f>>n>>k>>m;
    for(int i = 1; i <= m; i++)
    {
        f>>x[i].a>>x[i].b;
    }
}

void back_dusman(int v[1001], int k, int n, int m, dusman x[3001], int &j, int K)
{
    if (k == n + 1)
    {
        j++;
        if (j == K)
        {
            ofstream g("dusman.out");
            for(int i = 1; i <= n; i++)
                g<<v[i]<<" ";
            return ;
        }
        return ;
    }
    if (j == K)
        return ;
    int o = 0;
    while (o == 0 && v[k] < n)
    {
        v[k]++;
        o = 1;
        for(int i = 1; i < k; i++)
            if (v[i] == v[k])
            {
                o = 0;
                break;
            }
        if (o == 1)
        {
            for(int i = 1; i <= m; i++)
            {
                if ((v[k] == x[i].a || v[k] == x[i].b) && (v[k - 1] == x[i].a || v[k - 1] == x[i].b) && k > 1)
                {
                    o = 0;
                    break;
                }
            }
        }
        if (o == 1)
            back_dusman(v, k + 1, n, m, x, j, K);
        o = 0;
    }
    v[k] = 0;
}

int main()
{
    dusman x[3001];
    int v[1001], n, m, k, i;
    for(int i = 0; i < 100; i++)
        v[i] = 0;
    v[0] = 0;
    //backtracking(v, 1, 3);
    //backtracking_permutari(v, 1, 4);
    citire(x, n, k, m);
    i = 0;
    back_dusman(v, 1, n, m, x, i, k);
    return 0;
}