网址如下:
Petri Net Simulation - UVA 804 - Virtual Judge (vjudge.net)
(第三方网站)
一道模拟题,模拟Petri网,本来以为很简单的,结果第一次直接超时
超时代码:
#include<cstdio>
#include<set>
#include<map>
using namespace std;
struct T{
bool is_enabled;
map<int, int> input, output;
T():is_enabled(false){}
};//转换
const int maxNP = 101;
int NP, NT, NF;//节点数 转换数 触发数
int P[maxNP];//结点含的token数
set<int> pT[maxNP];//结点i关联的转换
T tt[maxNP];//转换
bool fired(void)
{
for(int i = 1; i <= NT; i++){
if(tt[i].is_enabled){
for(auto it = tt[i].input.begin(); it != tt[i].input.end(); it++){
int id = it->first;
P[id] -= it->second;
//更新转换的状态
for(auto it2 = pT[id].begin(); it2 != pT[id].end(); it2++){
if(P[id] < tt[*it2].input[id]) tt[*it2].is_enabled = false;
}
}
for(auto it = tt[i].output.begin(); it != tt[i].output.end(); it++){
int id = it->first;
P[id] += it->second;
//更新转换的状态
for(auto it2 = pT[id].begin(); it2 != pT[id].end(); it2++){
if(P[id] >= tt[*it2].input[id]) tt[*it2].is_enabled = true;
}
}
return true;
}
}
return false;
}
int main(void)
{
int kase = 0;
while(scanf("%d", &NP) == 1 && NP){
for(int i = 1; i <= NP; i++){scanf("%d", &P[i]); pT[i].clear();}
scanf("%d", &NT);
for(int i = 1; i <= NT; i++){
int tmp; bool is_judge = true;
tt[i].is_enabled = false; tt[i].input.clear(); tt[i].output.clear();
while(scanf("%d", &tmp) == 1 && tmp){
if(tmp > 0){
if(tt[i].output.count(tmp)) tt[i].output[tmp]++;
else tt[i].output[tmp] = 1;
}
else{
tmp *= -1;
if(tt[i].input.count(tmp)) tt[i].input[tmp]++;
else tt[i].input[tmp] = 1;
if(P[tmp] < tt[i].input[tmp]) is_judge = false;
pT[tmp].insert(i);
}
}
tt[i].is_enabled = is_judge;
}
scanf("%d", &NF);
bool is_success = true; int cnt = 0;
while(cnt++ < NF)
if(!fired()){is_success = false; break;}
//输出
if(is_success) printf("Case %d: still live after %d transitions\n", ++kase, NF);
else printf("Case %d: dead after %d transitions\n", ++kase, --cnt);
printf("Places with tokens:");
for(int i = 1; i <= NP; i++)
if(P[i]) printf(" %d (%d)", i, P[i]);
putchar('\n'); putchar('\n');
}
return 0;
}
然后我就优化了一下,使触发不是一次,而是一波
代码如下:
#include<vector>
#include<cstdio>
#include<map>
using namespace std;
struct T{
map<int, int> input, output;
};//转换
const int maxNP = 101;
int NP, NT, NF, cnt;//节点数 转换数 触发数 目前的触发数
int P[maxNP];//结点含的token数
T tt[maxNP];//转换
bool fired(void)
{
bool is_judge = false;
for(int i = 1; i <= NT; i++){
bool tmp = true; int minn = 2147483647;
//判断
for(auto it = tt[i].input.begin(); it != tt[i].input.end(); it++){
if(P[it->first] < it->second){tmp = false; break;}
int val = P[it->first] / it->second;
minn = (minn < val) ? minn : val;
}
minn = (cnt + minn > NF) ? NF - cnt : minn;
//处理
if(tmp){
is_judge = true; cnt += minn;
for(auto it = tt[i].input.begin(); it != tt[i].input.end(); it++) P[it->first] -= it->second * minn;
for(auto it = tt[i].output.begin(); it != tt[i].output.end(); it++) P[it->first] += it->second * minn;
}
}
return is_judge;
}
int main(void)
{
//freopen("D:\\vscode_c\\work\\output.txt", "w", stdout);
int kase = 0;
while(scanf("%d", &NP) == 1 && NP){
//token的输入
for(int i = 1; i <= NP; i++) scanf("%d", &P[i]);
//转换的输入
scanf("%d", &NT);
for(int i = 1; i <= NT; i++){
int tmp; tt[i].input.clear(); tt[i].output.clear();
while(scanf("%d", &tmp) == 1 && tmp){
if(tmp > 0){
if(tt[i].output.count(tmp)) tt[i].output[tmp]++;
else tt[i].output[tmp] = 1;
}
else{
tmp *= -1;
if(tt[i].input.count(tmp)) tt[i].input[tmp]++;
else tt[i].input[tmp] = 1;
}
}
}
//触发数的输入和处理
scanf("%d", &NF);
bool is_success = true; cnt = 0;
while(cnt < NF)
if(!fired()){is_success = false; break;}
//输出
if(is_success) printf("Case %d: still live after %d transitions\n", ++kase, NF);
else printf("Case %d: dead after %d transitions\n", ++kase, cnt);
printf("Places with tokens:");
for(int i = 1; i <= NP; i++)
if(P[i]) printf(" %d (%d)", i, P[i]);
putchar('\n'); putchar('\n');
}
return 0;
}