未来日记 - 問題

#9033. 未来日记

統計

この問題は以下のコンテストで使用されています：

Ynoi 2018 Problems

我妻由乃给了你一个长为 $n$ 的序列 $a$，有 $m$ 次操作。

把区间 $[l,r]$ 内所有的 $x$ 变成 $y$。
查询区间 $[l,r]$ 内第 $k$ 小值。

输入格式

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

第二行 $n$ 个整数表示序列 $a$。

后面 $m$ 行：

1 l r x y : 把区间 $[l,r]$ 中所有 $x$ 变成 $y$。

2 l r k : 查询区间 $[l,r]$ 中的 $k$ 小值。

输出格式

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

样例数据

样例输入

样例输出

2
1

子任务

Idea：f321dd，Solution：f321dd&nzhtl1477，Code：nzhtl1477&Claris，Data：nzhtl1477&Juan_feng

$1\le n,m,a_i \le 10^5$。

By f321dd & nzhtl1477 & Claris

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