樋口円香 - 题目

#7438. 樋口円香

统计

此題目在以下比賽中使用過：

Ynoi 2003 Problems

This problem is prepared by ccz181078 and nzhtl1477 .

给定两个序列 $a_1,\dots,a_n$，$b_1,\dots,b_n$，一开始 $b_i=0$；

你需要进行 $m$ 次操作：

每次操作，给出 $l,r,L$，需要对于$k\in[l,r]$，将 $b_{L+k-l}$ 增加 $a_k$；

最后输出经过所有操作后的序列 $b_1,\dots,b_n$。

输入格式

第一行一个整数 $n$；

第二行 $n$ 个整数 $a_1,\dots,a_n$；

第三行一个整数 $m$；

之后 $m$ 行每行三个整数 $l\;r\;L$，表示一个询问。

输出格式

输出 $n$ 行，表示操作后的 $b_1,\dots,b_n$。

样例数据

样例输入

样例输出

0
1
2

子任务

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

对于 $100\%$ 的数据满足 $0\le a_i\le 1000$；$1\le n\le 10^5$；$1\le m\le 10^6$。

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