Codeforces/1968D.cpp at main · shafinkun/Codeforces · 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
/*___________________In the name of Allah________________*/
/*___________________Solved By shafinkun________________*/
// Problem link : https://codeforces.com/problemset/problem/1968/D

#include <bits/stdc++.h>
using namespace std;
#define optimize()                \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define endl '\n'
#define ll long long
#define yes cout << "YES\n"
#define no cout << "NO\n"
const int MOD = 1e9 + 7;

void solve(int a)
{
    ll n, turn, b, s;
    cin >> n >> turn >> b >> s;

    vector<int> LL(n + 1), Val(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        cin >> LL[i];
    }
    for (int i = 1; i <= n; ++i)
    {
        cin >> Val[i];
    }

    ll ScB = Val[b];
    int mini = min(turn, n);
    int ptr = b, i = 1;
    for (; i < mini; ++i)
    {
        if (Val[ptr] > Val[LL[ptr]])
        {
            ScB += Val[ptr];
            ptr = LL[ptr];
            break;
        }
        else
        {
            ScB += Val[LL[ptr]];
            ptr = LL[ptr];
        }
    }
    ScB += (turn - i) * Val[ptr];

    ll ScS = Val[s];
    mini = min(turn, n);
    ptr = s, i = 1;
    for (; i < mini; ++i)
    {
        if (Val[ptr] > Val[LL[ptr]])
        {
            ScS += Val[ptr];
            ptr = LL[ptr];
            break;
        }
        else
        {
            ScS += Val[LL[ptr]];
            ptr = LL[ptr];
        }
    }
    ScS += (turn - i) * Val[ptr];

    if (ScB > ScS)
        cout << "Bodya\n";

    else if (ScB < ScS)
        cout << "Sasha\n";

    else
        cout << "DRAW\n";

    return;
}

int main()
{
    optimize();
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve(t);
    }
    return 0;
}