Submission #824500

#	Time	Username	Problem	Language	Result	Execution time	Memory
824500		Hanksburger	육각형 영역 (APIO21_hexagon)	C++17	9 / 100	1 ms	304 KiB

hexagon

#include "hexagon.h"
#include <bits/stdc++.h>
using namespace std;
const long long mod=1000000007, inv2=500000004, inv3=333333336;
vector<long long> d, l;
int draw_territory(int nn, int aa, int bb, vector<int> dd, vector<int> ll)
{
    long long n=nn, a=aa, b=bb;
    for (long long i=0; i<n; i++)
        d.push_back(dd[i]), l.push_back(ll[i]);
    return ((l[0]+1)*(l[0]+2)%mod*inv2%mod*a%mod+l[0]*(l[0]+1)%mod*(l[0]+2)%mod*inv3%mod*b%mod)%mod;
}

• 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