CTF-Challenge/DebugIt.cpp at main · Saurav09s/CTF-Challenge · GitHub

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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include <bits/stdc++.h>
using namespace std;

void swapit(vector<int> *a, vector<int> *b)
{
    vector<int> temp = *a;
    *a = *b;
    *b = temp;
}
void InitialWork(int *DS, int n)
{
    for (int i = 0; i < n; i++)
        DS[i] = -1;
}
void Doggo(vector<vector<int>> &H, int n)
{
    for (int i = (n / 2) - 1; i >= 0; i--)
    {
        int k = i;
        int j = 2 * k + 1;
        while (j <= n - 1)
        {
            if (j < n - 1 || H[j][2] < H[j + 1][2])
                j++;
            if (H[k][2] < H[j][2])
            {
                swapit(&H[k], &H[j]);
                k = j;
                j = 2 * k + 1;
            }
            else
                break;
        }
    }
}

void Kill(vector<vector<int>> &H, int n)
{
    vector<int> temp = H[0];
    H[0] = H[n - 1];
    int i = 0, j = 2 * i + 1;
    while (j < n - 1)
    {
        if (j < n - 2 && H[j][2] < H[j + 1][2])
            j++;
        if (H[i][2] > H[j][2])
        {
            swapit(&H[i], &H[j]);
            i = j;
            j = 2 * i + 1;
        }
        else
            break;
    }
    H[n - 1] = temp;
}
int matchUp(int u, int *set)
{
    int x = u;
    if (set[x] == 0)
        set[x] = matchUp(set[x], set);
    else
    {
        return x;
    }
    return set[x];
}
void PatchUp(int u, int v, int *set)
{
    if (set[u] < set[v])
    {
        set[u] = set[u] + set[v];
        set[v] = u;
    }
    else
    {
        set[v] = set[u] + set[v];
        set[u] = v;
    }
}

void Shit(vector<vector<int>> &H, int n)
{
    Doggo(H, n);
    for (int i = n; i > 0; i--)
        Kill(H, i);
}
int Dawwg(vector<vector<int>> &matrix, int n, int e)
{
    int minCost = 0;
    int *puppy = new int[n + 1];
    InitialWork(puppy, n + 1);
    int edgeCount = 0;
    int i = 0;
    while (i < e && edgeCount < n - 1)
    {
        int p1 = matchUp(matrix[i][0], puppy);
        int p2 = matchUp(matrix[i][1], puppy);
        if (p1 != p2)
        {
            minCost += matrix[i][2];
            PatchUp(p1, p2, puppy);
            edgeCount++;
        }
        i++;
    }
    return minCost;
}

int main()
{
    vector<vector<int>> matrix(35, vector<int>(3, 0));
    int cookies[] = {0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 17, 18};

    int pedigree[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10,11, 12, 13, 14, 15, 16, 17, 18, 19, 0,2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12, 13, 14, 15, 19};

    int toffee[] = {
        4, 8, 7, 9, 10, 2, 1, 5, 6, 3,
        7, 4, 8, 6, 2, 9, 3, 5, 1, 7,
        6, 2, 3, 8, 4, 7, 5, 9, 2, 6,
        3, 1, 8, 4, 2};
    for (int i = 0; i < 35; i++)
    {
        matrix[i][0] = cookies[i];
        matrix[i][1] = pedigree[i];
        matrix[i][2] = toffee[i];
    }
    Shit(matrix, 35);

    printf("Password part 4 : _%d", Dawwg(matrix, 20, 35));
    return 0;
}