| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1202261 | jer033 | 육각형 영역 (APIO21_hexagon) | C++20 | 1 ms | 396 KiB |
#include "hexagon.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1'000'000'007;
int report(ll ans)
{
ll x = ans%MOD;
int y = x;
return y;
}
int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
//suppose N=3;
ll AA = A;
ll BB = B;
ll K = L[0] + 1;
ll suma = (K*K+K)/2ll;
ll sumb = (suma%(3ll*MOD))*(2*K+1);
suma = suma%MOD;
sumb = (sumb/3ll)%MOD;
sumb = (sumb-suma)%MOD;
sumb = (sumb+MOD)%MOD;
ll ans = ((suma*AA)%MOD)+((sumb*BB)%MOD);
return report(ans);
}
| # | 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... | ||||
