# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
961047 | thinknoexit | Security Guard (JOI23_guard) | C++17 | 144 ms | 18124 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;
using ll = long long;
const int N = 200200;
int a[N];
vector<int> adj[N];
struct A {
int u, v;
bool operator < (const A& o) const {
return a[u] + a[v] < a[o.u] + a[o.v];
}
};
ll ans = 0;
vector<A> e;
int p[N];
int fr(int i) {
return p[i] == i ? i : p[i] = fr(p[i]);
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, m, q;
cin >> n >> m >> q;
for (int i = 1;i <= n;i++) {
cin >> a[i];
p[i] = i;
}
while (m--) {
int u, v;
cin >> u >> v;
e.push_back({ u, v });
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |