# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015027 | doducanh | Fancy Fence (CEOI20_fancyfence) | C++14 | 61 ms | 6224 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 h first
#define w second
pair<int,int>a[100005];
int f[100005];
int dp[100005];
const int mod=1e9+7;
int n;
int mul(int a,int b)
{
return a*b%mod;
}
int sum(int a)
{
return (a*(a+1)/2)%mod;
}
main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i].h;
for(int i=1;i<=n;i++){
cin>>a[i].w;
f[i]=(f[i-1]+a[i].w)%mod;
}
int ans=0;
stack<int>s;
s.push(0);
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... |