这是一个关于编程竞赛的问题，要求处理两种类型的查询：一种是增加数组中某个元素的值，另一种是计算在指定范围内模x余数为y的所有元素之和。对于第二种查询，当x小于或等于500000时，可以预先计算并存储结果，否则需要动态枚举。题目保证至少有一个类型2的查询。
time limit per test : 4 seconds
memory limit per test : 512 megabytes
分数：2100
You are given an array a a a consisting of 500000 integers (numbered from 1 to 500000). Initially all elements of a a a are zero.
You have to process two types of queries to this array:
1 x y — i n c r e a s e a x b y y 1 \ x \ y — increase \ a_x \ by \ y 1 x y—increase ax by y;
2 x y — c o m p u t e ∑ i ∈ R ( x , y ) a i 2 \ x \ y — compute ∑i∈_{R(x,y)}a_i 2 x y—compute∑i∈R(x,y)ai, where R ( x , y ) R(x,y) R(x,y) is the set of all integers from 1 to 500000 which have remainder y y y modulo x x x . Can you process all the queries?
Input
The first line contains one integer q ( 1 ≤ q ≤ 500000 ) q(1≤q≤500000) q(1≤q≤
最低0.47元/天 解锁文章
扫一扫
169
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
