Submission #617998

#	Time	Username	Problem	Language	Result	Execution time	Memory
617998		MohamedAliSaidane	Hexagonal Territory (APIO21_hexagon)	C++14	0 / 100	1 ms	212 KiB

hexagon

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "hexagon.h"
        using namespace __gnu_pbds;
        using namespace std;
 
        typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
 
        typedef long long ll;
        typedef long double ld;
 
        //#define int ll
 
        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
        typedef pair<ld,ld> pld;
 
        typedef vector<int> vi;
        typedef vector<ll> vll;
        typedef vector<pii> vpi;
        typedef vector<pll> vpl;
 
        #define pb push_back
        #define popb pop_back
        #define pp pop_back
        #define pf push_front
        #define popf pop_front
        #define all(x) (x).begin(),(x).end()
        #define ff first
        #define ss second
 
 
 
        int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
        ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
        ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}
 
 
        const ll MOD =   1e9 + 7;
 
        int draw_territory(int N, int A, int B, vi D, vi L )
        {
            ll lng = L[0];
            return ((A * 1ll * (((lng + 1ll) * 1ll * (lng + 2ll))/2ll)));
        }

• Subtask 1: 0 / 3
• Subtask 2: 0 / 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