# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
465837 | ivan_tudor | Fancy Fence (CEOI20_fancyfence) | C++14 | 78 ms | 5316 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;
const int MOD = 1e9+7;
const unsigned long long N = 1e5+5;
unsigned long long lgcput(unsigned long long b,unsigned long long p){
unsigned long long a = 1;
while(p){
if(p & 1){
a *= b;
a%=MOD;
}
b*=b;
b%=MOD;
p/=2;
}
return a;
}
unsigned long long cost(unsigned long long n){
return ((unsigned long long)(((unsigned long long)(n *(n+1)))%MOD) *(lgcput(2,MOD-2) % MOD)) %MOD ;
}
struct drept{
unsigned long long h,w;
};
drept v[N];
unsigned long long stk[N];
unsigned long long nwc[N];
int main()
{
//freopen(".in","r",stdin);
# | 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... |