QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#49021#2281. BnPCasdasdasfasdfasdfsdafRE 4ms3724kbC++1.8kb2022-09-19 05:18:452022-09-19 05:18:47

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-09-19 05:18:47]
  • 评测
  • 测评结果:RE
  • 用时:4ms
  • 内存:3724kb
  • [2022-09-19 05:18:45]
  • 提交

answer

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <cstring>


struct action
{
    char name[22];
    int power;
};

int main()
{
    int n, k;
    std::cin >> n; std::cin >> k;
    //action* action_list = reinterpret_cast<action*>( alloca( n * sizeof action ) );
    action action_list[11000];
    for( int i = 0; i < n; i++ ) {
        std::cin >> action_list[i].name;
        std::cin >> action_list[i].power;
    }

    int l;
    std::cin >> l;
    //action* event_list = reinterpret_cast<action*>( alloca( l * sizeof action ) );
    action event_list[11000];


    for( int i = 0; i < l; i++ ) {
        std::cin >> event_list[i].name;
        std::cin >> event_list[i].power;
    }

    int max_score = 0;

    while( k ) {
        int target_index = 0;
        max_score = 0;
        for( int x = 0; x < n; x++ ) {
            int score = 0;
            action_list[x].power += 1;
            for( int i = 0; i < n; i++ ) {
                for( int j = 0; j < l; j++ ) {
                    if( strcmp( action_list[i].name, event_list[j].name ) == 0 ) {
                        if( action_list[i].power > event_list[j].power ) {
                            score += action_list[i].power;
                        } else if( action_list[i].power < event_list[j].power ) {
                            action_list[x].power--;
                            action_list[i].power++;
                            goto skip;
                        }
                    }
                }
            }
            action_list[x].power -= 1;
            if( score > max_score ) {
                target_index = x;
                max_score = score;
            }
        }
        action_list[target_index].power++;
    skip: k--;
    }

    std::cout << max_score;

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3580kb

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: 2ms
memory: 3436kb

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: 4ms
memory: 3672kb

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: 3724kb

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: 1ms
memory: 3724kb

input:

1 1
OVERENTHUSIASTICNESS 41
1
OVERENTHUSIASTICNESS 0

output:

42

result:

ok single line: '42'

Test #6:

score: -100
Runtime Error

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...

output:


result: