| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345077 | serikabyde | Addk (eJOI21_addk) | C++20 | 2093 ms | 1880 KiB |
// Yel
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define np next_permutation
#define YES {cout<<"YES";rt}
#define NO {cout<<"NO";rt;}
#define Yes cout<<"Yes";
#define No cout<<"No";
#define rep(st,pl,en) for(ll i=st;i<=en;i+=pl)
#define ll long long
#define sz size()
#define pi pair<int,int>
#define F first
#define S second
#define dot fixed<<setprecision
#define str string
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rt return
#define dl long double
#define Pi 3.141592653589793238462643383279
#define cnl cout<<'\n';
#define nl '\n'
#define co continue
#define int ll
#define open freopen("slalom.in","r",stdin);freopen("slalom.out","w",stdout);
using namespace std;
const int inf=1e18,mod=1e9+7,N=2e5+9;
int a[N];
void abdu_abi(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int q;
cin>>q;
while(q--){
int t;
cin>>t;
if(t==1){
int val;
cin>>val;
}
else{
int l,r,m;
cin>>l>>r>>m;
int ans=0;
for(int i=l;i<=r;i++){
int pos = i - l + 1;
int left = r - i + 1;
int L = max(0LL, m - left);
int R = min(pos - 1, m - 1);
int cnt = max(0LL, R - L + 1);
ans += a[i] * cnt;
}
cout<<ans<<nl;
}
}
}
main(){
fast;
int t=1;
//cin>>t;
while(t--){
abdu_abi();
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
