PTA L1-049 天梯赛座位分配 (20分)

最新推荐文章于 2023-06-19 19:06:43 发布

csmikezheng

最新推荐文章于 2023-06-19 19:06:43 发布

阅读量342

点赞数

本文链接：https://blog.csdn.net/qq_45792080/article/details/109564038

版权

Problem

Portal

Thoughts

dalao blog

Accepted Code

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 110;

vector<int> v[N];
int a[N];
bool vis[N];

int main()
{
    int n;
    cin >> n;
    for(int i = 1 ; i <= n ; i ++ ) cin >> a[i], a[i] *= 10;
    
    int finished = 0, id = 1;
    while(finished != n)
    {
        for(int i = 1 ; i <= n ; i ++ )
        {
            if(vis[i]) continue;
            v[i].push_back(id);
            
            if(finished == n - 1) id += 2;
            else id ++ ;
            
            if(v[i].size() == a[i])
            {
                finished ++ ;
                vis[i] = 1; // 该校安排完座位了
            }
        }
    }
    
    for(int i = 1 ; i <= n ; i ++ )
    {
        cout << "#" << i << endl;
        for(int j = 0 ; j < v[i].size() ; j ++ )
        {
            if(j == 0) cout << v[i][j] << " ";
            else cout << v[i][j] << " \n"[j % 10 == 9];
        }
    }
    
    return 0;
}