Submission #488767

#	Time	Username	Problem	Language	Result	Execution time	Memory
488767		Theo830	Hexagonal Territory (APIO21_hexagon)	C++17	9 / 100	1592 ms	332 KiB

hexagon

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///APIO 2021 vc
#include "hexagon.h"
int draw_territory(int N, int A, int B,std::vector<int> D, std::vector<int> L){
    ll ans = ((((L[0] + 1) * 1LL * (L[0] + 2)) / 2) % INF);
    ans *= A;
    ans %= INF;
    f(i,0,L[0] + 1){
        ans += (((i * (i + 1)) % INF) * B) % INF;
        ans %= INF;
    }
    sort(all(L));
    assert(L[0] == L.back());
    return ans;
}

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 0 / 19
• Subtask 7: 0 / 18
• Subtask 8: 0 / 16