Submission #1197991

#TimeUsernameProblemLanguageResultExecution timeMemory
1197991adiyerHexagonal Territory (APIO21_hexagon)C++20
0 / 100
0 ms328 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[i];
    for(int i = 0; i < N; i++){
      assert(L[i] == L[0]);
    }
    cnt = (cnt + 1) * (cnt + 2) / 2;
    cnt %= mod;
    cnt *= A;
    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...