# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553642 | josanneo22 | Hexagonal Territory (APIO21_hexagon) | C++17 | 0 ms | 0 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 "hexagon.h"
#include <vector>
long long int mod=1e9+7;
int draw_territory(int N, int A, int B,
std::vector<int> D, std::vector<int> L)
{
long long l=L[0]+1;
long long a = A;
long long count=(1+l)*l;
count/=2;
count%=mod;
count*=a;
count%=mod;
long long cnt=0;
if(b)
{
for(int i=0;i<l;i++)
{
cnt+=i*(i+1);
cnt%=mod;
}
count=count+cnt*B;
count%=mod;
}
return count;
}