# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719076 | esomer | Fancy Fence (CEOI20_fancyfence) | C++17 | 44 ms | 6004 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;
#define endl "\n"
typedef long long int ll;
const int MOD = 1e9 + 7;
struct DSU{
vector<int> v;
vector<ll> sum;
void init(vector<tuple<ll, ll, int>>& a){
int n = (int)a.size();
v.assign(n, -1);
sum.assign(n, 0);
for(int i = 0; i < n; i++){
sum[get<2>(a[i])] = get<1>(a[i]);
}
}
int gt(int x){return v[x] < 0 ? x : v[x] = gt(v[x]);}
ll gets(int x){return sum[gt(x)] % MOD;}
void unite(int x, int y){
x = gt(x); y = gt(y);
if(x == y) return;
if(v[x] > v[y]) swap(x, y);
v[x] += v[y]; v[y] = x; sum[x] += sum[y]; sum[x] %= MOD;
}
};
# | 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... |