#211319 (C++11) No.447 ゆきこーだーの雨と雪 (2)

• 問題: No.447 ゆきこーだーの雨と雪 (2)
• ユーザー: komori3
• 提出日時: 2017-10-24 05:39:36
• 言語: C++11 (gcc 11.4.0)
• 結果: WA
• 実行時間: -
• コード長: 2,937 bytes
• コンパイル時間: 1,285 ms
• コンパイル使用メモリ: 115,464 KB
• 実行使用メモリ: 7,808 KB
• 最終ジャッジ日時: 2024-11-21 17:01:36
• 合計ジャッジ時間: 3,191 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
#include <bitset>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()




typedef pair<int, int> pii;

int yuki0447()
{
	int N;
	cin >> N;
	
	map<char, int> level;
	map<char, int> rank;
	for (char ch = 'A'; ch < 'A' + N; ch++) cin >> level[ch];

	cout << level << endl;

	int T;
	cin >> T;

	// name, (score, time)
	map<string, pii> table;
	map<string, map<char, int> > score;
	for (int t = 1; t <= T; t++) {
		string name;
		char P;
		cin >> name >> P;
		rank[P]++;
		score[name][P] = 50 * level[P] * (9 + rank[P]) / (4 + rank[P]);
		table[name].first += score[name][P];
		table[name].second = -t;
	}

	cout << table << endl;
	cout << score << endl;

	priority_queue<pair<pii, string> > pq;
	for (auto itr = table.begin(); itr != table.end(); itr++)
		pq.push(pair<pii, string>(itr->second, itr->first));

	int place = 1;
	while (!pq.empty()) {
		pair<pii, string> p = pq.top(); pq.pop();
		cout << place << " " << p.second;
		for (char ch = 'A'; ch < 'A' + N; ch++) {
			cout << " " << score[p.second][ch];
		}
		cout << " " << p.first.first << endl;
		place++;
	}

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0447();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}