#714732 (C++14) No.1331 Moving Penguin

• 問題: No.1331 Moving Penguin
• ユーザー: XD
• 提出日時: 2021-11-12 21:16:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 146 ms / 1,500 ms
• コード長: 3,415 bytes
• コンパイル時間: 1,799 ms
• コンパイル使用メモリ: 167,648 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-07 15:22:23
• 合計ジャッジ時間: 8,335 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	11 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	118 ms; 5,248 KB
testcase_05	AC	115 ms; 5,248 KB
testcase_06	AC	114 ms; 5,248 KB
testcase_07	AC	117 ms; 5,248 KB
testcase_08	AC	116 ms; 5,248 KB
testcase_09	AC	117 ms; 5,248 KB
testcase_10	AC	116 ms; 5,248 KB
testcase_11	AC	117 ms; 5,248 KB
testcase_12	AC	117 ms; 5,248 KB
testcase_13	AC	117 ms; 5,248 KB
testcase_14	AC	116 ms; 5,248 KB
testcase_15	AC	118 ms; 5,248 KB
testcase_16	AC	119 ms; 5,248 KB
testcase_17	AC	115 ms; 5,248 KB
testcase_18	AC	114 ms; 5,248 KB
testcase_19	AC	115 ms; 5,248 KB
testcase_20	AC	115 ms; 5,248 KB
testcase_21	AC	116 ms; 5,248 KB
testcase_22	AC	115 ms; 5,248 KB
testcase_23	AC	117 ms; 5,248 KB
testcase_24	AC	120 ms; 5,248 KB
testcase_25	AC	118 ms; 5,248 KB
testcase_26	AC	121 ms; 5,248 KB
testcase_27	AC	123 ms; 5,248 KB
testcase_28	AC	117 ms; 5,248 KB
testcase_29	AC	119 ms; 5,248 KB
testcase_30	AC	42 ms; 5,248 KB
testcase_31	AC	70 ms; 5,248 KB
testcase_32	AC	38 ms; 5,248 KB
testcase_33	AC	55 ms; 5,248 KB
testcase_34	AC	80 ms; 5,248 KB
testcase_35	AC	131 ms; 5,248 KB
testcase_36	AC	132 ms; 5,248 KB
testcase_37	AC	131 ms; 5,248 KB
testcase_38	AC	44 ms; 5,248 KB
testcase_39	AC	114 ms; 5,248 KB
testcase_40	AC	61 ms; 5,248 KB
testcase_41	AC	122 ms; 5,248 KB
testcase_42	AC	143 ms; 5,248 KB
testcase_43	AC	145 ms; 5,248 KB
testcase_44	AC	146 ms; 5,248 KB
testcase_45	AC	146 ms; 5,248 KB
testcase_46	AC	146 ms; 5,248 KB
testcase_47	AC	143 ms; 5,248 KB
testcase_48	AC	118 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
#define forn(i,s,t) for(register int i=(s); i<=(t); ++i)
#define forl(i,s,t) for(register i64 i=(s); i<=(t); ++i)
#define form(i,s,t) for(register int i=(s); i>=(t); --i)
#define rep(i,s,t) for(register int i=(s); i<(t); ++i)
#define IT(u) for(register int i=G[u]; i; i=E[i].nxt)
using namespace std;
namespace FASTIO {
	const int SIZ = 1 << 26 | 1;
	char ibuf[SIZ], obuf[SIZ], *iS = ibuf, *iT = ibuf, *oS = obuf, *oT = obuf + SIZ - 1, qwq[60], qaq;
	#define gc() (iS == iT && (iT = (iS = ibuf) + fread(ibuf, 1, SIZ, stdin), iS == iT) ? EOF : *iS++)
	template<typename T>
	inline void Rdn(T& A) {
		register bool fl = 0;
		register char ch = gc(); A = 0;
		while(!isdigit(ch)) fl = (ch == '-'), ch = gc();
		while(isdigit(ch)) A = (A * 10) + (ch & 15), ch = gc();
		fl && (A = -A);
	}
	inline void Rdn(char& c) {while((c = gc()) == ' ' || c == '\n' || c == '\r');}
	inline void Rdn(char* s) {
		while((*s = gc()) == ' ' || *s == '\n' || *s == '\r') ;
		if(*s == EOF) return ;
		while(*s != ' ' && *s != '\n' && *s != '\r' && *s != EOF) *(++s) = gc();
		*s = 0;
	}
	template<typename T, typename ...U>
	inline void Rdn(T& A, U& ...B) {Rdn(A), Rdn(B...);}
	inline void flush() {fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;}
	inline void pc(char c) {*oS ++ = c; if(oS == oT) flush();}
	template<typename T>
	inline void Wtn(T A) {
		if(!A) return pc('0'); if(A < 0) pc('-'), A = -A;
		while(A) qwq[++qaq] = A % 10 + '0', A /= 10;
		while(qaq) pc(qwq[qaq -- ]);
	}
	inline void Wtn(char A) {pc(A);}
	inline void Wtn(char *s) {while(*s) pc(*s), ++s;}
	inline void Wtn(const char *s) {while(*s) pc(*s), ++s;}
	template<typename T, typename ...U>
	inline void Wtn(T A, U ...B) {Wtn(A), Wtn(B...);}
#undef gc
}
using FASTIO :: Rdn;
using FASTIO :: Wtn;
using FASTIO :: flush;
const int Mod = 1e9 + 7;
namespace Modint {
	struct Mint {
		int res;
		Mint() {}
		Mint(int _r) : res(_r) {}
		inline friend Mint operator + (const Mint& A, const Mint& B) {
			return Mint((A.res + B.res >= Mod) ? (A.res + B.res - Mod) : (A.res + B.res));
		}
		inline friend Mint operator - (const Mint& A, const Mint& B) {return A + Mint(Mod - B.res); }
		inline friend Mint operator * (const Mint& A, const Mint& B) {return Mint(1ll * A.res * B.res % Mod); }
		inline friend Mint& operator += (Mint& A, const Mint& B) {return A = A + B; }
		inline friend Mint& operator -= (Mint& A, const Mint& B) {return A = A - B; }
		inline friend Mint& operator *= (Mint& A, const Mint& B) {return A = A * B; }
		inline friend Mint q_pow(Mint p, int k) {
			Mint res(1);
			for (; k; k >>= 1, p *= p) (k & 1) && (res *= p, 0);
			return res;
		}
	} ;
}
using Modint :: Mint;
typedef long long i64;
typedef double f64;
typedef unsigned long long u64;
typedef pair<i64, i64> pii;
typedef pair<int, u64> piu;
const int N = 1e5 + 5, M = 330;
const i64 INF = 1e18;
inline void init() {}
int n, a[N]; Mint f[N], g[M][M];
inline void solve() {
	Rdn(n);
	forn (i, 1, n) Rdn(a[i]);
	f[1] = Mint(1);
	int B = 300;
	forn (i, 1, n) {
		forn (j, 1, B) f[i] += g[j][i % j];
		bool fl = 0;
		if (a[i] > B) {
			for (int j = i + a[i]; j <= n; j += a[i]) f[j] += f[i], fl |= (j == i + 1);
		} else {
			g[a[i]][i % a[i]] += f[i], fl |= ((i + 1) % a[i] == i % a[i]);
		}
		if (!fl) f[i + 1] += f[i];
//		Wtn(f[i].res, " \n"[i == n]);
	}
	Wtn(f[n].res, '\n');
}
int Trd;
int main() {
	Trd = 1;
	while(Trd--) init(), solve(); flush();
	return 0;
}