CCF-Crontab-201712-3

大概是CCf第三题中最麻烦的一个吧

      我的思路其实我觉得还可以,模拟...可是超时了233 只有90分 [ 可是我看网上其他人也是模拟算法啊,

      速度还是太慢了 120行, 1个半小时  大部分花在了debug上了

      总结: debug时 不要直接看中间结果,先自己仔细读一遍程序,很多bug不是逻辑错误,而是自己不细心....加油!!

#include <bits/stdc++.h>
using namespace std;
struct node {
    string name;
    bool isok[6][65];
};
node ord[50];
int mon[][13]={0,31,28,31,30,31,30,31,31,30,31,30,31,
               0,31,29,31,30,31,30,31,31,30,31,30,31};
string smon[13]={"","jan","feb","mar","apr","may","jun","jul","aug","sep","oct","nov","dec"};
string swek[7]={"sun","mon","tue","wed","thu","fri","sat"};
map <string,int> mapp;
int t[10]={0,0,1,1,4,1970}; // min 0,hou 1,day 2,mon 3,week 4,year 5
int ts[10],te[10];
int base[10]={60,24,0,12};
bool is_r (int year) {
    if (year%4==0&&year%100!=0||year%400==0) return 1;
    return  0;
}
void dd(int k) {
    bool flag=is_r(t[5]);
    base[2]=mon[flag][t[3]];
    for (int i=0;i<=1;i++) {
        int tmp=t[i]+k;
        k=tmp/base[i]; 
        t[i]=tmp%base[i];
    }
    for (int i=2;i<=3;i++) {
        if (i==2) t[4]=(t[4]+k)%7;
        int tmp=t[i]-1+k;
        k=tmp/base[i];
        t[i]=tmp%base[i]+1;
    }
    t[5]+=k;
}
int to_int (string str) {
    int ans=0;
    for (int i=0;i<str.size();i++)
        ans=ans*10+str[i]-'0';
    return ans;
}
void get_t(string str,int* x) {
    x[5]=to_int(str.substr(0,4));
    for (int i=3,pos=4;i>=0;i--,pos+=2) 
        x[i]=to_int(str.substr(pos,2));
}
bool is_same (int *x,int *y) {
    for (int i=0;i<=3;i++)
        if (x[i]!=y[i]) return 0;
    return x[5]==y[5];
}
vector <string> split(string str,const char flag=',') {
    vector <string> ans;
    istringstream  iss(str);
    while (getline(iss,str,flag)) {
        if (str.size()) {
            for (int i=0;i<str.size();i++)
                if (str[i]>='A'&&str[i]<='Z') 
                    str[i]=str[i]-'A'+'a';
            ans.push_back(str);
        }
    }
    return ans;
}
int get_num (string str) {
    if (str[0]>='0'&&str[0]<='9')  return to_int(str); 
    return mapp[str];
}
void get_isok(string str,bool* isok) {
    if (str=="*") {
        for (int i=0;i<=60;i++) isok[i]=1;
        return ;
    }
    vector <string> sv=split(str);
    for (int i=0;i<sv.size();i++) {
        string tmp=sv[i];
        int pos=tmp.find("-");
        if (pos==-1)  isok[get_num(tmp)]=1;
        else          {
            string s1=tmp.substr(0,pos),s2=tmp.substr(pos+1);
            int l1=get_num(s1),l2=get_num(s2);
            for (int j=l1;j<=l2;j++)
                isok[j]=1;
        }
    }
}
bool isok(node x) {
    for (int i=0;i<5;i++)
        if (!x.isok[i][t[i]]) return 0;
    return 1;
}
int main ()
{
    ios::sync_with_stdio(false);
    for (int i=1;i<=12;i++) mapp[smon[i]]=i;
    for (int i=0;i<7;i++)   mapp[swek[i]]=i;
    int n; string _s,_e; 
    cin>>n>>_s>>_e;
    get_t(_s,ts); get_t(_e,te);
    t[1]=ts[1]; t[0]=ts[0];
    while (!is_same(t,ts)) dd(24*60);
    for (int i=1;i<=n;i++) {
        for (int j=0;j<5;j++) {
            string str; cin>>str;
            get_isok(str,ord[i].isok[j]);
        }
        cin>>ord[i].name;
    }
    while (!is_same(t,te)) {
        for (int i=1;i<=n;i++)
            if (isok(ord[i])) {
                cout<<t[5];
                for (int j=3;j>=0;j--)
                    cout<<setw(2)<<setfill('0')<<t[j];
                cout<<" "<<ord[i].name<<"
";
            }
        dd(1);
    }
    return 0;
}