QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#49270 | #2281. BnPC | asdasdasfasdfasdfsdaf | TL | 2ms | 3640kb | C++ | 1.7kb | 2022-09-19 21:22:08 | 2022-09-19 21:22:09 |
Judging History
answer
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <cstring>
#include <functional>
#include <algorithm>
struct AttributeInfo
{
uint32_t amount_maxed = 0;
uint32_t occurance = 0;
uint32_t assigned_power;
};
int main()
{
std::ios_base::sync_with_stdio( false );
std::cin.tie( NULL );
int n, k, l;
std::cin >> n >> k;
std::unordered_map<std::string, AttributeInfo> events;
events.reserve( n );
std::string name;
uint32_t power;
for( int i = 0; i < n; i++ ) {
std::cin >> name >> power;
events[name].assigned_power = power;
}
std::cin >> l;
for( int i = 0; i < l; i++ ) {
std::cin >> name >> power;
AttributeInfo& info = events.at( name );
info.occurance++;
if( info.assigned_power == power ) {
info.amount_maxed++;
}
else if( info.assigned_power < power ) {
info.amount_maxed = 1;
int delta = power - info.assigned_power;
info.assigned_power += delta;
k -= delta;
}
}
if( k < 0 ) {
std::cout << "0" << "\n";
}
int max_score = 0;
int score = 0;
AttributeInfo* target;
while( k ) {
max_score = 0;
target = nullptr;
for( auto& attribute_info : events ) {
score = attribute_info.second.occurance + ( attribute_info.second.amount_maxed * attribute_info.second.assigned_power );
if( score > max_score ) {
target = &attribute_info.second;
max_score = score;
}
}
if( target ) {
target->amount_maxed = 0;
target->assigned_power++;
k--;
}
}
score = 0;
for( auto& attribute_info : events ) {
score += ( attribute_info.second.occurance - attribute_info.second.amount_maxed ) * attribute_info.second.assigned_power;
}
std::cout << score << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3540kb
input:
3 14 THISISTHEONE 8 B 0 C 0 8 THISISTHEONE 10 C 0 B 1 B 0 THISISTHEONE 0 C 1 THISISTHEONE 0 THISISTHEONE 0
output:
82
result:
ok single line: '82'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
3 99 THEFIRSTINCREASE 6 SECONDINCREASE 4 ZZZ 1 9 THEFIRSTINCREASE 4 ZZZ 0 THEFIRSTINCREASE 6 SECONDINCREASE 8 THEFIRSTINCREASE 2 SECONDINCREASE 1 ZZZ 0 SECONDINCREASE 8 THEFIRSTINCREASE 3
output:
429
result:
ok single line: '429'
Test #3:
score: 0
Accepted
time: 2ms
memory: 3640kb
input:
5 20 A 100 B 200 C 300 D 400 E 500 949 A 39 A 23 C 163 A 98 B 36 A 3 A 52 B 152 B 167 B 65 C 142 B 66 B 117 C 288 C 155 E 341 A 97 D 173 E 31 A 62 D 90 E 361 A 42 D 85 E 1 C 141 B 77 B 194 D 221 E 203 D 345 E 48 B 26 D 46 B 74 E 380 B 181 C 243 B 112 A 99 E 403 C 20 E 453 C 149 B 26 E 245 A 74 D 304...
output:
285180
result:
ok single line: '285180'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
2 1 A 10 B 12 3 A 10 B 10 B 10
output:
35
result:
ok single line: '35'
Test #5:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
1 1 OVERENTHUSIASTICNESS 41 1 OVERENTHUSIASTICNESS 0
output:
42
result:
ok single line: '42'
Test #6:
score: -100
Time Limit Exceeded
input:
100000 1000000000 A 1000000000 B 1000000000 C 1000000000 D 1000000000 E 1000000000 F 1000000000 G 1000000000 H 1000000000 I 1000000000 J 1000000000 K 1000000000 L 1000000000 M 1000000000 N 1000000000 O 1000000000 P 1000000000 Q 1000000000 R 1000000000 S 1000000000 T 1000000000 U 1000000000 V 1000000...