ACM 1004. 西西弗斯式的命运

题目：https://acm.sjtu.edu.cn/OnlineJudge/problem/1004

#include "iostream"
using namespace std;

class T{
public:
    void cincout(){
        cin>>M>>T>>U>>F>>D;
        for (int i =0; i<T; i++) {
            cin>>c[i];
           }
        }
    int M,T,U,F,D;
    int costtime(char c){
        if(c=='u'){
            return U;
        }
        if(c=='f'){
            return F;
        }
        if(c=='d'){
            return D;
        }
        return 0;
      }
    int fcosttime(char c){
        if(c=='u'){
            return D;
        }
        if(c=='f'){
            return F;
        }
        if(c=='d'){
            return U;
        }
        return 0;
    }

    char c[100];
};

int main(){
    T *t =new T;
    t->cincout();
    int timego = 0,timeback =0;
    int i=0;
    for (; (timego+timeback)<t->M; ) {
        timego+=t->costtime(t->c[i]);
        timeback+=t->fcosttime(t->c[i]);
        i++;

    }
    i--;
    cout<<i;

}