#131452 (C++11（廃止可能性あり）) No.447 ゆきこーだーの雨と雪 (2)

• 問題: No.447 ゆきこーだーの雨と雪 (2)
• ユーザー: srup٩(๑`н´๑)۶
• 提出日時: 2016-11-18 23:25:49
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 12 ms / 2,000 ms
• コード長: 2,085 bytes
• コンパイル時間: 1,577 ms
• コンパイル使用メモリ: 179,728 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-26 08:37:56
• 合計ジャッジ時間: 2,564 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 25

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
int n;
int L[30];
int t;
string name[4010];
char P[4010];
int cnt[30];
struct hito
{
    string na;
    int sum = 0;
    int kousin;
    int score[30] = {0};
};
bool asc( const hito& left, const hito& right ) {
    return left.sum == right.sum ? left.kousin < right.kousin : left.sum > right.sum;
}
int main(void){
    cin >> n;
    rep(i, n) cin >> L[i];
    cin >> t;
    rep(i, t){
        cin >> name[i] >> P[i];
    }
    vector<hito> d(4010);
    map<string, int> meibo;
    int right = 0;
    rep(i, t){
        if(meibo.count(name[i]) != 0){//いる
            int idx = meibo[name[i]];
            // printf("idx %d\n", idx);
            int num = P[i] - 'A';
            int hosi = L[num];
            int rank = cnt[P[i] - 'A'];
            cnt[P[i] - 'A']++;
            int tscore = 50.0 * (hosi) + (50 * (hosi)) / (0.8 + 0.2 * (rank + 1));
            // printf("%d\n", tscore);
            d[idx].score[num] = tscore;
            d[idx].sum += tscore;
            d[idx].kousin = i;
        }else{
            int idx = right;
            meibo.insert(make_pair(name[i], idx));
            right++;
            d[idx].na = name[i];
            int num = P[i] - 'A';
            int hosi = L[num];
            int rank = cnt[P[i] - 'A'];
            cnt[P[i] - 'A']++;
            int tscore = 50.0 * (hosi) + (50 * (hosi)) / (0.8 + 0.2 * (rank + 1));
            d[idx].score[num] = tscore;
            d[idx].sum += tscore;
            d[idx].kousin = i;
        }
    }
    /*
    rep(i, 2){
        printf("%d %s %d\n", i + 1, d[i].na, d[i].sum);
    }
    */
    d.erase(d.begin() + right, d.end());
    sort(all(d), asc);
    rep(i, d.size()){
        printf("%d ", i + 1);
        cout << d[i].na << " ";
        rep(j, n){
            printf("%d ", d[i].score[j]);
        }
        printf("%d\n", d[i].sum);
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX