제출 #1007464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007464		fanwen	육각형 영역 (APIO21_hexagon)	C++17	9 / 100	0 ms	604 KiB

hexagon

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

using namespace std;
// using namespace __gnu_pbds;

#define fi first
#define se second
#define REP(i, n) for (auto i = 0; i < (n); ++i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (auto i = (a); i >= (b); --i)
#define FORE(i, a, b) for (auto i = (a); i < (b); ++i)
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define left ___left 
#define right ___right 
#define __builtin_popcount __builtin_popcountll

template <class T>
T inverse(T a, T m) {
    assert(0 <= a and a < m);
    T x = a, y = m;
    T vx = 1, vy = 0;
    while (x) {
        T k = y / x;
        y %= x;
        vy -= k * vx;
        swap(x, y);
        swap(vx, vy);
    }
    assert(y == 1);
    return vy < 0 ? m + vy : vy;
}
 
template <class T>
struct static_modint {
 
    static constexpr int mod() { return T::mod; }
 
    int val;
 
    static_modint(long long x = 0) : val(x % mod()) { if(val < 0) val += mod(); }
 
    friend bool operator == (const static_modint &a, const static_modint &b) { return a.val == b.val; }
    friend bool operator != (const static_modint &a, const static_modint &b) { return a.val != b.val; }
    friend bool operator < (const static_modint &a, const static_modint &b) { return a.val < b.val; }
    friend bool operator > (const static_modint &a, const static_modint &b) { return a.val > b.val; }
    friend bool operator <= (const static_modint &a, const static_modint &b) { return a.val <= b.val; }
    friend bool operator >= (const static_modint &a, const static_modint &b) { return a.val >= b.val; }
 
    static_modint& operator = (const long long &x) { val = x % mod(); if(val < 0) val += mod(); return *this; }
    static_modint& operator = (const static_modint &x) { val = x.val; return *this; }
 
    friend istream & operator >> (istream &in, static_modint &a) { long long x; in >> x; a = static_modint(x); return in; }
    friend ostream & operator << (ostream &out, const static_modint &a) { return out << a.val; }
 
    explicit operator int() const { return val; }
    explicit operator bool() const { return val > 0; }
 
    static_modint inv() const {
        static_modint res;
        res.val = inverse(val, mod());
        return res;
    }
 
    static_modint operator ++() { (*this) += 1; return *this; }
    static_modint operator --() { (*this) -= 1; return *this; }
    static_modint operator ++(int) { (*this) += 1; return *this - 1; }
    static_modint operator --(int) { (*this) -= 1; return *this + 1; }
 
    static_modint operator + () const { return *this; }
    static_modint operator - () const {
        static_modint res;
        res.val = (val ? mod() - val : 0);
        return res;
    }
 
    static_modint& operator += (const static_modint &a) {
        val += a.val;
        if(val >= mod()) val -= mod();
        return *this;
    }
    static_modint& operator -= (const static_modint &a) {
        val -= a.val;
        if(val < 0) val += mod();
        return *this;
    }
    static_modint& operator *= (const static_modint &a) {
        val = 1LL * val * a.val % mod();
        return *this;
    }
    static_modint& operator /= (const static_modint &a) {
        (*this) *= a.inv();
        return *this;
    }
    friend static_modint operator + (const static_modint &a, const static_modint &b) { return static_modint(a) += b; }
    friend static_modint operator - (const static_modint &a, const static_modint &b) { return static_modint(a) -= b; }
    friend static_modint operator * (const static_modint &a, const static_modint &b) { return static_modint(a) *= b; }
    friend static_modint operator / (const static_modint &a, const static_modint &b) { return static_modint(a) /= b; }
};
 
 
template <class T> T pow(T a, long long b) {
    T ans = 1, mul = a;
    for (; b > 0; b >>= 1) {
        if(b & 1LL) ans *= mul;
        mul *= mul;
    }
    return ans;
}
 
struct modular {
    static constexpr int mod = static_cast <int> (
        1e9 + 7
        // 998244353
        // 1e9 + 9
    );
};
 
// struct modular { static int mod; }; int modular::mod = 1;

using Modint = static_modint <modular>;

int draw_territory(int N, int A, int B, vector <int> D, vector <int> L) {
    int d = L[0]; 
    Modint res = Modint(d + 1) * (d + 2) / 2; 
    Modint sum = Modint(d) * (d + 1) * (d + 2) / 3; 
    return (res * A + sum * B).val; 
}

#ifdef LOCAL
 
#include <cassert>
#include <cstdio>
 
#include <vector>
 
int main() {
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
  int N, A, B;
  assert(3 == scanf("%d %d %d", &N, &A, &B));
  std::vector<int> D(N), L(N);
  for (int i = 0; i < N; ++i) {
    assert(2 == scanf("%d %d", &D[i], &L[i]));
  }
 
  int result = draw_territory(N, A, B, D, L);
  printf("%d\n", result);
  return 0;
}

#endif

// Dream it. Wish it. Do it.

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 0 / 19
• Subtask 7: 0 / 18
• Subtask 8: 0 / 16