| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1203424 | Muaath_5 | 육각형 영역 (APIO21_hexagon) | C++20 | 0 ms | 328 KiB |
#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;
return ( (A*cnt)%MOD + (B*((sum_of_powers - cnt+MOD)%MOD)%MOD)%MOD )%MOD;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
