CodeForces 660B Seating On Bus

最新推荐文章于 2016-04-30 20:49:08 发布

围巾的ACM

最新推荐文章于 2016-04-30 20:49:08 发布

阅读量330

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/51182029

水题专栏收录该内容

159 篇文章

订阅专栏

本文详细阐述了根据人数和座位布局确定公交车乘客下车顺序的算法。通过输入人数和座位总数，输出乘客按照特定规则下车的顺序。适用于理解人群流动管理和优化乘车体验。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意:有一个公交车,如果人数小于2n的话，那么这些人就只会坐在边上，是先坐左边，然后坐右边这样的,如果大于等于2n的话，就会去坐中间，也是先坐左边，再坐右边,走的时候，就先走第二列，然后走第一列，然后走第三列，然后走第四列这样的，依次走一个这样。问你这些人走的样子是什么样子

思路：先走的奇数，然后再走偶数位置，先走大于2n的，再走小于的。

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=2*n;i++)
    {
        if(2*n+i<=m)cout<<2*n+i<<" ";
        if(i<=m)cout<<i<<" ";
    }
    cout<<endl;
}

Description

Consider 2n rows of the seats in a bus. n rows of the seats on the left and n rows of the seats on the right. Each row can be filled by two people. So the total capacity of the bus is 4n.

Consider that m (m ≤ 4n) people occupy the seats in the bus. The passengers entering the bus are numbered from 1 to m (in the order of their entering the bus). The pattern of the seat occupation is as below:

1-st row left window seat, 1-st row right window seat, 2-nd row left window seat, 2-nd row right window seat, ... , n-th row left window seat, n-th row right window seat.

After occupying all the window seats (for m > 2n) the non-window seats are occupied:

1-st row left non-window seat, 1-st row right non-window seat, ... , n-th row left non-window seat, n-th row right non-window seat.

All the passengers go to a single final destination. In the final destination, the passengers get off in the given order.

1-st row left non-window seat, 1-st row left window seat, 1-st row right non-window seat, 1-st row right window seat, ... , n-th row left non-window seat, n-th row left window seat, n-th row right non-window seat, n-th row right window seat.

$\text{[math]}$ The seating for n = 9 and m = 36.

You are given the values n and m. Output m numbers from 1 to m, the order in which the passengers will get off the bus.

Input

The only line contains two integers, n and m (1 ≤ n ≤ 100, 1 ≤ m ≤ 4n) — the number of pairs of rows and the number of passengers.

Output

Print m distinct integers from 1 to m — the order in which the passengers will get off the bus.

Sample Input

Input

2 7

Output

5 1 6 2 7 3 4

Input

9 36

Output

19 1 20 2 21 3 22 4 23 5 24 6 25 7 26 8 27 9 28 10 29 11 30 12 31 13 32 14 33 15 34 16 35 17 36 18