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>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
long long int mod=1e9+7;
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) % mod);
ans *= A;
ans %= mod;
FOR(i,0,L[0] + 1)
{
ans += (((i * (i + 1)) % mod) * B) % mod;
ans %= mod;
}
return ans;
}
# | 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... |