oj.uz

답안 #1071428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071428 2024-08-23T07:20:05 Z vjudge1 Addk (eJOI21_addk) C++
0 / 100
 138 ms 4752 KB 
// Balgabaev Mansur
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define int long long


using namespace std;

const int N=1e6+7;
const int MOD=1e9+7;
const int INF=1e18;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

int a[N],pref[N];

void solve(){
	int n,k;
	cin >> n >> k;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
		pref[i]=pref[i-1]+a[i];
	}	
	int q;
	cin >> q;
	while(q--){
		int tp,l,r,x,ans=0;
		cin >> tp >> l >> r >> x;
		if(tp == 2){
			for(int i = l ; i <= r ; i++){
				if(i+x-1 <= r){
					ans+=pref[i+x-1]-pref[i-1];
				}
			}
			cout << ans << '\n';
		}
	}
}	
 
signed main() {
   // freopen("closing.in", "r", stdin);
   // freopen("closing.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int test = 1,cntx=1;
    //cin >> test;
    while (test--) {
	//cout << "Case " << 	cntx << ':' << '\n';
        solve();
        cntx++;
	}		
    return 0;
}

Subtask #1
0 / 36.0

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

Subtask #2
0 / 56.0

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

Subtask #3
0 / 8.0

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