제출 #1162520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1162520		brinton	육각형 영역 (APIO21_hexagon)	C++20	9 / 100	0 ms	328 KiB

hexagon

#include "hexagon.h"

#include <bits/stdc++.h>

using namespace std;
#define inf INT_MAX
#define MOD (long long)(1e9+7)
#define int long long
int inv(int base){
    // int p = 3;
    int p = MOD-2;

    int ret = 1;
    int cur = base;
    while(p){
        if(p&1){
            ret = ret*cur%MOD;
        }
        cur = cur*cur%MOD;
        p >>= 1;
    }
    return ret;
}
#undef int
int draw_territory(int N, int A, int B,vector<int> D, vector<int> L) {
    long long M = L[0]+1;
    long long cnt =  A*M%MOD*(M+1)%MOD*inv(2)%MOD;
    long long dist = B*((M%MOD*(M+1)%MOD*(2*M+1)%MOD*inv(6)%MOD-(M%MOD*(M+1)%MOD*inv(2)%MOD)+MOD)%MOD)%MOD;
    return (cnt+dist)%MOD;
}
#undef inf

// int main(){
//     cout << inv(2) << endl;
//     cout << 2*inv(2)%MOD << endl;
//     cout << draw_territory(3,1,0,vector<int>{0,0,0},vector<int>{3,3,3});
// }

• Subtask 1: 3 / 3
• Subtask 2: 6 / 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