제출 #533359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
533359		DanerZein	Hexagonal Territory (APIO21_hexagon)	C++14	3 / 100	1 ms	292 KiB

hexagon

#include "hexagon.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll pot(ll b,ll e){
  if(e==1) return b;
  ll aux=pot(b,e/2);
  aux*=aux; aux%=mod;
  if(e%2!=0) aux=(aux*b)%mod;
  return aux;
}
int draw_territory(int N, int A, int B,
                   std::vector<int> D, std::vector<int> L) {
  ll n=L[0];
  ll nh=(ll)(L[0]+1)*(ll)(L[0]+2);
  nh%=mod;
  nh*=pot(2,mod-2); nh%=mod;
  ll ans=nh*A; ans%=mod;
  ll i2=n*(2*n+(ll)1); i2%=mod;
  i2*=(n+(ll)1); i2%=mod;
  i2*=pot(6,mod-2); i2%=mod;
  ll i=n*(n+(ll)1); i%=mod;
  i*=pot(2,mod-2); i%=mod;
  ll b=(i+i2)%mod;
  b*=B; b%=mod;
  ans+=b;
  return ans;
}

• 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