oj.uz

Submission #765826

# Submission time Handle Problem Language Result Execution time Memory
765826 2023-06-25T06:03:27 Z vjudge1 Addk (eJOI21_addk) C++17
36 / 100
 2000 ms 2688 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

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

#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define len(x) (int)x.size()
#define ull unsigned long long
#define F first
#define S second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define int long long

using namespace std;
using namespace __gnu_pbds;
using ll = long long;

const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
int n,k,q,a[N],p[N],b[N];

main(){
	// freopen("txt.in", "r", stdin);
	// freopen("txt.out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> k;
	for (int i=1;i<=n;i++){
		cin >> a[i];
		p[i] = p[i-1] + a[i];
	}
	cin >> q;
	while(q--){
		int t;
		cin >> t;
		if (t==1){
			for (int i=1;i<=k;i++){
				cin >> b[i];
			}
		}
		else{
			int l,r,m;
			cin >> l >> r >> m;
			int sum = 0;
			for (int i=l+m-1;i<=r;i++){
				sum+=p[i] - p[i-m];
			}
			cout << sum << '\n';
		}
	}
}

//order_of_key(k): Number of items strictly smaller than k .
//find_by_order(k): K-th element in a set (counting from zero).

//sum of squares n*(n+1)*(2n+1)/6
//sum of cubes [n*(n+1)/2]^2
//sum of squares for odds n*(4*n*n-1)/3
//sum of cubes for odds n*n*(2*n*n-1)

//a/b%mod = a*(b^(m-2)%mod)
//(a>>x)&1 == 0
//a^b = (a+b)-2(a&b)

//srand(time(0))-always changing

Compilation message

Main.cpp:26:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   26 | main(){
      | ^~~~

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 9 ms 468 KB Output is correct
7 Correct 10 ms 488 KB Output is correct
8 Correct 14 ms 544 KB Output is correct
9 Correct 28 ms 712 KB Output is correct

Subtask #2
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 888 KB Output is correct
2 Correct 210 ms 1212 KB Output is correct
3 Correct 373 ms 1632 KB Output is correct
4 Correct 1510 ms 2492 KB Output is correct
5 Execution timed out 2087 ms 2688 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 618 ms 1508 KB Output isn't correct
2 Halted 0 ms 0 KB -