int main() {
ll N;
cin >> N;

vector<ll> u(N);
for(ll i = 0; i < N; ++i) {
cin >> u[i];
}

ll M, X;
cin >> M >> X;

vector<vector<ll>> a(N);
for(ll i = 0; i < M; ++i) {
ll x, y;
cin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}

vector<bool> v(N, false);
queue<ll> q;
q.push(0);
v[0] = true;

ll m = 0;
while(!q.empty()) {
ll s = q.size();
ll us = 0;
for(ll i = 0; i < s; ++i) {
ll n = q.front();
q.pop();
us += u[n];
for(ll nb : a[n]) {
if(!v[nb]) {
q.push(nb);
v[nb] = true;
}
}
}
m = max(m, us);
}

cout << m << endl;

return 0;
}



apartment

@allcoding1_official

🎯IBM off campus recruitment


https://careers.ibm.com/job/19856316/mobile-developer-intern-mumbai-in/?codes=Appcast_Indeed_O&ccuid=51541315202&_ccid=1707306517128osrvsiuxq&ittk=FESUCW14AW

🎯Atos Is Hiring

Degree:- Any Graduate
Batch:- 2019, 2020, 2021, 2022, 2023 & 2024

Apply Now:- https://www.allcoding1.com/2024/02/atos-off-campus-drive-for-any-graduate.html


Telegram:- @allcoding1_official

🎯SAS Off Campus Drive 2024 – Associate Software Engineer – Freshers | Rs 4-8 LPA

Job Role : Associate Software Developer
Qualification : B.E/B/Tech/M.E. / M.Tech
Experience : Freshers
Job Location : Pune
Package : Rs 4-8 LPA

Apply Now:- https://www.allcoding1.com/2024/02/sas-off-campus-drive-2024-associate_9.html?m=1

Telegram:- @allcoding1_official

🎯 Microsoft Bulk Hiring 2024 | For Software Engineer

Degree:- BE, B Tech, BA, B COM, BBA, BSC, BCA, ME, M Tech, MCA, MA, M COM, MSC, Any Graduate
Batch:- 2018, 2019, 2020, 2021, 2022, 2023 ,2024 & 2025

Apply now:- https://www.allcoding1.com/2024/02/microsoft-bulk-hiring-2024-for-software.html

Telegram:- @allcoding1_official

🎯Tech Mahindra Off Campus drive

Job Role Associate Software Engineer
Qualification B.E/B.Tech/MCA/M.Sc
Experience Freshers
Batch 2022/2023
Salary Rs.3.25 LPA & 5.5LPA (for super coders)
Job Location Across India
Venue Location Virtual(Online)
Last Date 4 February 2024

Apply now:- https://www.allcoding1.com/2024/02/tech-mahindra-off-campus-drive-2024.html?m=1

Telegram:- @allcoding1_official

Seclore Hiring Trainee Product Engineer

Batch : 2023/2024

https://forms.office.com/pages/responsepage.aspx?id=p-D8QJJvrU-J5dFq-aRayJUCwLfnvYFErLS_NRtRc3pUMUFPMzY5RFNTRUhGSzFEWlRHODQxRURGRy4u

🎯Gap Inc. is Hiring

Role: Software Engineer
Expected CTC: 10-15 LPA
Location: Hyderabad
🔗Apply here: https://gapinc.com/en-in/jobs/w50/10/software-engineer?rx_campaign=indeed0&rx_ch=jobp4p&rx_group=116953&rx_job=R155010&rx_medium=cpc&rx_r=none&rx_source=Indeed&rx_ts=20240212T040042Z&rx_vp=cpc&src=JB-12080&rx_p=3EEOWPZGT4&rx_viewer=26bfde3e399611ee9af1415c5aa7bfbe5d6d53728456427c859a335976e41692

Deloitte exam verbal
1) CBDA

2) false

3) At( fill in the blanks 4) In a corner

5) RPQS

6) down

7)He trades both precious and non-precious elements


8) The men yelled in her face

9) in

Next section

1) BUSMUF
2) KXVTL
3) D
4) CANNOT BE DETERMINED
5) E WA SITTING FRONT OF I

6) both 1 and 3

7) 3

Nine person

8) H

Deloitte exam ans

https://t.me/+sgf2nazHqhlkNmNl

#include <stdio.h>

struct Triangle {
    int side1;
    int side2;
    int side3;
};

int IdentifyTriangle(struct Triangle list[], int n) {
    if (list == NULL) {
        return -1;
    }

    int scaleneCount = 0;
    int isoscelesCount = 0;
    int notTriangleCount = 0;

    for (int i = 0; i < n; i++) {
        int s1 = list[i].side1;
        int s2 = list[i].side2;
        int s3 = list[i].side3;
        if ((s1 + s2 > s3) && (s1 + s3 > s2) && (s2 + s3 > s1)) {
            if (s1 != s2 && s2 != s3 && s1 != s3) {
                scaleneCount++;
            }
            else if (s1 == s2 s2 == s3 s1 == s3) {
                isoscelesCount++;
            }
        } else {
            notTriangleCount++;
        }
    }

    return (3 * scaleneCount) - (isoscelesCount + notTriangleCount);
}

Identify triangles

@allcoding1_official

int countBracketSequence(string s)
{
    int sum = 0;
    int n = s.size();
    for (int i = 0; i < n; i++)
    {
        if (s[i] == '(')
        {
            sum++;
        }
        else
        {
            sum--;
        }
    }
    int ans;
    if(sum!=1 && sum!=-1)
    {
        return 0;
    }
    if (sum < 0)
    {
        sum = 0;
        for (int i = 0; i < n; i++)
        {
            if (s[i] == '(')
            {
                sum++;
            }
            else
            {
                sum--;
            }
            if (sum < 0)
            {
                ans = i + 1;
                break;
            }
        }
    }
    else
    {
        sum = 0;
        int cnt = 0;
        for (int i = n - 1; i >= 0; i--)
        {
            if (s[i] == ')')
            {
                sum++;
            }
            else
            {
                sum--;
            }

            if (sum < 0)
            {
                ans = cnt + 1;
                break;
            }
            cnt++;
        }
    }

    return ans;
}

Bracket Sequence

@allcoding1_official