| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367771 | cleversquid | Hexagonal Territory (APIO21_hexagon) | C++20 | 0 ms | 344 KiB |
//#include "hexagon.h"
#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
ll MOD = 1e9+7;
int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
//if n = 3 and b = 0
int side = D[0];
int a = side+1;
int b = side+2;
if(a % 2 == 0){
a/=2;
}
else{
b/=2;
}
a%= MOD;
b%= MOD;
return (a*b)%MOD;
}
/*
int main(){
int N, A, B; cin >> N >> A >> B;
vector<int> D;
vector<int> L;
for(int i =0 ; i<N; i++){
int d;
cin >> d;
D.push_back(d);
}
for(int i =0 ; i<N; i++){
int l;
cin >> l;
L.push_back(l);
}
}*/| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
