CodeForces - 371D. Vessels（并查集）

题目链接：http://codeforces.com/problemset/problem/371/D点击打开链接

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:

Add xi liters of water to the pi-th vessel;
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

output

4
5
8

input

output

7
10
5

每个位置满了之后跳转到下一个不满的位置用pre储存这样就不用一次遍历而t

#include <iostream>
#include <stdio.h>
#include <limits.h>
#include <stack>
#include <algorithm>
#include <queue>
#include <string.h>
#include <set>
using namespace std;
int n=0;
struct xjy
{int t;int v;
}a[222222];
int pre[222222];
int findx(int x)
{int r=x;while(pre[r]!=r){r=pre[r];}int i=x;int j;while(pre[i]!=r){j=pre[i];pre[i]=r;i=j;}return r;
}
void join (int x,int y)
{int p1=findx(x);int p2=findx(y);if(p1!=p2){if(p1>p2)pre[p2]=p1;elsepre[p1]=p2;}
}
void add(int num,int addv)
{int r=findx(num);while(addv>0&&r<=n){if((a[r].v-a[r].t)>=addv){a[r].t+=addv;addv=0;}else{addv-=(a[r].v-a[r].t);a[r].t=a[r].v;join(r,r+1);}r=findx(r);}
}
int main()
{for(int i=0;i<=200001;i++)pre[i]=i;scanf("%d",&n);xjy mid;for(int i=1;i<=n;i++){scanf("%d",&mid.v);mid.t=0;a[i]=mid;}int nn=0;scanf("%d",&nn);for(int i=0;i<nn;i++){int midmid;scanf("%d",&midmid);if(midmid==1){int num;int addv;scanf("%d%d",&num,&addv);add(num,addv);}else{int num;scanf("%d",&num);printf("%d\n",a[num].t);}}}

CodeForces - 371D. Vessels（并查集）相关推荐

CodeForces - 371D Vessels 【并查集】
Vessels 题意: 自上而下的n个碗,向某个碗中倒水,如果溢出,则会流向它之下的下一个未满的碗.有两种操作:1 p x表示往第p个碗中导入x的水,2 p表示询问此时第p个碗中的水量. 题解: 未经 ...
Codeforces 371D. Vessels【并查集】
题目大意: 给出一堆从上到下叠起来的容器,有两种操作:第一种是在编号为i的容器中加入x的水(保证水溢出之后会流到下一个最近的容器(如果存在)中):第二种是查询编号为i的容器中有多少水. 做法: 首先, ...
Secret Passwords CodeForces - 1263D（并查集）
One unknown hacker wants to get the admin's password of AtForces testing system, to get problems fro ...
Codeforces 103B - Cthulhu(并查集找环和块)
传送门:https://codeforces.com/problemset/problem/103/B 题意: 给一个n个结点,m条边的无向图判断给定图是否满足以下条件: 能被表示为有3个及以上的有 ...
D. Vessels(并查集+模拟）
https://codeforces.com/problemset/problem/371/D 题意:给一个从上到下容积依次增大的容器,多次操作,给某个容器倒水,如果这个容器满了就会溢出,直到最后一个 ...
Rumor CodeForces - 893C（并查集）
Vova promised himself that he would never play computer games- But recently Firestorm - a well-known ...
Mahmoud and a Dictionary CodeForces - 766D 种类并查集
题意给出多个字符串然后再输入多个字符串之间的关系让我们判断这其中是否存在矛盾的关系有矛盾输出NO 没矛盾输出 YES 然后再输入多个询问每个询问两个字符串让我们判断其中的关系同义词输出 ...
Mr. Kitayuta‘s Technology CodeForces - 505D（并查集+拓扑排序或dfs找环）题解
题目 Shuseki Kingdom is the world's leading nation for innovation and technology. There are n cities ...
Codeforces 437D 贪心+并查集
这个题目让我想起了上次在湘潭赛的那道跪死了的题.也是最值问题,这个也是,有n个动物园每个都有权值然后被m条路径相连接,保证图是连通的,然后求所有的p[i][j]之和.i,j为任意两个zoo,pij ...
Mobile Phone Network CodeForces - 1023F（并查集lca+修改环）
题意: 就是有几个点,你掌控了几条路,你的商业对手也掌控了几条路,然后你想让游客都把你的所有路都走完,那么你就有钱了,但你又想挣的钱最多,真是的过分..哈哈游客肯定要对比一下你的对手的路看看那个便 ...

CodeForces - 371D. Vessels（并查集）

CodeForces - 371D. Vessels（并查集）相关推荐

最新文章

热门文章