結果
問題 | No.447 ゆきこーだーの雨と雪 (2) |
ユーザー |
![]() |
提出日時 | 2016-11-18 22:55:50 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 2,074 bytes |
コンパイル時間 | 1,702 ms |
コンパイル使用メモリ | 123,412 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-26 07:37:13 |
合計ジャッジ時間 | 2,326 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:44:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 44 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:48:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 48 | scanf("%d", &star[i]); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:51:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 51 | scanf("%d", &t); | ~~~~~^~~~~~~~~~ main.cpp:57:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 57 | scanf("%s%*c%c", name, &mon); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <iostream>#include <cstdio>#include <vector>#include <cmath>#include <cstring>#include <numeric>#include <algorithm>#include <functional>#include <array>#include <map>#include <queue>#include <limits.h>#include <set>#include <stack>#include <random>#define rep(i,s,n) for(int i = (s); (n) > i; i++)#define REP(i,n) rep(i,0,n)#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))#define POWT(x) ((x)*(x))#define ALL(x) (x).begin(), (x).end()#define MODU 1000000007#define bitcheck(a,b) ((a >> b) & 1)#define bitset(a,b) ( a |= (1 << b))#define bitunset(a,b) (a &= ~(1 << b))using namespace std;typedef pair<int, int> pii;typedef long long ll;const pii Dir[8] = { //?????????{ 0,1 },{ 0,-1 },{ 1,0 },{ -1,0 },{ 1,1 },{ 1,-1 },{ -1,-1 },{ -1,1 }};template<typename A, size_t N, typename T>void Fill(A(&array)[N], const T &val) {std::fill((T*) array, (T*) (array + N), val);}int point(int a, int b) {return 50 * a + (int) ((500 * a) / (8 + 2 * b));}signed main() {int n;scanf("%d", &n);vector<int> star(n);vector<int> monc(n);REP(i, n) {scanf("%d", &star[i]);}int t;scanf("%d", &t);map<string,int> lastsub;map<string, pair<int,map<int,int>>> man;REP(i, t) {char name[17],mon;int mnum;scanf("%s%*c%c", name, &mon);mnum = mon - 'A';monc[mnum]++;man[name].second[mnum] = point(star[mnum], monc[mnum]);man[name].first += point(star[mnum], monc[mnum]);lastsub[name] = -i;}priority_queue<pair<pair<int,int>,string>> ans;for (auto itr : man) {string s;char str [1000];sprintf(str," %s", itr.first.c_str());s += str;REP(i, n) {sprintf(str," %d", itr.second.second[i]);s += str;}sprintf(str," %d\n", itr.second.first);s += str;ans.push({ {itr.second.first,lastsub[itr.first]},s });}int cou = 1;while (ans.size()) {printf("%d %s",cou,ans.top().second.c_str());ans.pop();cou++;}return 0;}