이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define pb push_back
#define ios ios::sync_with_stdio(0);cin.tie(0);
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int MAX = 2e5 + 5;
int draw_territory(int N, int A, int B,vector<int> D, vector<int> L){
ll ans = ((((L[0] + 1) * 1LL * (L[0] + 2)) / 2) % mod);
ans *= A;
ans %= mod;
for(int i=0;i<(L[0] + 1);i++){
ans += (((i * (i + 1)) % mod) * B) % mod;
ans %= mod;
}
sort(L.begin(),L.end());
assert(L[0] == L.back());
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... |