Submission #821049

#	Time	Username	Problem	Language	Result	Execution time	Memory
821049		boris_mihov	Marshmallow Molecules (CCO19_day2problem2)	C++17	5 / 25	4082 ms	174428 KiB

Main

#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

typedef long long llong;
const int MAXN = 5000 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;

int n, m;
std::set <int> g[MAXN];

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (const int &u : g[i])
        {
            for (const int &v : g[i])
            {
                if (u < v)
                {
                    g[u].insert(v);
                }
            }
        }
    }

    int cnt = 0;
    for (int i = 1 ; i <= n ; ++i)
    {
        cnt += g[i].size();
    }

    std::cout << cnt << '\n';
}

void input()
{
    std::cin >> n >> m;
    for (int i = 1 ; i <= m ; ++i)
    {
        int u, v;
        std::cin >> u >> v;
        g[std::min(u, v)].insert(std::max(u, v));
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 10