# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
779892 | vjudge1 | Sirni (COCI17_sirni) | C++14 | 0 ms | 0 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;
const int maxN = 1e5;
const int maxM = 1e5;
int n, m, k;
struct TEdge
{
int u, v;
int w;
bool selected;
};
using PEdge = TEdge*;
TEdge e[maxM];
PEdge p[maxM];
int lab[maxN];
void ReadInput(
{
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
cin >> e[i].u >> e[i].v >> e[i].w;
e[i].selected = false;
p[i] = &e[i];
}
}
void Init()
{
sort(p, p + m, [](PEdge e1, PEdge e2)
{