# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567002 | Bill_00 | Rainforest Jumps (APIO21_jumps) | C++14 | 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 "hexagon.h"
#include <bits/stdc++.h>
#include <vector>
typedef long long ll;
const ll MOD = 1000000007;
const ll low = -1000000000;
using namespace std;
ll area, bound, x, y;
int draw_territory(int N, int A, int B, vector<int> D, vector<int> L){
if(B == 0){
for(int i = 0; i < N; i++){
bound += L[i];
if(D[i] == 1){
y += L[i];
}
if(D[i] == 2){
area += (2 * (y - low) * L[i]);
x += L[i];
}
if(D[i] == 3){
area += ((2 * (y - low) - L[i]) * L[i]);
x += L[i];
y -= L[i];
}
if(D[i] == 4){
y -= L[i];
}
if(D[i] == 5){
area -= (2 * (y - low) * L[i]);
x -= L[i];
}
if(D[i] == 6){
area -= ((2 * (y - low) + L[i]) * L[i]);
x -= L[i];
y += L[i];
}
}
if(bound != (3 * L[0])) while(1);
ll inter = (area + 2 - bound) / 2;
return (inter + bound) * (ll)(A);
}
return 0;
}