301499: CF283A. Cows and Sequence

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Cows and Sequence

题意翻译

贝西和奶牛正在玩序列游戏,需要您的帮助。 它们从一个序列开始,最初仅包含数字0,并执行n次操作。 每个操作是以下之一: 1.将整数$x_{i}$添加到序列的前$a_{i}$元素中。 2.在序列末尾附加一个整数$k_{i}$。 (因此,序列的大小增加1) 3.删除序列的最后一个元素。 因此,序列的大小减少1。 请注意,只有在序列中至少有两个元素时才能执行此操作。 每次操作后,奶牛都想知道序列中所有数字的平均值。

题目描述

Bessie and the cows are playing with sequences and need your help. They start with a sequence, initially containing just the number 0, and perform $ n $ operations. Each operation is one of the following: 1. Add the integer $ x_{i} $ to the first $ a_{i} $ elements of the sequence. 2. Append an integer $ k_{i} $ to the end of the sequence. (And hence the size of the sequence increases by 1) 3. Remove the last element of the sequence. So, the size of the sequence decreases by one. Note, that this operation can only be done if there are at least two elements in the sequence. After each operation, the cows would like to know the average of all the numbers in the sequence. Help them!

输入输出格式

输入格式


The first line contains a single integer $ n (1<=n<=2·10^{5}) $ — the number of operations. The next $ n $ lines describe the operations. Each line will start with an integer $ t_{i} $ $ (1<=t_{i}<=3) $ , denoting the type of the operation (see above). If $ t_{i}=1 $ , it will be followed by two integers $ a_{i},x_{i} $ $ (|x_{i}|<=10^{3}; 1<=a_{i}) $ . If $ t_{i}=2 $ , it will be followed by a single integer $ k_{i} $ $ (|k_{i}|<=10^{3}) $ . If $ t_{i}=3 $ , it will not be followed by anything. It is guaranteed that all operations are correct (don't touch nonexistent elements) and that there will always be at least one element in the sequence.

输出格式


Output $ n $ lines each containing the average of the numbers in the sequence after the corresponding operation. The answer will be considered correct if its absolute or relative error doesn't exceed $ 10^{-6} $ .

输入输出样例

输入样例 #1

5
2 1
3
2 3
2 1
3

输出样例 #1

0.500000
0.000000
1.500000
1.333333
1.500000

输入样例 #2

6
2 1
1 2 20
2 2
1 2 -3
3
3

输出样例 #2

0.500000
20.500000
14.333333
12.333333
17.500000
17.000000

说明

In the second sample, the sequence becomes ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF283A/56857d21d773e19700b8e6f134c0c7d8dc59ae9f.png)

Input

题意翻译

贝西和奶牛正在玩序列游戏,需要您的帮助。 它们从一个序列开始,最初仅包含数字0,并执行n次操作。 每个操作是以下之一: 1.将整数$x_{i}$添加到序列的前$a_{i}$元素中。 2.在序列末尾附加一个整数$k_{i}$。 (因此,序列的大小增加1) 3.删除序列的最后一个元素。 因此,序列的大小减少1。 请注意,只有在序列中至少有两个元素时才能执行此操作。 每次操作后,奶牛都想知道序列中所有数字的平均值。

加入题单

上一题 下一题 算法标签: