# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998385 | andrei_iorgulescu | Newspapers (CEOI21_newspapers) | C++14 | 663 ms | 88396 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 <bits/stdc++.h>
using namespace std;
ifstream in("lol.in");
ofstream out("lol.out");
int n;
int m;
vector<int> g[25];
vector<int> gmask[(1 << 20) + 5];
int t[(1 << 20) + 5];
bool pot[(1 << 20) + 5];
void dfs(int mask)
{
pot[mask] = true;
for (auto vecin : gmask[mask])
if (!pot[vecin])
t[vecin] = mask,dfs(vecin);
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int x,y;
cin >> x >> y;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |