Submission #821068

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

Main

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

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

int n, m;
std::bitset <MAXN> bs[MAXN];

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = i + 1 ; j <= n ; ++j)
        {
            if (bs[i][j])
            {
                bs[j] |= (bs[i] >> j + 1) << j + 1;
            }
        }
    }

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

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

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

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

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

    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:28:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |                 bs[j] |= (bs[i] >> j + 1) << j + 1;
      |                                    ~~^~~

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