結果

問題 No.447 ゆきこーだーの雨と雪 (2)
ユーザー Konton7Konton7
提出日時 2020-02-07 02:00:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 17 ms / 2,000 ms
コード長 1,830 bytes
コンパイル時間 2,523 ms
コンパイル使用メモリ 216,604 KB
最終ジャッジ日時 2025-01-08 22:37:10
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
struct player
{
string name;
int time;
int total;
vector<int> points;
};
int getpoint(int star, int order)
{
return 50 * star + 500 * star / (8 + 2 * order);
}
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); //for debug
cin.rdbuf(in.rdbuf()); //for debug
#endif
int n, t, c, p;
c = 1;
string name;
char probrem;
vector<int> init_point;
vector<player> players;
map<string, int> player_name;
cin >> n;
int star[n], order[n];
fill(order, order + n, 0);
rep(i, n)
{
cin >> star[i];
init_point.push_back(0);
}
cin >> t;
rep(i, t)
{
cin >> name >> probrem;
if (player_name[name] == 0)
{
players.push_back((player){name, i, 0, init_point});
player_name[name] = c;
c++;
}
order[probrem - 'A']++;
p = getpoint(star[probrem - 'A'], order[probrem - 'A']);
players[player_name[name] - 1].points[probrem - 'A'] = p;
players[player_name[name] - 1].total += p;
players[player_name[name] - 1].time = i;
}
sort(players.begin(), players.end(), [](const player &a, const player &b){
if (a.total != b.total)
return a.total > b.total;
else
return a.time <= b.time;
});
c = 1;
for (auto z : players)
{
cout << c << " " << z.name << " ";
for (auto y : z.points)
cout << y << " ";
cout << z.total << endl;
c++;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0