# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980557 | fcmalkcin | 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 <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define nl "\n"
const int maxn = 2e5+5;
const ll mod = 1e9+7;
#define ll long long
ll mul(ll a, ll n) {
if (n == 0) return 1;
ll t= mul(a, n / 2);
if (n%2==0) return (t*t)%mod;
else return ((t*t)%mod*a)%mod;
}
int draw_territory(int N, int A, int B, vector<int> D, vector<int> L){
long long a;
if(N==3){
long long length = L[0];
a = ((length * (length+1))%mod*mul(2, mod - 2)) %mod;
}
else{
int totalsq = 4000*4000;
int dx[6] = {0, 1, 1, 0, -1, -1};
int dy[6] = {2, 1 ,-1, -2, -1, 1};
}
int ans = a%mod;
return ans;
}