题目描述
题目要求模拟Petri网的变化。Petri网含有NP个places,有NT个transitions。每个transition的状态有enable和disable且每个transition都至少有一个输入的place和输出的place。当每个transition的状态发生变化时,每个输入place减少一个token,每个输出place增加一个token。现给出一个Petri网的初始状态,和转换次数。求这个网络是否能进行这么多次转换。
题解
一道模拟题,读懂题意就行
AC代码
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int np, nt;
int NP[101];
vector<int> NT[100];
bool check(int n, int *arr){
for(int i = 0, k = NT[n].size(); i<k; ++i){
if(NT[n][i] < 0) arr[-NT[n][i]]--;
else arr[NT[n][i]]++;
}
for(int i = 1; i<=np; i++)
if(NP[i]+arr[i]<0) return false;
return true;
}
bool trans(){
for(int i = 0 ; i<nt; i++){
int buf[101] = {0};
if(!check(i, buf)) continue;
for(int i = 1; i<=np; i++)
NP[i]+=buf[i];
return true;
}
return false;
}
bool solve(int &x, int firi){
for(x = 0; x<firi; x++){
if(!trans())return false;
}
return true;
}
int main(){
int kase = 0;
while(scanf("%d", &np)!=EOF&& np){
memset(NP, 0, sizeof(NP));
for(int i = 1; i<=np; i++)
scanf("%d", NP+i);
scanf("%d", &nt);
for(int i = 0; i<nt; ++i) NT[i].clear();
int buf;
for(int i = 0; i<nt; ++i)
while(scanf("%d", &buf) && buf)
NT[i].push_back(buf);
int firings, cnt = 0;
scanf("%d", &firings);
bool state = solve(cnt, firings);
if(state)
printf("Case %d: still live after %d transitions\n", ++kase, cnt);
else
printf("Case %d: dead after %d transitions\n", ++kase, cnt);
printf("Places with tokens:");
for(int i = 1; i<=np; ++i)
if(NP[i])printf(" %d (%d)", i, NP[i]);
printf("\n\n");
}
}