test/yukicoder/4271.avx2.test.cpp

• View this file on GitHub
• Last update: 2020-11-14 15:24:41+09:00
• Problem: https://yukicoder.me/problems/4271

Depends on

• tools/avx2.cpp

Code

// verification-helper: PROBLEM https://yukicoder.me/problems/4271

#define call_from_test
#include "../../tools/avx2.cpp"
#undef call_from_test

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

const int MAX = 1e5;
const int MOD = 1e9+7;
using uint = unsigned int;

inline uint add_mod(uint a, uint b) {
  return (a += b) >= MOD ? a - MOD : a;
}

uint mul(uint x,uint y){
  return 1ULL*x*y%MOD;
}

uint xs[MAX]={};
uint as[MAX]={};
uint cs[MAX]={};

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  const char newl = '\n';

  int k,n,m;
  cin>>k>>n>>m;
  for(int i=0;i<k;i++) cin>>as[i];
  for(int i=0;i<k;i++) cin>>cs[i];

  for(int i=k;i<n;i++)
    for(int j=0;j<k;j++)
      as[i]=add_mod(as[i],mul(cs[j],as[i-(j+1)]));

  for(int i=0;i<m;i++){
    int l,r;
    cin>>l>>r;
    for(int k=l;k<r;k++) xs[k]=add_mod(xs[k],as[k-l]);
  }

  for(int i=0;i<n;i++) cout<<xs[i]<<newl;
  return 0;
}

#line 1 "test/yukicoder/4271.avx2.test.cpp"
// verification-helper: PROBLEM https://yukicoder.me/problems/4271

#define call_from_test
#line 1 "tools/avx2.cpp"

#include <bits/stdc++.h>
using namespace std;
#endif
// https://beet-aizu.hatenablog.com/entry/2020/09/04/173522
//BEGIN CUT HERE
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2") // or sse4
#pragma GCC optimize("unroll-loops")
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 5 "test/yukicoder/4271.avx2.test.cpp"
#undef call_from_test

#line 8 "test/yukicoder/4271.avx2.test.cpp"
using namespace std;

const int MAX = 1e5;
const int MOD = 1e9+7;
using uint = unsigned int;

inline uint add_mod(uint a, uint b) {
  return (a += b) >= MOD ? a - MOD : a;
}

uint mul(uint x,uint y){
  return 1ULL*x*y%MOD;
}

uint xs[MAX]={};
uint as[MAX]={};
uint cs[MAX]={};

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  const char newl = '\n';

  int k,n,m;
  cin>>k>>n>>m;
  for(int i=0;i<k;i++) cin>>as[i];
  for(int i=0;i<k;i++) cin>>cs[i];

  for(int i=k;i<n;i++)
    for(int j=0;j<k;j++)
      as[i]=add_mod(as[i],mul(cs[j],as[i-(j+1)]));

  for(int i=0;i<m;i++){
    int l,r;
    cin>>l>>r;
    for(int k=l;k<r;k++) xs[k]=add_mod(xs[k],as[k-l]);
  }

  for(int i=0;i<n;i++) cout<<xs[i]<<newl;
  return 0;
}

Back to top page