# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165363 | SmuggingSpun | Fancy Fence (CEOI20_fancyfence) | C++20 | 9 ms | 1100 KiB |
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
typedef long long ll;
const int lim = 1e5 + 5;
const int mod = 1e9 + 7;
void add(int& a, int b){
if((a += b) >= mod){
a -= mod;
}
}
int n, h[lim], w[lim];
namespace sub2{
int f(ll N){
return ((N & 1LL) ? N % mod * (((N + 1) >> 1LL) % mod) : (N >> 1LL) % mod * ((N + 1) % mod)) % mod;
}
void solve(){
int ans = f(accumulate(w + 1, w + n + 1, 0LL));
ll N = 0;
for(int i = 1; i <= n; i++){
if(h[i] == 2){
N += w[i];
}
else{
add(ans, (f(N) << 1) % mod);
N = 0;
}
}
cout << (ans + ((f(N) << 1) % mod)) % mod;
}
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... |