| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1350428 | SulA | 육각형 영역 (APIO21_hexagon) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
int draw_territory(int k, int a, int b, vector<int> d, vector<int> l) {
long long n = l[0] + 1;
long long cells = n * (n + 1) / 2 % MOD;
long long dists = n * (n - 1) % MOD * (2*n - 1) % MOD * 166666668 % MOD;
dists += n*(n - 1)/2 % MOD;
cells = cells * a % MOD;
dists = dists * b % MOD;
return cells;
}
// int main() {
// int x = 3;
// cout << draw_territory(3, 1, 0, {}, {x, x, x});
// }| # | 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... | ||||
