# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
821064 | boris_mihov | Marshmallow Molecules (CCO19_day2problem2) | C++17 | 565 ms | 3540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 = 5000 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;
int n, m;
std::vector <int> g[MAXN];
std::bitset <MAXN> bs[MAXN];
void solve()
{
for (int i = 1 ; i <= n ; ++i)
{
std::bitset <MAXN> toOR;
for (int j = i - 1 ; j >= 1 ; --j)
{
if (bs[j][i])
{
toOR |= bs[j];
}
}
bs[i] |= (toOR >> i + 1) << i + 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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |