Submission #69658668

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  using mint = static_modint<MOD>;
  //using mint = double;
  //using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  std::mt19937 rng(std::random_device{}()); 

  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int n,q;
    cin>>n>>q;
    int a[n+1]={};
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=n-1;i>=0;i--)a[i]+=a[i+1];
    int s=0,t,c;
    for(int i=0;i<q;i++){
      cin>>t;
      if(t==1){
        cin>>c;
        s=(s+c)%n;
      }else{
        int l,r;
        cin>>l>>r;l--;
        l=((l+s)%n);
        r=(r-1+s)%n+1;
        
        if(l<r){
          cout<<a[l]-a[r]<<"\n";
        }else{
          cout<<a[l]+a[0]-a[r]<<"\n";
        }
      }
    }




  
 
   

  }

Submission Info

Judge Result