CodeForces - 371D Vessels——并查集

D. Vessels

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a system of n vessels arranged one above the other as shown in the figure below. Assume that the vessels are numbered from 1 to n, in the order from the highest to the lowest, the volume of the i-th vessel is ai liters.

Initially, all the vessels are empty. In some vessels water is poured. All the water that overflows from the i-th vessel goes to the (i + 1)-th one. The liquid that overflows from the n-th vessel spills on the floor.

Your task is to simulate pouring water into the vessels. To do this, you will need to handle two types of queries:

1. Add xi liters of water to the pi-th vessel;
2. Print the number of liters of water in the ki-th vessel.

When you reply to the second request you can assume that all the water poured up to this point, has already overflown between the vessels.

Input

The first line contains integer n — the number of vessels (1 ≤ n ≤ 2·105). The second line contains n integers a1, a2, ..., an — the vessels' capacities (1 ≤ ai ≤ 109). The vessels' capacities do not necessarily increase from the top vessels to the bottom ones (see the second sample). The third line contains integer m — the number of queries (1 ≤ m ≤ 2·105). Each of the next m lines contains the description of one query. The query of the first type is represented as "1 pi xi", the query of the second type is represented as "2 ki" (1 ≤ pi ≤ n, 1 ≤ xi ≤ 109, 1 ≤ ki ≤ n).

Output

For each query, print on a single line the number of liters of water in the corresponding vessel.

Examples

input

2
5 10
6
1 1 4
2 1
1 2 5
1 1 4
2 1
2 2

output

4
5
8

input

3
5 10 8
6
1 1 12
2 2
1 1 6
1 3 2
2 2
2 3

output

7
10
5

题意：给定一系列盆 有两个操作 一个是从某个盆里加指定的水 另一个是查询给定编号的盆里水的量 盆满了就会直接流向下一个盆

思路：并查集 用来维护这个盆满了以后 溢出到的下个盆的编号

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int num[210000],pre[210000],now[210000];
int pour(int x,int y)
{
	if(x==-1);
	else if(now[x]==num[x])
	{
		return pre[x]=pour(pre[x],y);
	}
	else if(now[x]<num[x])
	{
		now[x]+=y;
		if(now[x]>num[x])
		{
			int t=now[x]-num[x];
			now[x]=num[x];
			return pre[x]=pour(pre[x],t);
		}
		else
		{
			return x;
		}
	}
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int i,t;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&num[i]);
			pre[i]=i+1;
			now[i]=0;
		}
		pre[n]=-1;
		int m;
		scanf("%d",&m);
		while(m--)
		{
			int t;
			scanf("%d",&t);
			if(t==1)
			{
				int a,b;
				scanf("%d%d",&a,&b);
				pour(a,b);
			}
			else if(t==2)
			{
				int a;
				scanf("%d",&a);
				printf("%d\n",now[a]);
			}
		}
		
	}
}