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 <bits/stdc++.h>
using namespace std;
#include <vector>
#define 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)*(L[0]+2)/2%mod*A;
ans = ans + (L[0]+1)*(L[0]+2)/6%mod*(2*(L[0]+1)+1)%mod*B;
ans = (ans + L[0]*A)%mod;
if (ans < 0) {return (ans+mod);}
else 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... |