#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll bpm(ll a, ll b, ll m){
ll c = 1;
while(b){
if(b & 1) c *= a, c %= m;
a *= a, a %= m, b >>= 1;
}
return c;
}
int draw_territory(int N, int A, int B, vector < int > D, vector < int > L) {
ll cnt = 0, d = 0;
for(int i = 0; i < N; i++) cnt = d = L[0];
cnt = (cnt + 1) * (cnt + 2) / 2, cnt %= mod, cnt *= A, cnt %= mod;
cnt += ((((((d + 1) * (d + 2)) % mod * (d + 3)) % mod) * bpm(6, mod - 2, mod)) % mod * B) % mod, cnt %= mod;
int ans = cnt;
return ans;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |