【Educational Codeforces Round 71 (Rated for Div. 2) F Remainder Problem【分块】

最新推荐文章于 2020-11-04 21:08:52 发布

pxlsdz

最新推荐文章于 2020-11-04 21:08:52 发布

阅读量317

点赞数

分类专栏：好题数论——除法分块数学----数论

本文链接：https://blog.csdn.net/sdz20172133/article/details/100559480

版权

好题同时被 3 个专栏收录

226 篇文章 2 订阅

订阅专栏

数学----数论

110 篇文章 1 订阅

订阅专栏

数论——除法分块

2 篇文章 0 订阅

订阅专栏

https://codeforces.com/contest/1207/problem/F

F. Remainder Problem

time limit per test

4 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

You are given an array aa consisting of 500000500000 integers (numbered from 11 to 500000500000). Initially all elements of aa are zero.

You have to process two types of queries to this array:

11 xx yy — increase axax by yy;
22 xx yy — compute ∑i∈R(x,y)ai∑i∈R(x,y)ai, where R(x,y)R(x,y) is the set of all integers from 11 to 500000500000 which have remainder yy modulo xx.

Can you process all the queries?

Input

The first line contains one integer qq (1≤q≤5000001≤q≤500000) — the number of queries.

Then qq lines follow, each describing a query. The ii-th line contains three integers titi, xixi and yiyi (1≤ti≤21≤ti≤2). If ti=1ti=1, then it is a query of the first type, 1≤xi≤5000001≤xi≤500000, and −1000≤yi≤1000−1000≤yi≤1000. If ti=2ti=2, then it it a query of the second type, 1≤xi≤5000001≤xi≤500000, and 0≤yi<xi0≤yi<xi.

It is guaranteed that there will be at least one query of type 22.

Output

For each query of type 22 print one integer — the answer to it.

Example

input

Copy

output

Copy

4
4
0

题意：

一个长度为50000的数组a[]，初始为0，有两个操作：

1 x y:a[x]+=y
2 x y: if(i%x==y) sum+=a[i],输出sum

分析：

因为i%x=y，正好满足分块的性质，所以用分块去做

sqrt（500000）<=710,

所以对于模数x<=710的直接用b[i][y]保存答案，表示模i为y的答案，对于y大于710，暴力跑一遍即可（sqrt(n))。

#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
const int K = 710;
#define LL long long
int a[N];
int b[K][K];

int main()
{
    int q;
    scanf("%d", &q);
    for(int i = 0; i < q; i++)
    {
        int t, x, y;
        scanf("%d %d %d", &t, &x, &y);
        if(t == 1)
        {
        	a[x]+=y;
            for(int i=1; i<K; i++)
                b[i][x%i]+=y;
        }
        else
        {
        	LL res=0;
            if(x>=K)
            {
            	
                for(int i=y; i<=N; i+=x)
                {
                    res+=a[i];
                }
                cout<<res<<endl;
            }
            else
            {
                cout<<b[x][y]<<endl;
            }
        }
    }
    return 0;
}