2811 2023. 01. 26 13:34:40 bzsofia Útadó cpp11 Wrong answer 0/50 98ms 15472 KiB
// Utado.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>

using namespace std;

struct adat
{
    bool lat;
    int ag = 1;
    vector <int> sz;
};

struct adat2
{
    int db;
    pair<int, int> par;
};

int i, n, a, b, mod=32609;
long long sum;
vector <adat> x;

void mely(int akt)
{
    x[akt].lat = 1;
    for (auto& e : x[akt].sz)
    {
        if (!x[e].lat)
        {
            mely(e);
            x[akt].ag += x[e].ag;
        }
    }
}

bool comp(adat2 a, adat2 b)
{
    return a.db < b.db;
}

int main()
{
    cin >> n;
    vector <adat2> el(n);
    vector <int> ar(n);
    x.resize(n + 1);

    for (i = 1; i < n; ++i)
    {
        cin >> a >> b;

        el[i].par = { a, b };
        x[a].sz.push_back(b);
        x[b].sz.push_back(a);
    }

    for (i = 1; i < n; ++i)
    {
        cin >> ar[i];
    }

    mely(1);

    sort(ar.begin() + 1, ar.end());

    for (i = 1; i < n; ++i)
    {
        b = el[i].par.second;
        el[i].db = 2 * x[b].ag * (n - x[b].ag);
        //cout << el[i].par.first << " " << el[i].par.second << " " << el[i].db << "\n";
    }

    sort(el.begin() + 1, el.end(), comp);

    for (i = 1; i < n; ++i)
    {
        sum = (sum + (el[i].db * ar[i])) % mod;
    }

    //cout << sum%mod<<"\n";
    for (i = 1; i < n; ++i)
    {
        cout << el[i].par.first << " " << el[i].par.second << " " << ar[i] << "\n";
    }

    return 0;
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file
Subtask Sum Test Verdict Time Memory
base 0/50
1 Wrong answer 0/0 3ms 1956 KiB
2 Wrong answer 0/0 39ms 4984 KiB
3 Wrong answer 0/2 2ms 2256 KiB
4 Wrong answer 0/2 2ms 2368 KiB
5 Wrong answer 0/2 2ms 2396 KiB
6 Wrong answer 0/2 2ms 2528 KiB
7 Wrong answer 0/2 2ms 2728 KiB
8 Wrong answer 0/8 98ms 15472 KiB
9 Wrong answer 0/2 4ms 3268 KiB
10 Wrong answer 0/2 4ms 3500 KiB
11 Wrong answer 0/2 4ms 3668 KiB
12 Wrong answer 0/2 4ms 3940 KiB
13 Wrong answer 0/2 4ms 4060 KiB
14 Wrong answer 0/2 94ms 11548 KiB
15 Wrong answer 0/2 94ms 11484 KiB
16 Wrong answer 0/2 93ms 11744 KiB
17 Wrong answer 0/2 96ms 11688 KiB
18 Wrong answer 0/2 97ms 11696 KiB
19 Wrong answer 0/2 94ms 11692 KiB
20 Wrong answer 0/2 94ms 11812 KiB
21 Wrong answer 0/2 96ms 11816 KiB
22 Wrong answer 0/2 96ms 11812 KiB
23 Wrong answer 0/2 97ms 12056 KiB
24 Wrong answer 0/2 97ms 12092 KiB