2015.4.3微软在线笔试第二题

题目链接

笔试期间在这道题上陷的太深，直到最后也没来得及提交，结束后重新理了理思路，很快就改好了，但是无法提交验证，因此发这篇博客留作纪念吧！

下附代码：

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <deque>
#include <algorithm>
using namespace std;



class Signal {
public:
	Signal(int _sig, int _id) : sig(_sig), id(_id), n(0) { }
	int sig;
	int id;
	int n;
	deque<int> gen;
	static vector<vector<int> > graph;

	static void reset(int n) {
		graph.clear();
		for (int i = 0; i < n; ++i) {
			graph.push_back(vector<int>());
			for (int j = 0; j < n; ++j) {
				graph[i].push_back(0);
			}
		}
	}
};

vector<vector<int> > Signal::graph;

class Module {
public:
	int sig;
	int n;
};

bool operator < (const Signal& left, const Signal& right) {
	return Signal::graph[left.id][right.id] > 0;
}

#define MAGIC 142857

int main()
{
	int T, M, N;

	cin >> T; 
	for (int t = 0; t < T; ++t) {
		map<int, int> mapSig;
		cin >> N >> M;
		vector<Signal> sigs;
		Module * mod = new Module[N];
		int * initSig = new int[M];
		for (int m = 0; m < M; ++m) cin >> initSig[m];
		int numSig = 0;
		for (int n = 0; n < N; ++n) {
			int S;
			cin >> S;
			mod[n].sig = S;
			mod[n].n = 0;
			if (mapSig.find(S) != mapSig.end()) {
				int K;
				cin >> K;
				int id = mapSig[S];
				for (int k = 0; k < K; ++k) {
					int ss;
					cin >> ss;
					sigs[id].gen.push_back(ss);
					if (mapSig.find(ss) == mapSig.end()) {
						Signal _sig(ss, numSig);
						sigs.push_back(_sig);
						mapSig[ss] = numSig;
						numSig++;
					}
				}
			} else {
				Signal _sig(S, numSig);
				int K;
				cin >> K;
				sigs.push_back(_sig);
				mapSig[S] = numSig;
				int numOld = numSig;
				numSig++;
				for (int k = 0; k < K; ++k) {
					int ss;
					cin >> ss;
					sigs[numOld].gen.push_back(ss);
					if (mapSig.find(ss) == mapSig.end()) {
						Signal _sig(ss, numSig);
						sigs.push_back(_sig);
						mapSig[ss] = numSig;
						numSig++;
					}
				}
			}
		}
		Signal::reset(sigs.size());
		for (int i = 0; i < sigs.size(); ++i) {
			for (deque<int>::iterator it = sigs[i].gen.begin(); it != sigs[i].gen.end(); ++it) {
				Signal::graph[sigs[i].id][sigs[mapSig[*it]].id]++;
				Signal::graph[sigs[mapSig[*it]].id][sigs[i].id] = -1;
			}
		}
		sort(sigs.begin(), sigs.end());
		mapSig.clear();
		for (int i = 0; i < sigs.size(); ++i) {
			mapSig[sigs[i].sig] = i;
		}

		for (int i = sigs.size()-1; i >= 0; --i) {
			for (deque<int>::iterator it = sigs[i].gen.begin(); it != sigs[i].gen.end(); ++it) {
				int kid = mapSig[*it];
				while (++kid < sigs.size()) {
					Signal::graph[sigs[i].id][sigs[kid].id] += Signal::graph[sigs[mapSig[*it]].id][sigs[kid].id];
					Signal::graph[sigs[i].id][sigs[kid].id] %= MAGIC;
				}
			}
		}
		
		for (int m = 0; m < M; ++m) {
			int sig = initSig[m];
			int id = mapSig[sig];
			for (int i = id; i < sigs.size(); ++i){
				sigs[i].n += Signal::graph[sigs[id].id][sigs[i].id];
			}
			sigs[id].n++;
		}

		for (int n = 0; n < N; ++n) {
			cout << sigs[mapSig[mod[n].sig]].n << " ";
		}
		cout << endl;
<span style="white-space:pre">		</span>delete [] mod;
<span style="white-space:pre">		</span>delete [] initSig;
	}

	return 0;
}