結果

問題 No.2017 Mod7 Parade
ユーザー noya2noya2
提出日時 2022-07-22 23:17:38
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 166 ms / 2,000 ms
コード長 4,450 bytes
コンパイル時間 4,547 ms
コンパイル使用メモリ 269,368 KB
実行使用メモリ 51,860 KB
最終ジャッジ日時 2023-09-17 12:16:44
合計ジャッジ時間 7,627 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 131 ms
41,100 KB
testcase_04 AC 87 ms
28,440 KB
testcase_05 AC 65 ms
21,844 KB
testcase_06 AC 144 ms
45,092 KB
testcase_07 AC 20 ms
8,336 KB
testcase_08 AC 82 ms
26,924 KB
testcase_09 AC 32 ms
12,172 KB
testcase_10 AC 84 ms
27,216 KB
testcase_11 AC 115 ms
36,420 KB
testcase_12 AC 101 ms
32,460 KB
testcase_13 AC 166 ms
51,388 KB
testcase_14 AC 165 ms
51,728 KB
testcase_15 AC 165 ms
51,860 KB
testcase_16 AC 166 ms
51,728 KB
testcase_17 AC 166 ms
51,472 KB
testcase_18 AC 165 ms
51,396 KB
testcase_19 AC 127 ms
51,716 KB
testcase_20 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using ppi = pair<P,int>;
using pip = pair<int,P>;
const int INF = 1001001007;
const long long mod1 = 1000000007LL;
const long long mod2 = 998244353LL;
const ll inf = 2e18;
const ld pi = 3.14159265358979323;
const ld eps = 1e-7;
template<typename T>void o(T a);
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
void revs(string &s) {reverse(s.begin(),s.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T>T cel(T a,T b){return (a+b-1)/b;}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
void o(){cout<<"!?"<<endl;}
template<typename T>void o(T a){cout<<a<<endl;}
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
template<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}
vector<int> dx = {0,1,0,-1,1,1,-1,-1};
vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}


void solve(){
    int n; cin >> n;
    vector<ll> d(n), l(n);
    rep(i,n) cin >> d[i] >> l[i];
    auto get = [](int len){
        using sint = static_modint<7>;
        return ((sint(10).pow(len)-1)/sint(9)).val();
    };
    using mint = modint1000000007;
    vector<ll> a(n);
    rep(i,n) a[i] = (get(l[i]) * d[i]) % 7;
    vector<vector<vector<mint>>> dp(n+1,vector<vector<mint>>(6,vector<mint>(7,0)));
    auto jet = [](int x){
        if (x == 0) return 1;
        if (x == 1) return 3;
        if (x == 2) return 2;
        if (x == 3) return 6;
        if (x == 4) return 4;
        return 5;
    };
    dp[0][0][0] = 1;
    rep(i,n) rep(j,6) rep(k,7) {
        dp[i+1][j][k] += dp[i][j][k];
        dp[i+1][(j+l[n-1-i])%6][(k+jet(j)*a[n-1-i])%7] += dp[i][j][k];
    } 
    mint ans = 0;
    rep(i,6) rep(j,7) ans += j * dp[n][i][j];
    out(ans.val());
}

int main(){
    int t = 1; //cin >> t;
    while(t--) solve();
}
0