# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
902701 | KN200711 | Fancy Fence (CEOI20_fancyfence) | C++14 | 49 ms | 5948 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>
# define ll long long
# define ld long double
# define fi first
# define se second
# define pll pair<ll, ll>
# define pdd pair<ld, ld>
# define pii pair<int, int>
using namespace std;
const ll MOD = 1e9 + 7;
int par[100001];
ll sz[100001], ans[100001];
ll C2(int a) {
ll v = a * (a + 1ll) / 2ll;
v %= MOD;
return v;
}
int find(int a) {
if(a == par[a]) return a;
par[a] = find(par[a]);
return par[a];
}
void merge(int a, int b, ll c) {
a = find(a);
b = find(b);
if(a == b) return;
ans[a] += ans[b];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |