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[][];
 };
 node ord[];
 int mon[][]={,,,,,,,,,,,,,
                ,,,,,,,,,,,,};
 string smon[]={"","jan","feb","mar","apr","may","jun","jul","aug","sep","oct","nov","dec"};
 string swek[]={"sun","mon","tue","wed","thu","fri","sat"};
 map <string,int> mapp;
 int t[]={,,,,,}; // min 0,hou 1,day 2,mon 3,week 4,year 5
 int ts[],te[];
 int base[]={,,,};
 bool is_r (int year) {
     if (year%==&&year%!=||year%==) return ;
     return  ;
 }
 void dd(int k) {
     bool flag=is_r(t[]);
     base[]=mon[flag][t[]];
     for (int i=;i<=;i++) {
         int tmp=t[i]+k;
         k=tmp/base[i];
         t[i]=tmp%base[i];
     }
     for (int i=;i<=;i++) {
         if (i==) t[]=(t[]+k)%;
         int tmp=t[i]-+k;
         k=tmp/base[i];
         t[i]=tmp%base[i]+;
     }
     t[]+=k;
 }
 int to_int (string str) {
     int ans=;
     for (int i=;i<str.size();i++)
         ans=ans*+str[i]-'';
     return ans;
 }
 void get_t(string str,int* x) {
     x[]=to_int(str.substr(,));
     for (int i=,pos=;i>=;i--,pos+=)
         x[i]=to_int(str.substr(pos,));
 }
 bool is_same (int *x,int *y) {
     for (int i=;i<=;i++)
         if (x[i]!=y[i]) return ;
     return x[]==y[];
 }
 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=;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[]>=''&&str[]<='')  return to_int(str);
     return mapp[str];
 }
 void get_isok(string str,bool* isok) {
     if (str=="*") {
         for (int i=;i<=;i++) isok[i]=;
         return ;
     }
     vector <string> sv=split(str);
     for (int i=;i<sv.size();i++) {
         string tmp=sv[i];
         int pos=tmp.find("-");
         if (pos==-)  isok[get_num(tmp)]=;
         else          {
             string s1=tmp.substr(,pos),s2=tmp.substr(pos+);
             int l1=get_num(s1),l2=get_num(s2);
             for (int j=l1;j<=l2;j++)
                 isok[j]=;
         }
     }
 }
 bool isok(node x) {
     for (int i=;i<;i++)
         if (!x.isok[i][t[i]]) return ;
     return ;
 }
 int main ()
 {
     ios::sync_with_stdio(false);
     for (int i=;i<=;i++) mapp[smon[i]]=i;
     for (int i=;i<;i++)   mapp[swek[i]]=i;
     int n; string _s,_e;
     cin>>n>>_s>>_e;
     get_t(_s,ts); get_t(_e,te);
     t[]=ts[]; t[]=ts[];
     while (!is_same(t,ts)) dd(*);
     for (int i=;i<=n;i++) {
         for (int j=;j<;j++) {
             string str; cin>>str;
             get_isok(str,ord[i].isok[j]);
         }
         cin>>ord[i].name;
     }
     while (!is_same(t,te)) {
         for (int i=;i<=n;i++)
             if (isok(ord[i])) {
                 cout<<t[];
                 for (int j=;j>=;j--)
                     cout<<setw()<<setfill('')<<t[j];
                 cout<<" "<<ord[i].name<<"\n";
             }
         dd();
     }
     return ;
 }