oj.uz

답안 #775006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775006 2023-07-06T06:41:13 Z vjudge1 Addk (eJOI21_addk) C++17
36 / 100
 2000 ms 4116 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("bmi,bmi2,lzcnt,popcnt")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
//#pragma expected_value
//#pragma isolated_call
//#pragma disjoint

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

//using namespace __gnu_pbds;
using namespace std;

#define int long long
//#define double long double
#define Fi first
#define Se second
#define Rep(i,a,b) for (int i=a;i<=b;++i)
#define Repu(i,b,a) for (int i=b;i>=a;--i)
#define pb push_back
#define ms(a,i) memset(a,i,sizeof(a))
#define sz size()
#define mp make_pair
#define endl '\n'
#define sef setprecision(6)<<fixed
#define cer cout<<"cak"<<endl;

typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<double> va;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<va> vva;

//const double EPS=1e-9;
const double PI=acos(-1);
const long long oo=1e18;
const int MN=1e6+5;
const int mod=1e9+7;

using cd=complex<double>;

//typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> index_set;

int n,k,q;
int a[MN];

int pre[MN];
int sum[MN];

int doi[15];

signed main() {
  	//freopen(".inp","r",stdin); freopen(".out","w",stdout);
  	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin>>n>>k;
	Rep(i,1,n) cin>>a[i];
	Rep(i,1,n) {
		sum[i] = sum[i-1] + a[i];
	}

	cin>>q;

	while(q--) {
		int type; cin>>type;
		if(type==1) {
			Rep(i,1,k) cin>>doi[i];
			continue;
		}
		int l,r,m; cin>>l>>r>>m;
		int ans=0;
		Rep(i,l,r) {
			if(i+m-1<=r) ans += sum[i+m-1]-sum[i-1];
		}
		cout<<ans<<endl;
	}
}

Subtask #1
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 4 ms 372 KB Output is correct
4 Correct 6 ms 420 KB Output is correct
5 Correct 9 ms 468 KB Output is correct
6 Correct 13 ms 588 KB Output is correct
7 Correct 19 ms 588 KB Output is correct
8 Correct 25 ms 632 KB Output is correct
9 Correct 48 ms 772 KB Output is correct

Subtask #2
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 1340 KB Output is correct
2 Correct 407 ms 1940 KB Output is correct
3 Correct 756 ms 2560 KB Output is correct
4 Execution timed out 2053 ms 4116 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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