# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922050 | Alebn | Fancy Fence (CEOI20_fancyfence) | C++14 | 24 ms | 6228 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 int long long
#define sz(x) (int)(x.size())
using namespace std;
const int mod=1000000007;
int MOD(int x) {
return (x+3*mod)%mod;
}
struct sections {
int H=0, W=0;
};
int n, k, m;
vector<sections> a;
int section(int h, int w) {
h%=mod, w%=mod;
int facteur=MOD((h*(h+1))/2);
int ans=MOD((w*(w+1))/2);
return MOD(ans*facteur);
}
int subtask2() {
int ans=0;
# | 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... |