# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
943153 | shoryu386 | Fancy Fence (CEOI20_fancyfence) | C++17 | 103 ms | 13304 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 int long long
#define MAX 100007
#define MOD 1000000007
tuple<int, int, int> hw[MAX];
int p[MAX];
int sumsz[MAX];
int storeSqrSum = 0;
int compute(int x){
return ( (x * (x+1))/2 ) %MOD;
}
void activate(int a){
sumsz[a] = get<1>(hw[a]);
storeSqrSum += compute(get<1>(hw[a]));
storeSqrSum %= MOD;
}
int root(int a){
if (a == p[a]) return a;
return p[a] = root(p[a]);
}
void merge(int a, int 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... |