結果

問題 No.447 ゆきこーだーの雨と雪 (2)
ユーザー IL_mstaIL_msta
提出日時 2017-01-21 14:50:07
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 7 ms / 2,000 ms
コード長 5,057 bytes
コンパイル時間 1,540 ms
コンパイル使用メモリ 126,472 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-08-24 19:19:05
合計ジャッジ時間 3,540 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 5 ms
4,376 KB
testcase_06 AC 6 ms
4,380 KB
testcase_07 AC 4 ms
4,376 KB
testcase_08 AC 5 ms
4,376 KB
testcase_09 AC 6 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 3 ms
4,380 KB
testcase_12 AC 3 ms
4,376 KB
testcase_13 AC 6 ms
4,380 KB
testcase_14 AC 7 ms
4,376 KB
testcase_15 AC 3 ms
4,376 KB
testcase_16 AC 3 ms
4,380 KB
testcase_17 AC 3 ms
4,380 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 6 ms
4,376 KB
testcase_20 AC 7 ms
4,380 KB
testcase_21 AC 3 ms
4,376 KB
testcase_22 AC 3 ms
4,380 KB
testcase_23 AC 3 ms
4,376 KB
testcase_24 AC 5 ms
4,376 KB
testcase_25 AC 6 ms
4,376 KB
testcase_26 AC 3 ms
4,380 KB
testcase_27 AC 4 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include<cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
#define MAIN_INIT std::cin.tie(0); \
    std::ios::sync_with_stdio(false);\
	std::cout << std::fixed;//小数を10進数表示
/////////
#ifdef getchar_unlocked
#define mygc(c) (c)=getchar_unlocked()
#else
#define mygc(c) (c)=getchar()
#endif
#ifdef putchar_unlocked
#define mypc(c) putchar_unlocked(c)
#else
#define mypc(c) putchar(c)
#endif
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
#ifdef _DEBUG
#define DEBUG_BOOL(b) assert(b)
#else
#define DEBUG_BOOL(b) 
#endif
/////数値読み込み
#define ENABLE_READER_ON(T)	\
inline void reader(T &x){int k;x = 0;bool flag = true;\
while(true){mygc(k);\
if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\
}\
if( flag ){while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 + (k - '0');}}\
else{while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 - (k-'0');}}\
}
//整数
ENABLE_READER_ON(int)
ENABLE_READER_ON(long)
ENABLE_READER_ON(long long)
ENABLE_READER_ON(unsigned int)
ENABLE_READER_ON(unsigned long)
ENABLE_READER_ON(unsigned long long)

//////
//文字読み込み
inline int reader(char& c){int i;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c = i;
return i;}

inline int reader(char c[]){int i,s=0;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c[s++]=i;
for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}
c[s]='\0';return s;
}

inline int reader(string& c,int size=100){int i;c.reserve(size);
for(;;){mygc(i);if(i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF)break;}
c.push_back(i);
for(;;){mygc(i);if(i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)break;c.push_back(i);}
return c.size();}

/////////
//数値出力
#define ENABLE_WRITER_ON(T)	\
inline void writer(T x){char f[20];int s = 0;\
if (x<0){mypc('-');while(x){f[s++] = ~(x%10)+1,x /= 10;}}\
else{while(x){f[s++] = (x % 10), x /= 10;}}\
if (!s)f[s++] = 0;while (s--)mypc(f[s] + '0');}

ENABLE_WRITER_ON(int)
ENABLE_WRITER_ON(long)
ENABLE_WRITER_ON(long long)
ENABLE_WRITER_ON(unsigned int)
ENABLE_WRITER_ON(unsigned long)
ENABLE_WRITER_ON(unsigned long long)
/////////
inline void writer(const char c){mypc(c);}
inline void writer(const char c[]){for (int i = 0; c[i] != '\0'; i++)mypc(c[i]); }
inline void writer(const string str){writer( str.c_str() );}
///////////////////////////////////////////////////////////
// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
struct Person{
	string name;
	int sum;
	int time;
	vector<int> score;

	bool operator<(const Person& R ) const{
		if( sum > R.sum ){
			return true;
		}else if( sum < R.sum ){
			return false;
		}
		//sum == R.sum
		if( time < R.time ){
			return true;	
		}
		return false;
	}
};

int score(int hosi,int No){
	int ret;
	ret = 50*hosi+(500*hosi)/(8+2*No);
	return ret;
}
inline void solve(){
	int N;
	reader(N);
	vector<int> hosi(N);
	for(int i=0;i<N;++i){
		reader(hosi[i]);
	}
	int T;
	reader(T);
	vector<Person> data;
	map<string,int> dataIndex;
	map<string,int >::iterator itr,end;
	string name;
	char P;
	int No;
	vector<int> AC(N,1);
	const int time = N;
	const int sum = N+1;
	
	for(int i=0;i<T;++i){
		reader(name);
		reader(P);
		No = P-'A';
		itr = dataIndex.find(name);
		if( itr == dataIndex.end() ){//初
			Person temp;
			temp.name = name;
			temp.sum = score(hosi[No],AC[No]);
			temp.time = i;
			temp.score.resize(N);
			temp.score[No] = temp.sum;

			data.push_back( temp );
			dataIndex[name] = data.size()-1;
		}else{
			int index = itr->second;
			data[index].score[No] = score(hosi[No],AC[No]);
			data[index].sum += data[index].score[No];
			data[index].time = i;
		}
		
		name = "";
		AC[No]++;
	}
	sort( data.begin(),data.end() );

	vector<Person>::iterator perIt,perEnd;
	vector<int>::iterator scoreIt,scoreEnd;
	perIt = data.begin();
	perEnd = data.end();
	for(int i=1;perIt != perEnd;++perIt,++i){
		writer(i);writer(" ");
		writer(perIt->name);writer(" ");
		scoreIt = perIt->score.begin();
		scoreEnd = perIt->score.end();
		for(;scoreIt != scoreEnd;++scoreIt){
			writer( *scoreIt );writer(" ");
		}
		writer( perIt->sum );writer("\n");
	}
}

int main(void){
    MAIN_INIT;
    cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();

	return 0;
}
0