| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1223518 | Jer | 육각형 영역 (APIO21_hexagon) | C++20 | 2095 ms | 332 KiB |
#include "hexagon.h"
#include <bits/stdc++.h>
#include <vector>
typedef long long ll;
using namespace std;
int n;
const int MOD = 1000000007;
int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
n = N;
ll l = (ll)L[0];
ll res = 0;
for (int i = 0; i < l; i++)
{
res = (res + (i + 1) * A) % MOD;
res = (res + (i * (i + 1) * B)) % MOD;
}
return res;
}
| # | 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... | ||||
