UVA - 210 Concurrency Simulator(双端队列)

#include<bits/stdc++.h>

using namespace std;
const int maxn = 1000 + 5;
queue<int> stop;
deque<int> wait;
vector<string>ve[maxn];
string str;
int l[maxn],cnt[27], tim[5];
int T;
int inv;
int n, q;

void init() {
memset(cnt, 0, sizeof(cnt));
memset(l, 0, sizeof(l));
}

void input() {
scanf("%d %d %d %d %d %d %d", &n, &tim[0], &tim[1], &tim[2], &tim[3], &tim[4], &q);
for(int i = 0; i < n; i++) {
ve[i].clear();
while(getline(cin, str)) {
if(str == "") continue;
ve[i].push_back(str);
if(str == "end")
break;
}
wait.push_back(i);
}
}

void solve(int i) {
int cur = q, v;
while(cur > 0) {
str = ve[i][l[i]];
//赋值
if(str[2] == '=') {
cur -= tim[0];
int t = str[4] - '0';
if(str.length() == 6) t = t * 10 + (str[5] - '0');
cnt[str[0] - 'a'] = t;
}
//打印
else if(str[2] == 'i') {
cur -= tim[1];
printf("%d: %d\n", i+1, cnt[str[6]-'a']);
}
//lock
else if(str[2] == 'c') {
cur -= tim[2];
if(inv) {
stop.push(i);
return;
}
else
inv = 1;
}
//unlock
else if(str[2] == 'l') {
inv = 0;
cur -= tim[3];
if(!stop.empty()) {
v = stop.front();
stop.pop();
wait.push_front(v);
}
}
else return;
l[i]++;
}
wait.push_back(i);
}

int main() {
scanf("%d", &T);
while(T--) {
init();
input();
while(!wait.empty()) {
int f = wait.front();
wait.pop_front();
solve(f);
}
if(T) cout << endl;
}
return 0;
}