Submission #53742

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int N,M,K;
	cin>>N>>M>>K;
	vector<char> t(M);
	vector<int> j(M);
	vector<int> k(M);
	for ( int i=0; i<M; i++ )
	{
		cin>>t[i];
		if ( t[i]=='t' )  cin>>j[i], j[i]--;
		if ( t[i]=='f' )  cin>>j[i]>>k[i], j[i]--, k[i]--;
		if ( t[i]=='u' )  cin>>j[i]>>k[i], j[i]--, k[i]--;
	}

	vector<int> T(N);	//	TLの発言数
	vector<int> C(N);	//	自分の発言数
	for ( int i=M-1; i>=0; i-- )
	{
		if ( t[i]=='t' )  C[j[i]]++;
		if ( t[i]=='f' )  T[j[i]]+=C[k[i]], T[k[i]]+=C[j[i]];
		if ( t[i]=='u' )  T[j[i]]-=C[k[i]], T[k[i]]-=C[j[i]];
	}
	for ( int i=0; i<N; i++ )
		T[i] += C[i];

	sort(T.begin(),T.end(),greater<int>());
	cout << T[K-1] << endl;

	return 0;
}

Submission Info

Judge Result