After Training CodeForces - 195B

最新推荐文章于 2021-12-03 23:58:45 发布

原创最新推荐文章于 2021-12-03 23:58:45 发布 · 437 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

思维技巧专栏收录该内容

181 篇文章

订阅专栏

本文介绍了一个关于足球训练结束后如何将不同编号的球合理分配到若干个筐中的问题。采用了一种特殊的分配策略，使得球按编号递增顺序放入筐中，同时确保每个筐内的球数量尽量均匀，并且优先选择靠近中间位置的筐。

After Training

CodeForces - 195B

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 $\text{[math]}$ 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.

Examples

Input

4 3

Output

Input

3 1

Output

1
1
1

注意：这个题|m+1/2-i|算距离应该使用double！！！！！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
const int maxn = 1e5+10;
struct node{
    int id;
    double dis;
    int num;
    bool operator < (const node& other)const{
        if(num == other.num && dis == other.dis)
            return id > other.id;
        else if(num == other.num)
            return dis > other.dis;
        return num > other.num;
    }
};
int n,m;
priority_queue<node> q;
void init(){
    double midd = ((double)m + 1.0) / 2.0;
    for(int i = 1; i <= m; i++){
        node a;
        a.id = i;
        a.dis = fabs(midd-(double)i);
        a.num = 0;
        q.push(a);
    }
}
int main(){
    scanf("%d%d",&n,&m);
    init();
    for(int i = 1; i <= n; i++){
        node tmp = q.top();
        q.pop();
        printf("%d\n",tmp.id);
        tmp.num++;
        q.push(tmp);
    }
    return 0;
}