镜中的昆虫 - المسألة

#9086. 镜中的昆虫

الإحصائيات

تم استخدام هذه المسألة في المسابقات التالية:

Ynoi Easy Round 2016 Problems

This problem is prepared by nzhtl1477 .

维护一个长为 $n$ 的序列 $a_i$，有 $m$ 次操作。

将区间 $[l,r]$ 的值修改为 $x$。
询问区间 $[l,r]$ 出现了多少种不同的数，也就是说同一个数出现多次只算一个。

输入格式

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

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

后面 $m$ 行每行为 $1\ l\ r\ x$ 或者 $2\ l\ r$ ，分别表示修改和询问。

输出格式

对于每个询问，输出一个数表示答案。

样例数据

样例输入

样例输出

子任务

Idea：nzhtl1477，Solution：nzhtl1477，Code：nzhtl1477，Data：nzhtl1477

$1\leq n , m \leq 10^5$，$1\leq a_i\leq 10^9$。

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0