結果
問題 | No.447 ゆきこーだーの雨と雪 (2) |
ユーザー |
![]() |
提出日時 | 2016-11-19 02:08:40 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 16 ms / 2,000 ms |
コード長 | 3,196 bytes |
コンパイル時間 | 1,800 ms |
コンパイル使用メモリ | 188,560 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-26 10:47:03 |
合計ジャッジ時間 | 3,048 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef unsigned long long ull;typedef vector<int> veci;typedef vector<ll> vecll;typedef vector<string> vecs;template<class T,class U> using Hash=unordered_map<T,U>;#define REP(i, a, n) for(ll i = a; i < (ll)(n); i++)#define RREP(i, a, n) for(ll i = n-1; i >= (ll)(a); i--)#define rep(i, n) REP(i, 0, n)#define rrep(i, n) RREP(i, 0, n)#define MD 1000000007#define _SPLIT " "template<class T> T read(){T a;cin >> a;return a;}template<class T> void read(T& a){cin >> a;}template<class T,class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);}template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}template<class T> void write(T a){cout << setprecision(24) << a << endl;}template<class T,class ...Args> void write(T a, Args... args){cout << setprecision(24) << a << _SPLIT; write(args...);}template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}template<class T> void warr(T begin, T end, const char* c = " "){cout << *begin;for(auto i = begin+1; i != end; i++)cout << c << *i;cout << endl;}void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}struct Info{string name;vector<int> score;int sum;int update_time;};int main(void){int n,L[26],t;int vs[26]={0};read(n);rep(i,n)read(L[i]);read(t);vector<Info*> res;Hash<string,Info*> h;rep(i,t){string s;char p;read(s,p);int j=p-'A';vs[j]++;int ac=vs[j];if(h.count(s)==0){Info* x=new Info;x->name=s;x->score.resize(n);x->sum=0;res.push_back(x);h[s]=x;}Info& cur=*h[s];cur.score[j]=(int)(50*L[j]+(50*L[j])/(0.8+0.2*ac));cur.sum+=cur.score[j];cur.update_time=i;}sort(res.begin(),res.end(),[](Info* a,Info* b){return (a->sum > b->sum)||(a->sum==b->sum&&a->update_time < b->update_time);});rep(i,res.size()){cout<<i+1<<" "<<res[i]->name<<" ";rep(j,res[i]->score.size()){cout<<res[i]->score[j]<<" ";}cout<<res[i]->sum<<endl;}return 0;}