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++){
ll val = L[i];
bound += val;
if(D[i] == 1){
y += val;
}
if(D[i] == 2){
area += ((2 * y * val));
x += val;
}
if(D[i] == 3){
area += (((2 * y - val) * val));
x += val;
y -= val;
}
if(D[i] == 4){
y -= val;
}
if(D[i] == 5){
area -= ((2 * y * val));
x -= val;
}
if(D[i] == 6){
area -= (((2 * y + val) * val));
x -= val;
y += val;
}
}
// cout << area << "\n";
if(area < 0) area = abs(area);
// if(area != (L[0] * L[0])) while(1);
// cout << area << '\n';
ll inter = ((area - bound) / 2 + 1) % MOD;
ll a = A;
return (((inter + bound) * a) % MOD);
}
return 0;
}
# | 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... |