# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
511878 | 79brue | Telegraph (JOI16_telegraph) | C++14 | 86 ms | 16596 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;
typedef long long ll;
struct Edge{
ll x, c;
Edge(){}
Edge(ll x, ll c): x(x), c(c){}
bool operator<(const Edge &r)const{
return c > r.c;
}
};
int n; ll sum;
int arr[100002];
ll cost[100002];
vector<Edge> from[100002];
bool inCycle[100002];
bool visited[100002];
bool visited2[100002];
vector<int> component;
void traverse(int x){
if(x<1 || visited[x]) return;
component.push_back(x);
visited[x] = 1;
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... |