#222932 (C++17) No.612 Move on grid

• 問題: No.612 Move on grid
• ユーザー: mai
• 提出日時: 2017-12-12 01:04:27
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 248 ms / 2,500 ms
• コード長: 6,931 bytes
• コンパイル時間: 3,018 ms
• コンパイル使用メモリ: 217,736 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-12-18 00:45:44
• 合計ジャッジ時間: 5,930 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 6,816 KB
testcase_01	AC	4 ms; 6,816 KB
testcase_02	AC	5 ms; 6,820 KB
testcase_03	AC	37 ms; 6,816 KB
testcase_04	AC	248 ms; 6,816 KB
testcase_05	AC	181 ms; 6,816 KB
testcase_06	AC	159 ms; 6,820 KB
testcase_07	AC	192 ms; 6,820 KB
testcase_08	AC	156 ms; 6,816 KB
testcase_09	AC	153 ms; 6,820 KB
testcase_10	AC	103 ms; 6,820 KB
testcase_11	AC	52 ms; 6,824 KB
testcase_12	AC	110 ms; 6,820 KB
testcase_13	AC	69 ms; 6,820 KB
testcase_14	AC	126 ms; 6,816 KB
testcase_15	AC	48 ms; 6,816 KB
testcase_16	AC	148 ms; 6,820 KB
testcase_17	AC	67 ms; 6,820 KB
testcase_18	AC	126 ms; 6,816 KB
testcase_19	AC	97 ms; 6,820 KB
testcase_20	AC	156 ms; 6,816 KB

コンパイルメッセージ

main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:58:9: warning: no return statement in function returning non-void [-Wreturn-type]
   58 |         }
      |         ^

ソースコード

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(0); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif __GNUC__
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;



class llmod {
private:
    ll val_;
    inline ll cut(ll v) const { return ((v%MOD) + MOD) % MOD; }
public:
    static const ll MOD = MD; // <= 

    llmod() : val_(0) {}
    llmod(ll num) :val_(cut(num)) {}
    llmod(const llmod& lm) : val_(lm.val_) {}

    inline operator ll() const { return val_; }
    inline ll operator *() const { return val_; }
    inline llmod& operator=(const llmod& lm) { val_ = lm.val_; return *this; }
    inline llmod& operator=(ll v) { val_ = cut(v); return *this; }

    inline llmod& operator+=(ll v) { val_ = cut(val_ + v); return *this; }
    inline llmod& operator+=(const llmod& l) { val_ = cut(val_ + l.val_); return *this; }
    inline llmod& operator-=(ll v) { val_ = cut(val_ - v); return *this; }
    inline llmod& operator-=(const llmod& l) { val_ = cut(val_ - l.val_); return *this; }
    inline llmod& operator*=(ll v) { val_ = cut(val_ * v); return *this; }
    inline llmod& operator*=(const llmod& l) { val_ = cut(val_ * l.val_); return *this; }
    inline llmod& operator++() { val_ = (val_ + 1) % MOD; return *this; }
    inline llmod operator++(int) { llmod t = *this; val_ = (val_ + 1) % MOD; return t; }
};
ostream& operator<<(ostream& os, const llmod& l) { os << *l; return os; }

inline llmod operator+(llmod t, const llmod& r) { return t += r; }
inline llmod operator-(llmod t, const llmod& r) { return t -= r; }
inline llmod operator*(llmod t, const llmod& r) { return t *= r; }



// MEMO : 逆元...powm(n,MD-2)
llmod pow(llmod x, ll p) {
    llmod y = 1;
    while (0 < p) {
        if (p % 2)
            y *= x;
        x *= x;
        p /= 2;
    }
    return y;
}

inline llmod& operator/=(llmod& l, const llmod& r) { return l *= pow(r, llmod::MOD - 2); }




ll te, aa, bb, cc, dd, ee;

inline bool isin(int x, int left, int right) {
    return left <= x && x <= right;
}

int main() {

    scanner >> te >> aa >> bb >> cc >> dd >> ee;

    dd += 10010;
    ee += 10010;

    vector<llmod> dp(20020);
    dp[10010] = 1;

    repeat(lop, te) {
        vector<llmod> dp2(20020);
        for (ll x = 1; x < 20018; ++x) {
            ll y = dp[x];
            if (isin(x + aa, 0, 20019))
                dp2[x + aa] += y;
            if (isin(x - aa, 0, 20019))
                dp2[x - aa] += y;
            if (isin(x + bb, 0, 20019))
                dp2[x + bb] += y;
            if (isin(x - bb, 0, 20019))
                dp2[x - bb] += y;
            if (isin(x + cc, 0, 20019))
                dp2[x + cc] += y;
            if (isin(x - cc, 0, 20019))
                dp2[x - cc] += y;
        }
        dp2.swap(dp);
    }

    llmod ans = 0;
    for (ll x = dd; x <= ee; ++x) {
        ans += dp[x];
    }

    cout << *ans << endl;

    return 0;
}