# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668263 | 600Mihnea | City Mapping (NOI18_citymapping) | C++17 | 89 ms | 8856 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 "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge
{
int a;
int b;
ll cost;
};
bool operator < (Edge f, Edge s)
{
return f.cost < s.cost;
}
void find_roads(int n, int q, int e_a[], int e_b[], int e_w[])
{
vector<int> t(n + 1);
iota(t.begin(), t.end(), 0);
function<int(int)> root = [&] (int a)
{
if (t[a] == a)
{
return a;
}
else
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |