Submission #1197994

#TimeUsernameProblemLanguageResultExecution timeMemory
1197994adiyerHexagonal Territory (APIO21_hexagon)C++20
3 / 100
1211 ms412 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int mod = 1e9 + 7; int draw_territory(int N, int A, int B, vector < int > D, vector < int > L) { ll cnt = 0; for(int i = 0; i < N; i++) cnt = L[0]; // for(int i = 0; i < N; i++){ // assert(L[i] == L[0]); // } cnt = (cnt + 1) * (cnt + 2) / 2; cnt %= mod; cnt *= A; cnt %= mod; for(int i = 0; i <= L[0]; i++) cnt += (i * (i + 1)) % mod * B, cnt %= mod; int ans = cnt; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...