UVA 210

最新推荐文章于 2020-12-11 22:30:28 发布

Tczxw

最新推荐文章于 2020-12-11 22:30:28 发布

阅读量463

点赞数

本文链接：https://blog.csdn.net/Tczxw/article/details/47263429

版权

#include<bits/stdc++.h>
using namespace std;
deque<int>ready,block;
int var[26],id[1024],st[5],program,q,kase;
string code[1024];
bool locked;
void run(int i)
{
    int time=q;
    while(time>0)
    {
        string now = code[id[i]];
        if(now[2]=='=')
        {
            var[now[0] - 'a'] = isdigit(now[5]) ? (now[4]-'0')*10+(now[5]-'0') : now[4]-'0';
            time -= st[0];
        }
        else if(now[2]=='i')
        {
            cout<<i+1<<": "<<var[now[6]-'a']<<endl;
            time -= st[1];
        }
        else if(now[2] == 'c')
        {
            if(locked)
            {
                block.push_back(i);
                return;
            }
            locked = true;
            time -= st[2];
        }
        else if(now[2] == 'l')
        {
            if(!block.empty()) ready.push_front(block.front()),block.pop_front();
            time -= st[3];
            locked = false;
        }
        else if(now[2] == 'd')
        {
            return ;
        }
        id[i]++;
    }
    ready.push_back(i);
}
int main()
{
    cin>>kase;
    while(kase--)
    {
        cin>>program>>st[0]>>st[1]>>st[2]>>st[3]>>st[4]>>q;
        memset(var,0,sizeof(var));
        ready.clear();
        block.clear();
        int line_num=0;
        for(int i=0; i<program; i++)
        {
            ready.push_back(i);
            getline(cin,code[line_num++]);
            id[i]=line_num-1;
            while(code[line_num-1]!="end")
                getline(cin,code[line_num++]);
        }
        locked = false;
        while(!ready.empty())
        {
            int now= ready.front();
            ready.pop_front();
            run(now);
        }
        if(kase) cout<<endl;
    }
    return 0;
}