結果

問題 No.1172 Add Recursive Sequence
コンテスト
ユーザー ningenMe
提出日時 2020-08-14 23:02:53
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,021 bytes
コンパイル時間 2,499 ms
コンパイル使用メモリ 193,512 KB
最終ジャッジ日時 2025-01-13 00:36:01
ジャッジサーバーID
（参考情報） 		judge4 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 12 TLE * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:41:25: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘std::array<long long int, 100001>::value_type*’ {aka ‘long long int*’} [-Wformat=]
   41 |                 scanf("%d",&A[i]);
      |                        ~^
      |                         |
      |                         int*
      |                        %lld
main.cpp:44:25: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘std::array<long long int, 201>::value_type*’ {aka ‘long long int*’} [-Wformat=]
   44 |                 scanf("%d",&C[i]);
      |                        ~^
      |                         |
      |                         int*
      |                        %lld
main.cpp:59:27: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 2 has type ‘std::array<long long int, 100001>::value_type’ {aka ‘long long int’} [-Wformat=]
   59 |                 printf("%ld\n",X[i]%MOD);
      |                         ~~^
      |                           |
      |                           long int
      |                         %lld
main.cpp:37:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   37 |         scanf("%d%d%d",&K,&N,&M);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:41:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   41 |                 scanf("%d",&A[i]);
      |                 ~~~~~^~~~~~~~~~~~
main.cpp:44:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   44 |                 scanf("%d",&C[i]);
      |                 ~~~~~^~~~~~~~~~~~

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int K,N,M;
	scanf("%d%d%d",&K,&N,&M);
	array<ll,100001> A,X;
	array<ll,201> C;
	for(int i = 0; i < K; ++i) {
		scanf("%d",&A[i]);
	}
	for(int i = 1; i <= K; ++i) {
		scanf("%d",&C[i]);
	}
	for(int i = K; i <= N; ++i) {
		for(int j = 1; j <= K; ++j) {
			A[i] += (C[j]*A[i-j]) % MOD;
			A[i] %= MOD;
		}
	}
	for(int i = 0; i < M; ++i) {
		int l,r; cin >> l >> r;
		for(int j = l; j < r; ++j) {
			(X[j] += A[j-l]) %= MOD;
		}
	}
	for(int i = 0; i < N; ++i) {
		printf("%ld\n",X[i]%MOD);
	}
    return 0;
}
0