QOJ.ac

QOJ

Time Limit: 0.5 s Memory Limit: 500 MB Total points: 100

#7481. 大学

الإحصائيات

题目描述

一个长为 $n$ 的非负整数序列 $a$,支持以下两个操作:

  • 1 l r x:把区间 $[l,r]$ 中所有 $x$ 的倍数除以 $x$。
  • 2 l r:查询区间 $[l,r]$ 的和。

本题强制在线,每次的 $l,r,x$ 需要 xor 上上次答案,如果之前没有询问,则上次答案为 $0$。

输入格式

第一行两个整数表示 $n,m$。

第二行 $n$ 个非负整数表示 $a_i$。

之后 $m$ 行每行一个操作。

  • 1 l r x:把区间 $[l,r]$ 中所有 $x$ 的倍数除以 $x$。
  • 2 l r:查询区间 $[l,r]$ 的和。

输出格式

对于每次询问,输出一行一个整数表示答案。

样例 #1

样例输入 #1

5 2
1 2 3 4 5
1 1 5 2
2 1 5

样例输出 #1

12

提示

$1\leq n,m\leq 10^5$,$0\leq a_i\leq 5\times 10^5$,解密后的 $x,l,r$ 满足 $1\leq x\leq 5\times 10^5$,$1\leq l\leq r\leq n$。

Idea:nzhtl1477

Solution:nzhtl1477

Code:nzhtl1477,mrsrz

Data:nzhtl1477,mrsrz

Discussions

About Discussions

The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.