Codeforces 195B After Training 线段树的维护

传送门：点击打开链接

B. After Training

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

After a team finished their training session on Euro football championship, Valeric was commissioned to gather the balls and sort them into baskets. Overall the stadium has n balls and m baskets. The baskets are positioned in a row from left to right and they are numbered with numbers from 1 to m, correspondingly. The balls are numbered with numbers from 1 to n.

Valeric decided to sort the balls in the order of increasing of their numbers by the following scheme. He will put each new ball in the basket with the least number of balls. And if he's got several variants, he chooses the basket which stands closer to the middle. That means that he chooses the basket for which is minimum, where i is the number of the basket. If in this case Valeric still has multiple variants, he chooses the basket with the minimum number.

For every ball print the number of the basket where it will go according to Valeric's scheme.

Note that the balls are sorted into baskets in the order of increasing numbers, that is, the first ball goes first, then goes the second ball and so on.

Input

The first line contains two space-separated integers n, m (1 ≤ n, m ≤ 10⁵) — the number of balls and baskets, correspondingly.

Output

Print n numbers, one per line. The i-th line must contain the number of the basket for the i-th ball.

Sample test(s)

Input

4 3

Output

2
1
3
2

Input

3 1

Output

1
1
1

题意：有n个球和m个篮子，将球依次放进篮子里，优先放到球最少的篮子里，如果有多个这样的，则放到这样的篮子中，放到值最小的那个篮子中。问每个球分别放到了哪个篮子中。

思路：特别注意的一个细节，是一个实数，如果存到一个int里面，会造成错误的结果。这道题用线段树维护整个区间的最小值和最小值所在的位置。进行pushup的时候，如果左子树的最小值和右子树的最小值相等，就要将这个节点的最小值的位置就要进行比较维护。对于每一个球，输出当前最小值的位置，往最小值位置进行加1操作.

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
struct node
{
	int l, r, min, minp;
}tree[400005];
double MID;
void pushup(int id)
{
	tree[id].min = min(tree[id << 1].min, tree[id << 1 | 1].min);
	if (tree[id << 1].min == tree[id].min) tree[id].minp = tree[id << 1].minp;
	else tree[id].minp = tree[id << 1 | 1].minp;
	if (tree[id << 1 | 1].min == tree[id].min&&abs(tree[id].minp - MID)>abs(tree[id << 1 | 1].minp - MID)) tree[id].minp = tree[id << 1 | 1].minp;
}
void build(int id, int l, int r)
{
	tree[id].l = l;
	tree[id].r = r;
	tree[id].min = 0;
	if (l == r) tree[id].minp = l;
	else
	{
		int mid = (l + r) >> 1;
		build(id << 1, l, mid);
		build(id << 1 | 1, mid + 1, r);
		pushup(id);
	}
}
void update(int id)
{
	if (tree[id].l == tree[id].r)
	{
		printf("%d\n", tree[id].l);
		tree[id].min++;
	}
	else
	{
		int mid = (tree[id].l + tree[id].r) >> 1;
		if (tree[id].minp <= mid) update(id << 1);
		else update(id << 1 | 1);
		pushup(id);
	}
}
int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	MID = (m + 1) / 2.0;
	build(1, 1, m);
	for (int i = 1; i <= n; i++) update(1);
	return 0;
}