Submission #1203428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203428		Muaath_5	Hexagonal Territory (APIO21_hexagon)	C++20	3 / 100	1 ms	400 KiB

hexagon

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD = 1000000007;
const ll DIV_6 = 686070594; // binpow(6, MOD-2);
int draw_territory(int N, int a, int b, vector<int> D, vector<int> L) {
  const ll A = a, B = b;
  
  const ll len = L[0]+1;
  const ll cnt = (len*(len+1)/2)%MOD;
  
  const ll sum_of_powers = len*(len+1)%MOD * (2*len+1)%MOD * DIV_6%MOD;
  assert(0 <= sum_of_powers && sum_of_powers < MOD);
  
  const ll first_part = (A*cnt)%MOD;
  
  const ll second_part = (B*((sum_of_powers - cnt+MOD)%MOD)%MOD)%MOD;
  assert(0 <= second_part && second_part < MOD);
  return (first_part + second_part)%MOD;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 0 / 19
• Subtask 7: 0 / 18
• Subtask 8: 0 / 16