csp真题答案整理

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<vector>
 5 using namespace std;
 6 typedef struct node
 7 {
 8     int keynum;
 9     int begintime;
10     int endtime;
11 }teacher;
12 vector<teacher>v1,v2;
13 bool  compareBegin(teacher t1,teacher t2)
14 {
15     return t1.begintime<t2.begintime;
16 }
17 bool compareEnd(teacher t1,teacher t2)
18 {
19     return t1.endtime==t2.endtime?t1.keynum<t2.keynum:t1.endtime<t2.endtime;
20     
21 }
22 int  getkey(int keyid,int*key,int keycount)
23 {
24     for(int i=1;i<=keycount;i++)
25     {
26         if(keyid==key[i])
27         {
28             return i;
29         }
30     }    
31 }
32 void deal(int *key,int keycount,int teachernum)
33 {
34        int i=0;
35        int j=0;
36        sort(v1.begin(),v1.end(),compareBegin);//对开始时间排序
37        sort(v2.begin(),v2.end(),compareEnd);//对结束时间排序
38        //在某一个时刻必定只能做一件事，或者借或者还，用时间点来操作
39        //时间小的事一定优先做
40        while(i<teachernum&&j<teachernum)
41        {
42           if(v1[i].begintime<v2[j].endtime)//借
43           {
44               int index=getkey(v1[i++].keynum,key,keycount);
45               key[index]=0;
46               
47           }
48           else if(v1[i].begintime>=v2[j].endtime)//还
49                                                 //保证了还的钥匙一定被借过
50           {
51                int index=getkey(0,key,keycount);
52                key[index]=v2[j++].keynum;
53                
54           }
55         }
56        while(j<teachernum)//出来上次循环后还可能没还完
57        {
58             int index=getkey(0,key,keycount);
59                key[index]=v2[j++].keynum;
60               
61        }
62         
63        for(i=1;i<=keycount;i++)
64         {
65             printf("%d ",key[i]);
66         }
67 }
68 int main()
69 {
70     int keycount,teacherNum;
71     int keynum,begintime,endtime;
72     int  key[1000];
73     teacher t;
74     int i;
75     while(~scanf("%d%d",&keycount,&teacherNum))
76     {
77         for(i=1;i<=keycount;i++)//初始时为12345
78         {  
79             key[i]=i;
80         }
81         for(i=0;i<teacherNum;i++)
82         {
83             scanf("%d%d%d",&t.keynum,&t.begintime,&t.endtime);//输入的实际是上课时长
84             t.endtime=t.endtime+t.begintime;//得到真正结束时间
85             v1.push_back(t);
86             v2.push_back(t);
87         }
88         deal(key,keycount,teacherNum);
89 
90         
91     
92     }
93     return 0;
94 }

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int k, n, w , s, c, key[1001];

//定义依附于教师的结构体
struct Teacher{
    int keyNum; //所使用的钥匙编号 
    int time; //使用钥匙时开始或结束的时间点 
    int flag; // 在此时间点是还钥匙1还是借钥匙0 
}; 

int cmp(const Teacher &a, const Teacher &b){
    if(a.time != b.time){
        return a.time < b.time; //a的时间点小于b时，返回正值 
    }else if(a.flag != b.flag){// 先还后取 
        return a.flag > b.flag;
    }else{
        return a.keyNum < b.keyNum;
    }
} 
int main(int argc, char** argv) {
    std::ios::sync_with_stdio(false);
    cin >> n >> k;
    //定义Teacher向量，每一个老师都对应两个v,取钥匙的时候和还钥匙的时候为不同的向量 
    vector<Teacher> v;
    //初始化钥匙的位置 
    for(int i =1; i<=n; i++){
        key[i]=i;
    } 
    //向向量里面添加教师信息
    for(int i=0; i<k; i++){
        cin >> w >> s >> c;
        Teacher t;
        t.keyNum = w;
        t.time = s;
        t.flag = 0; //借钥匙
        v.push_back(t);
        t.keyNum = w;
        t.time = s+c;
        t.flag = 1; //还钥匙
        v.push_back(t); 
    } 
    //给向量按照重写的cmp函数进行排序
    sort(v.begin(), v.end(), cmp);
    for(int i=0; i<v.size(); i++){
        if(v[i].flag == 0){//借钥匙 
            for(int j=1; j<=n; j++){
                if(key[j] == v[i].keyNum){
                    key[j]=0;
                    break;
                }
            }
        }else{//归还钥匙 
            for(int k=1; k<=n; k++){
                if(key[k] == 0){
                    key[k]=v[i].keyNum;
                    break;
                }
            }
        }
    } 

    for(int i = 1; i<=n; i++){
        cout <<key[i] <<" ";
    } 
    cout << endl;
    return 0;
}