이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "hexagon.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9+7;
int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
ll len = L[0]+1;
ll count = ((len)*(len+1))/2;
count = count%mod;
ll a1 = len-1;
ll a2 = len;
ll a3 = len+1;
if(a1%3==0){
a1 = a1/3;
} else if(a2%3==0){
a2 = a2/3;
} else {
a3 = a3/3;
}
ll d = a1*a2;
d = d%mod;
d = d*a3;
d = d%mod;
ll a = d*B;
a = a%mod;
ll b = count*A;
b = b%mod;
ll ans = a+b;
ans = ans%mod;
//cout << len << " " << count << " " << d << " " << a << " " << b << " " << ans << endl;
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... |