제출 #1162513

#제출 시각아이디문제언어결과실행 시간메모리
1162513brinton육각형 영역 (APIO21_hexagon)C++20
0 / 100
2097 ms320 KiB
#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 = MOD-2;

    int ret = 1;
    int cur = base;
    while(p){
        while(p){
            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];
    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;
    return (cnt+dist)%MOD;
}
#undef inf
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...