# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1052354 |
2024-08-10T13:44:56 Z |
vjudge1 |
Sirni (COCI17_sirni) |
C++17 |
|
484 ms |
786432 KB |
#include <bits/stdc++.h>
using namespace std;
typedef tuple<int,int,int> tiii;
vector<int> nums;
typedef vector<int> vi;
class UnionFind {
private:
vi p,rank;
public:
UnionFind(int n) {
p.assign(n,0); for (int i = 0; i < n; i++) p[i] = i;
rank.assign(n,0);
}
int findSet(int i) {
return (p[i] == i) ? i : (p[i] == findSet(p[i]));
}
bool isSameSet(int i, int j) {
return (findSet(i) == findSet(j));
}
void unionSet(int i, int j) {
int x = findSet(i), y = findSet(j);
if (x == y) return;
if (rank[x] > rank[y]) swap(x,y);
p[x] = y;
if (rank[x] == rank[y]) ++rank[y];
}
};
int main()
{
int n; cin >> n;
for (int i = 0; i< n; i++) {
int a; cin >> a;
nums.push_back(a);
}
vector<tiii> EL;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) continue;
int minimo = min(nums[i]%nums[j], nums[j]%nums[i]);
EL.push_back({minimo, i, j});
}
}
sort(EL.begin(), EL.end());
long int mst_cost = 0, num_taken = 0;
UnionFind UF(n);
for (auto &[w, u, v] : EL) {
if (UF.isSameSet(u,v)) continue;
mst_cost += w;
UF.unionSet(u,v);
++num_taken;
if(num_taken == n-1) break;
}
cout << mst_cost << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
68 ms |
14276 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
462 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
484 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
427 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
374 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
379 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
382 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
382 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
391 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
375 ms |
786432 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |