Przejdź do treści

C++ - rozwiązanie

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <cstdio>
#include <iostream>
#include <map>

using namespace std;

string combineGenes(string gene1, string gene2);

void computeGene(string name, map<string, string> &genes, map<string, pair<string, string>> &parents);

int main()
{
    int n;
    string name, value;
    map<string, string> genes;
    map<string, pair<string, string>> parents;
    scanf("%d", &n);

    for (int i = 0; i < n; ++i)
    {
        cin >> name >> value;
        if (value == "dominant" || value == "recessive" || value == "non-existent")
        {
            genes[name] = value;
        }
        else
        {
            if (parents[value].first == "")
            {
                parents[value].first = name;
            }
            else
            {
                parents[value].second = name;
            }
        }
    }

    for (auto &el : parents)
    {
        computeGene(el.first, genes, parents);
    }

    for (auto &el : genes)
    {
        printf("%s %s\n", el.first.c_str(), el.second.c_str());
    }

    return 0;
}

string combineGenes(string gene1, string gene2)
{
    if ((gene1 == "non-existent" && gene2 != "dominant") || (gene1 != "dominant" && gene2 == "non-existent"))
    {
        return "non-existent";
    }

    if ((gene1 == "dominant" && gene2 != "non-existent") || (gene1 != "non-existent" && gene2 == "dominant"))
    {
        return "dominant";
    }

    return "recessive";
}

void computeGene(string name, map<string, string> &genes, map<string, pair<string, string>> &parents)
{
    if (genes[name] != "")
    {
        return;
    }

    computeGene(parents[name].first, genes, parents);
    computeGene(parents[name].second, genes, parents);
    genes[name] = combineGenes(genes[parents[name].first], genes[parents[name].second]);
}