# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980609 | zh_h | Hexagonal Territory (APIO21_hexagon) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define lint long long int
#define pb push_back
using namespace std;
const int INF = 1e9;
lint draw_territory(int N, int A, int B, int D[], int L[]){
// vector<vector<int>> v1(1e9, vector<int>(1e9)), v2, v3, v4;
// v1.resize(INF, );
// v2.resize(N+1);
// v3.resize(N+1);
// v4.resize(N+1);
int length = L[0]+1;
int sum = 0, times = 0;
for(int i = 0; i <= length; i ++){
sum += (i*(i+1));
times += i+1;
}
sum *= B;
sum += (times*A);
return sum;
}
int main(){
int D[] = {1, 2, 3, 4, 5, 4, 3, 2, 1, 6, 2, 3, 4, 5, 6, 6, 1};
int L[] = {1, 2, 2, 1, 1, 1, 1, 2, 3, 2, 3, 1, 6, 3, 3, 2, 1};
cout << draw_territory(17, 2, 3, D, L);
}