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;
int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L)
{
L[0]++;
ll cost=A*(((1+L[0])*L[0])/2)%1000000007;
/*L[0]--;
cost+=B*(((2+L[0])*L[0])/2)%1000000007;*/
return cost%1000000007;
}
# | 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... |