The First Day at School

最新推荐文章于 2020-05-24 12:06:35 发布

your_own_name

最新推荐文章于 2020-05-24 12:06:35 发布

阅读量590

点赞数

本文链接：https://blog.youkuaiyun.com/your_own_name/article/details/56049395

版权

本文介绍了一个使用C++实现的课程安排算法，该算法能够根据不同天数为学生安排课程，并通过二维向量记录课程信息。文章包含完整的源代码，展示了如何处理输入数据并合理安排课程以最大化每节课的内容展示。

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

The First Day at School
写疯了：

//============================================================================
// Name        : test.cpp
// Author      : Qihan
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <bits/stdc++.h>
#define pi acos(-1.0)
using namespace std;
typedef long long int LLI;
typedef pair<LLI,LLI> PII;
#define Lowbit(x) (x & (-x))
const int inf = 0x3f3f3f;
const int maxn = (1000 + 10);

vector<int> Map[10][10];

char str[maxn][maxn];
int len[maxn];
string day;


int maxmap[10][10];

int x[10];
int y[10];
bool flag[maxn];


int main() {
//    freopen("/home/qihan/Documents/in","r",stdin);
//    freopen("/home/qihan/Documents/out1","w",stdout);
    int n;
    scanf("%d",&n);
    int cnt = 0;
    int last = 0;
    memset(flag,true,sizeof(flag));
    memset(maxmap,0,sizeof(maxmap));
    for(int i = 0; i < n; i ++) {
        char c;
        while(scanf("%s%c",str[cnt],&c)) {
            len[cnt] = strlen(str[cnt]);
            cnt ++;
            if(c == '\n')   break;
        }
        int num;
        cin >> day >> num;
        for(int k = last; k < cnt; k ++) {
            if(day == "Tuesday") {
                Map[num][1].push_back(k);
            } else if(day == "Thursday") {
                Map[num][2].push_back(k);
            } else {
                Map[num][3].push_back(k);
            }
        }
        last = cnt;
    }
    for(int i = 1; i <= 4; i ++) {
        y[i] = 1;
        for(int j = 1; j <= 3; j ++) {
            int  temp = Map[i][j].size();
            y[i] = max(y[i],temp);
        }
    }

    for(int i = 0; i < 34; i++) {
        if(i % 11 == 0) printf("+");
        else            printf("-");
    }
    printf("\n");

    for(int s = 1; s <= 4; s ++) {
        bool vis = false;
        while(!vis) {
            vis = true;
            printf("|");
            for(int k = 1; k <= 3; k ++) {
                if(maxmap[s][k] >= Map[s][k].size()){
                    for(int i = 0;i < 10;i ++)  printf(" ");
                }else{
                    int mins = 0;
                    int lx = maxmap[s][k];
                    for(;lx < Map[s][k].size();lx ++){
                        int ll = Map[s][k][lx];
                        if(mins + len[ll] <= 10){
                            printf("%s",str[ll]);
                            mins = mins + len[ll];
                            if(mins < 10)   {
                                printf(" ");
                                mins ++;
                            }
                            maxmap[s][k] ++;
                        }else{
                            vis = false;
                            break;
                        }
                    }
                    while(mins < 10)  {
                        printf(" ");
                        mins ++;
                    }
                }
                printf("|");
            }
            printf("\n");
        }
        for(int i = 0; i < 34; i++) {
            if(i % 11 == 0) printf("+");
            else            printf("-");
        }
        printf("\n");
    }
    return 0;
}