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

• 問題: No.447 ゆきこーだーの雨と雪 (2)
• ユーザー: satanic
• 提出日時: 2016-11-19 00:28:10
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 14 ms / 2,000 ms
• コード長: 5,115 bytes
• コンパイル時間: 1,922 ms
• コンパイル使用メモリ: 155,524 KB
• 実行使用メモリ: 4,716 KB
• 最終ジャッジ日時: 2023-08-17 13:19:03
• 合計ジャッジ時間: 3,291 ms
• ジャッジサーバーID （参考情報）: judge13 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	2 ms; 4,376 KB
testcase_03	AC	4 ms; 4,380 KB
testcase_04	AC	3 ms; 4,376 KB
testcase_05	AC	9 ms; 4,380 KB
testcase_06	AC	11 ms; 4,496 KB
testcase_07	AC	6 ms; 4,376 KB
testcase_08	AC	7 ms; 4,376 KB
testcase_09	AC	11 ms; 4,520 KB
testcase_10	AC	3 ms; 4,380 KB
testcase_11	AC	5 ms; 4,376 KB
testcase_12	AC	5 ms; 4,380 KB
testcase_13	AC	10 ms; 4,468 KB
testcase_14	AC	12 ms; 4,716 KB
testcase_15	AC	5 ms; 4,376 KB
testcase_16	AC	3 ms; 4,376 KB
testcase_17	AC	3 ms; 4,376 KB
testcase_18	AC	2 ms; 4,376 KB
testcase_19	AC	14 ms; 4,616 KB
testcase_20	AC	13 ms; 4,608 KB
testcase_21	AC	4 ms; 4,376 KB
testcase_22	AC	4 ms; 4,380 KB
testcase_23	AC	5 ms; 4,380 KB
testcase_24	AC	10 ms; 4,380 KB
testcase_25	AC	13 ms; 4,452 KB
testcase_26	AC	6 ms; 4,376 KB
testcase_27	AC	6 ms; 4,376 KB

ソースコード

#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <array>
#include <chrono>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}
#define CHECKTIME(state) {auto start=std::chrono::system_clock::now();state();auto end=std::chrono::system_clock::now();auto res=std::chrono::duration_cast<std::chrono::nanoseconds>(end-start).count();std::cerr<<"[Time:"<<res<<"ns  ("<<res/(1.0e9)<<"s)]\n";}
// CHECKTIME(([&]{ /*  */ }));
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
#define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a))
#define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a))
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}

//#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^19
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238;

struct Data {
	std::string name;
	std::vector<int> score;
	int sum;
	int last;
	bool operator<(const Data& r) const {
		if (sum == r.sum) return last < r.last;
		else return sum > r.sum;
	}
};

signed main() {
	INIT;
	VAR(int, n);
	VEC(int, l, n);
	VAR(int, t);
	std::vector<std::string> name(t);
	std::vector<char> p(t);
	std::set<std::string> nameList;
	std::map<std::string, int> nameN;
	std::map<std::string, int> last;
	REP(i, t) {
		std::cin >> name[i] >> p[i];
		last[name[i]] = i;
		nameList.insert(name[i]);
	}
	std::vector<Data> data(nameList.size());
	int nameCnt = 0;
	for (const auto& s : nameList) {
		data[nameCnt].name = s;
		data[nameCnt].last = last[s];
		nameN[s] = nameCnt++;
	}
	REP(i, nameCnt) {
		data[i].score.resize(n, 0);
	}
	std::vector<int> ac(n, 1);
	REP(i, t) {
		int probN = p[i] - 'A';
		int rank = ac[probN]++;
		data[nameN[name[i]]].score[probN] = std::floor(50 * l[probN] + 50 * l[probN] / (0.8 + 0.2 * rank));
	}
	REP(i, nameCnt) {
		data[i].sum = 0;
		REP(j, n) {
			data[i].sum += data[i].score[j];
		}
	}
	std::sort(ALL(data));
	REP(i, nameCnt) {
		OUT(i + 1)SP OUT(data[i].name)SP;
		REP(j, n) {
			OUT(data[i].score[j])SP;
		}
		OUT(data[i].sum)BR;
	}

	return 0;
}