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 "hexagon.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
ll a, b, k;
ll binpow(ll vl, ll idx)
{
if (idx==0) return 1;
ll tmp=binpow(vl, idx/2);
if (idx%2) return (((tmp*tmp)%mod)*vl)%mod;
else return (tmp*tmp)%mod;
}
int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
a=A, b=B, k=L[0]+1;
ll x=((((k)*(k+1)/2)%mod)*a)%mod;
ll y=(((((((b*k)%mod)*(k+1))%mod)*(2*k+1))%mod)*binpow(6, mod-2))%mod;
return (x+y)%mod;
}
# | 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... |