B - After Training CodeForces - 195B 模拟，规律，思维题

B. After Training

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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 ≤ 105) — 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
inputCopy
4 3
outputCopy
2
1
3
2
inputCopy
3 1
outputCopy
1
1
1

题意：
有n个球，m个篮子， 要把这n个球放进这些篮子，首先放篮子中球最少的篮子，若数量相同再放距离中间篮子最近的，若距离相同放篮子编号小的，想一下，如果篮子全都放了一遍，每个篮子里面都是一个球，那岂不就和开始一样了，我们何不求出循环和探索出规律呢？

题解1（规律）：

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i = 0; i<n; i++) 
	printf("%d\n",(m+i%m)%2 ? ((m+i%m+1)/2) : (m-(i%m))/2);
	return 0 ;
}

题解2（规律详解版）：

#include<iostream>

using namespace std;

const int maxn = 1e6 + 7;

int a[maxn];

int main()
{
	int n, m;
	cin >> n >> m;
	if(m%2!=0){
		a[0] = m/2+1;
		for(int i=1; i < n; i++){
			if(i%2 != 0)
			a[i]=a[i-1]-i;
			else
			a[i]=a[i-1]+i;
		}
	}
	else{
		a[0] = m/2;
		for(int i=1; i < n; i++){
			if(i%2 == 0)
			a[i]=a[i-1]-i;
			else
			a[i]=a[i-1]+i;
		}
	}
	for(int i=0; i < n; i++){
		cout << a[i%m] << endl;
	}
}

题解3（数组存循环节，模拟）：

#include<iostream>

using namespace std;

const int maxn = 1e6 + 10;

int a[maxn];

int main()
{
	int n, m;
	cin >> n >> m;
	if(m%2!=0)
	{
		int p=m/2+1;
		a[0]=p;
		int cnt=1;
		for(int i=1;i<m;i++)
		{
			if(i%2!=0)
			{
				a[i]=p-cnt;
			}
			else
			{
				a[i]=p+cnt;
				cnt++;
			}
		}
	}
	else
	{
		int p=m/2;
		a[0]=p;
		int cnt=1;
		for(int i=1;i<m-1;i++)
		{
			if(i%2!=0)
			{
				a[i]=p+cnt;
			}
			else
			{
				a[i]=p-cnt;
				cnt++;
			}
		}
		a[m-1]=m;
	}

	if(n>=m)
	{
		int count=0;
		int cas=0;
		while(1)
		{
			cout << a[cas] <<endl;
			cas++;
			count++;
			if(cas ==m)
			{
				cas = 0;
			}
			if(count==n)
			{
				break;
			}
		}
	}
	else
	{
		for(int i=0;i<n;i++)
		{
			cout << a[i] <<endl;
		}
	}
}

题解4（其实就是按照规定的顺序建立set或者优先队列，然后每次取出队首，做出处理再放入容器。）：

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <string.h>
#include <map>
#include <set>
using namespace std;
#define maxn 100005*3
#define inff 1<<30
struct node
{
    int val,dis,id;
    node(int val,int dis,int id):val(val),dis(dis),id(id){}
   friend bool operator <(node x,node y)
    {
        if(x.val<y.val)return true;
        else if(x.val == y.val)
        {
            if(x.dis<y.dis)return true;
            else if(x.dis==y.dis)
            {
                if(x.id<y.id)return true;
                else return false;
            }
            else return false;
        }
        else return false;
    }
};
int abs(int x)
{
    if(x<0)return -x;
    else return x;
}
int n,m;
int a[maxn];
int main()
{
   set<node>s;
   int i;
   while(scanf("%d%d",&n,&m)!=EOF)
   {
       s.clear();
       int mid1,mid2;
       if(m%2!=0)
       {
           mid1=mid2=(m+1)/2;
       }
       else
       {
           mid1=m/2;
           mid2=mid1+1;
       }
       for(i=1;i<=m;i++)
       {
          node tx(0,min(abs(mid1-i),abs(mid2-i)),i);
          s.insert(tx);
       }
 
       for(i=1;i<=n;i++)
       {
           node tx=*s.begin();
           s.erase(s.begin());
           a[i]=tx.id;
           tx.val++;
           s.insert(tx);
       }
       for(i=1;i<=n;i++)
       {
           printf("%d\n",a[i]);
       }
   }
  return 0;
}```