# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174746 | vicvic | Pipes (BOI13_pipes) | C++20 | 207 ms | 68548 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <cstdint>
#include <functional>
#define int long long
using namespace std;
int n, m;
set <pair <int, int>> adj[100005];
int c[100005], viz[100005], ans[100005], suf[100005];
vector <int> cycle_edge, cycle;
queue <int> coada;
int32_t main ()
{
ios :: sync_with_stdio (0);
cin.tie (nullptr);
cin >> n >> m;
for (int i=1;i<=n;i++)
{
cin >> c[i];
}
for (int i=1;i<=m;i++)
{
int x, y;
cin >> x >> y;
adj[x].insert ({y, i});
adj[y].insert ({x, i});
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |