oj.uz

답안 #1039543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039543 2024-07-31T04:07:18 Z christinelynn Addk (eJOI21_addk) C++17
0 / 100
 53 ms 4692 KB 
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define repo(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"Yes"<<endl
#define cn cout<<"No"<<endl
#define r0 return 0
#define fi first
#define se second
#define mp make_pair
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p3 pair<int,pair<int,int>>
#define p4 pair<pii,pii>
#define fl fflush(stdout)
#define lb long double
using namespace std;
const int mod=1e9+7,maxn=1e5+5,N=(1<<17),INF=1e18;
int arr[maxn];
int pre[maxn],pre2[maxn],suf[maxn],suf2[maxn];
void solve(){
  int n,k;cin>>n>>k;
  repp(i,1,n) {
    cin>>arr[i];
    pre[i]=pre[i-1]+arr[i];
    pre2[i]=pre2[i-1]+i*arr[i];
  }
  for(int i=n;i>=1;i--){
    suf[i]=suf[i+1]+arr[i];
    suf2[i]=suf2[i+1]+(n-i+1)*arr[i];
  }
  int q;cin>>q;
  while(q--){
    int ans=0;
    int t,g;cin>>t;
    if(t==1) repp(i,1,k) cin>>g;
    else {
      int l,r,m;cin>>l>>r>>m;
      int ah=min(m-1,r-l+1-m);
      int midl=l+ah,midr=r-ah;
      int a=l,b=l+ah-1,c=(r-ah+1),d=r;
      int bnyk;
      if(r-l+1>=2*(m-1)) bnyk=m-1;
      else bnyk=r-l+1-2*(ah);
      if(midl<=midr) ans+=(pre[midr]-pre[midl-1])*(bnyk);
      ans+=pre2[b]-pre2[a-1]-(pre[b]-pre[a-1])*(b-ah);
      ans+=suf2[c]-suf2[d+1]-(suf[c]-suf[d+1])*(b-ah);
       cout<<ans<<endl;
    }
  }
}

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

Subtask #1
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 1920 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 4692 KB Output isn't correct
2 Halted 0 ms 0 KB -