zoj1722.cpp

最近在acm.zju.edu.cn上通过的题目的代码

#include <stdio.h>
#include <map>
#include <string>
#include <vector>

using namespace std;

map<string,int> dict;

struct elem
{
	int bs,dm,bt;
	vector<int> ub,lb;
	elem(){}
};

int n,m;

vector<elem> sts;
char buff[1000];

void input()
{
	scanf("%d %d",&n,&m);
	int i,j,x,y;
	dict.clear();
	for (i=0;i<n;++i)
	{
		scanf("%s",buff);
		dict[buff]=i;
		elem tmp;
		tmp.lb.clear();
		tmp.ub.clear();
		scanf("%d %d %d",&tmp.bs,&tmp.bt,&tmp.dm);
		for (j=0;j<tmp.dm;++j)
		{
			scanf("%d %d",&x,&y);
			tmp.lb.push_back(x);
			tmp.ub.push_back(y);
		}
		sts.push_back(tmp);
	}
}

vector<int> ps;

void output()
{
	scanf("%s",buff);
	int i,id=dict[buff],x;
	ps.clear();
	for (i=0;i<sts[id].dm;++i)
	{
		scanf("%d",&x);
		ps.push_back(x);
	}
	printf("%s[",buff);
	for (i=0;i<sts[id].dm;++i)
	{
		if (i) printf(", ");
		printf("%d",ps[i]);
	}
	printf("] = ");
	int ans=0,ts=1;
	for (i=sts[id].dm;i;)
	{
		--i;
		ans+=(ps[i]-sts[id].lb[i])*ts;
		ts*=(sts[id].ub[i]-sts[id].lb[i]+1);
	}
	printf("%d\n",sts[id].bs+ans*sts[id].bt);
}

int main()
{
	int i;
	input();
	for (i=0;i<m;++i)
		output();
	return 0;
}