QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#324898#8230. Submissionsucup-team197#AC ✓455ms84660kbC++178.0kb2024-02-11 01:15:092024-02-11 01:15:09

Judging History

你现在查看的是测评时间为 2024-02-11 01:15:09 的历史记录

  • [2024-10-14 10:06:17]
  • 管理员手动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:495ms
  • 内存:84680kb
  • [2024-05-20 23:50:57]
  • hack成功,自动添加数据
  • (/hack/623)
  • [2024-05-20 23:48:44]
  • hack成功,自动添加数据
  • (/hack/622)
  • [2024-02-11 01:15:09]
  • 评测
  • 测评结果:100
  • 用时:455ms
  • 内存:84660kb
  • [2024-02-11 01:15:09]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e5 + 7 ;

int tp ;
map < string , int > label ;

struct elem {
    string name ;
    vector < pii > subs[ 27 ] ;
    int solved , penalty ;
    bool can_win ;
};
elem a[ MAXN ] ;

int get_medals ( int up ) {
    int hh = up / 10 ;
    while ( 10 * hh < up ) { ++ hh ; }
    if ( hh > 35 ) { hh = 35 ; }
    return hh ; 
}

int get_better ( int solved , int penalty ) {
    int l , r , mid ;
    l = 0 , r = tp ;
    while ( l < r ) {
        int mid = ( l + r + 1 ) / 2 ;
        if ( a[ mid ].solved > solved || ( a[ mid ].solved == solved && a[ mid ].penalty < penalty ) ) {
            l = mid ;
        }
        else { r = mid - 1 ; }
    }
    return l ;
}

void proc ( int bad , int nw_solved , int nw_penalty , int mx_allow ) {
    int cands = 0 ;
    for ( int i = 1 ; i <= tp ; ++ i ) {
        while ( a[ cands + 1 ].solved > a[ i ].solved || ( a[ cands + 1 ].solved == a[ i ].solved && a[ cands + 1 ].penalty < a[ i ].penalty ) ) {
            ++ cands ;
        }
        int act = cands ;
        if ( bad <= cands ) { -- act ; }
        if ( nw_solved > a[ i ].solved || ( nw_solved == a[ i ].solved && nw_penalty < a[ i ].penalty ) ) {
            ++ act ;
        }
        if ( act < mx_allow ) { a[ i ].can_win = true ; }
    }
}

void solve ( ) {
    label.clear ( ) ;
    for ( int i = 0 ; i <= tp ; ++ i ) {
        for ( int j = 0 ; j < 26 ; ++ j ) {
            a[ i ].subs[ j ].clear ( ) ;
        }
        a[ i ].name.clear ( ) ;
        a[ i ].solved = a[ i ].penalty = 0 ;
        a[ i ].can_win = false ;
    }
    a[ 0 ].solved = 55 ;
    a[ 0 ].penalty = 0 ;
    tp = 0 ;
    int q ; cin >> q ;
    for ( int i = 1 ; i <= q ; ++ i ) {
        string s ;
        char prob ;
        int tm ;
        string verdict ;
        cin >> s >> prob >> tm >> verdict ;

        if ( label.find ( s ) == label.end ( ) ) {
            label[ s ] = ++ tp ;
            a[ tp ].name = s ;
        }
        int who = label[ s ] ;
        int pid = prob - 'A' ;
        int type = 0 ;
        if ( verdict == "accepted" ) { type = 1 ; }
        a[ who ].subs[ pid ].push_back ( { tm , type } ) ;
    }
    int init_nz = 0 ;
    for ( int i = 1 ; i <= tp ; ++ i ) {
        for ( int j = 0 ; j < 26 ; ++ j ) {
            int add = 0 ;
            for ( auto [ tm , type ] : a[ i ].subs[ j ] ) {
                if ( type == 1 ) {
                    a[ i ].solved += 1 ;
                    a[ i ].penalty += add + tm ;
                    break ;
                }
                else {
                    add += 20 ;
                }
            }
        }
        if ( a[ i ].solved > 0 ) { ++ init_nz ; }
    }
    auto cmp = [ & ] ( elem p1 , elem p2 ) {
        if ( p1.solved != p2.solved ) { return p1.solved > p2.solved ; }
        return p1.penalty < p2.penalty ;
    };
    sort ( a + 1 , a + tp + 1 , cmp ) ;
    /**
    cout << "Initial: \n" ;
    for ( int i = 1 ; i <= tp ; ++ i ) {
        cout << a[ i ].name << " " << a[ i ].solved << " " << a[ i ].penalty << "\n" ;
    }
    **/
    int init_medals = get_medals ( init_nz ) ;
    // do nothing
    for ( int i = 1 ; i <= tp ; ++ i ) {
        int sr = get_better ( a[ i ].solved , a[ i ].penalty ) ;
        if ( sr < init_medals ) { a[ i ].can_win = true ; }
    }
    int worst_new_id = -1 , worst_new_penalty = -1 ;
    // improve your own
    for ( int i = 1 ; i <= tp ; ++ i ) {
        if ( a[ i ].can_win == true ) { continue ; }
        for ( int j = 0 ; j < 26 ; ++ j ) {
            if ( a[ i ].subs[ j ].empty ( ) == true ) { continue ; }
            int add = 0 , init_solved = 0 , init_penalty = 0 ;
            for ( auto [ tm , type ] : a[ i ].subs[ j ] ) {
                if ( type == 1 ) {
                    init_solved += 1 ;
                    init_penalty += add + tm ;
                    break ;
                }
                else {
                    add += 20 ;
                }
            }
            int sr_solved = a[ i ].solved - init_solved + 1 ;
            int sr_penalty = a[ i ].penalty - init_penalty + (a[ i ].subs[ j ].begin ( ))->fi ;
            int mx_allow = get_medals ( init_nz + ( a[ i ].solved == 0 ) ) ;            
            
            if ( sr_solved == 1 && a[ i ].solved == 0 ) {
                add = 0 ;
                int worst_penalty = 0 ;
                int acs = 0 ;
                for ( auto [ tm , type ] : a[ i ].subs[ j ] ) {
                    if ( type == 1 ) {
                        ++ acs ;
                        if ( acs == 2 ) {
                            worst_penalty = add + tm ;
                            break ;
                        }
                        else {
                            ++ add ;
                        }
                    }
                    else {
                        add += 20 ;
                    }
                }
                if ( acs < 2 ) {
                    add -= 20 ;
                    worst_penalty = add + a[ i ].subs[ j ].back ( ).fi ;
                }
                if ( worst_penalty > worst_new_penalty ) {
                    worst_new_id = i ;
                    worst_new_penalty = worst_penalty ;
                }
            }
            if ( get_better ( sr_solved , sr_penalty ) < mx_allow ) {
                a[ i ].can_win = true ;
                break ;
            }

        }
    }
    // someone declines
    for ( int i = 1 ; i <= init_medals + 2 ; ++ i ) {
        if ( i > tp || a[ i ].can_win == false ) { continue ; }
        for ( int j = 0 ; j < 26 ; ++ j ) {
            if ( a[ i ].subs[ j ].empty ( ) == true ) { continue ; }
            int add = 0 , init_solved = 0 , init_penalty = 0 ;
            for ( auto [ tm , type ] : a[ i ].subs[ j ] ) {
                if ( type == 1 ) {
                    init_solved += 1 ;
                    init_penalty += add + tm ;
                    break ;
                }
                else {
                    add += 20 ;
                }
            }
            if ( init_solved == 0 ) { continue ; }
            add = 0 ;
            int nw_solved = 0 , nw_penalty = 0 ;
            bool ignored = false ;
            for ( auto [ tm , type ] : a[ i ].subs[ j ] ) {
                if ( type == 1 ) {
                    if ( ignored == false ) {
                        add += 20 ;
                        ignored = true ;
                    }
                    else {
                        nw_solved += 1 ;
                        nw_penalty += add + tm ;
                        break ;
                    }
                }
                else {
                    add += 20 ;
                }
            }
            
            int sr_solved = a[ i ].solved - init_solved + nw_solved ;
            int sr_penalty = a[ i ].penalty - init_penalty + nw_penalty ;
            int mx_allow = get_medals ( init_nz - ( sr_solved == 0 ) ) ;
            // cout << "trying " << i << " " << sr_solved << " " << sr_penalty << " " << mx_allow << "\n" ;
            proc ( i , sr_solved , sr_penalty , mx_allow ) ;
        }
    }
    if ( worst_new_id > 0 ) { 
        // cout << "trying " << worst_new_id << " " << 1 << " " << worst_new_penalty << " " << get_medals ( init_nz + 1 ) << "\n" ;
        proc ( worst_new_id , 1 , worst_new_penalty , get_medals ( init_nz + 1 ) ) ;
    }
    int cnt = 0 ;
    for ( int i = 1 ; i <= tp ; ++ i ) {
        if ( a[ i ].can_win == true ) { ++ cnt ; }
    }
    cout << cnt << "\n" ;
    for ( int i = 1 ; i <= tp ; ++ i ) {
        if ( a[ i ].can_win == true ) { cout << a[ i ].name << " " ; }
    }
    cout << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 7ms
memory: 71768kb

input:

2
5
TSxingxing10 G 0 rejected
TSxingxing10 B 83 accepted
aoliaoligeiliao J 98 accepted
TS1 J 118 accepted
TS1 B 263 accepted
12
AllWayTheNorth A 0 rejected
YaoYaoLingXian Y 10 accepted
XuejunXinyoudui1 X 200 rejected
XuejunXinyoudui1 X 200 accepted
LetItRot L 215 accepted
AllWayTheNorth W 250 accept...

output:

2
TS1 TSxingxing10 
4
AllWayTheNorth XuejunXinyoudui1 LetItRot ImYourFan 

result:

ok 2 test cases ok. (2 test cases)

Test #2:

score: 0
Accepted
time: 7ms
memory: 71552kb

input:

2
2
jiangly_fan A 1 accepted
jiangly B 23 accepted
3
conqueror_of_tourist A 1 accepted
conqueror_of_tourist A 2 accepted
tourist B 23 accepted

output:

2
jiangly_fan jiangly 
1
conqueror_of_tourist 

result:

ok 2 test cases ok. (2 test cases)

Test #3:

score: 0
Accepted
time: 7ms
memory: 71804kb

input:

2
13
A A 1 accepted
A X 1 accepted
K K 1 rejected
B B 2 accepted
C C 2 accepted
D D 2 accepted
E E 2 accepted
F F 2 accepted
G G 2 accepted
H H 2 accepted
I I 2 accepted
J J 2 accepted
K K 2 rejected
12
A A 1 accepted
A X 1 accepted
B B 2 accepted
C C 2 accepted
D D 2 accepted
E E 2 accepted
F F 2 a...

output:

11
A B C D E F G H I J K 
1
A 

result:

ok 2 test cases ok. (2 test cases)

Test #4:

score: 0
Accepted
time: 9ms
memory: 71820kb

input:

2
11
A A 1 accepted
B B 1 accepted
C C 2 accepted
D D 2 accepted
E E 2 accepted
F F 2 accepted
G G 2 accepted
H H 2 accepted
I I 2 accepted
J J 2 accepted
K K 2 accepted
12
A A 1 accepted
A X 1 accepted
K K 1 rejected
B B 2 accepted
C C 2 accepted
D D 2 accepted
E E 2 accepted
F F 2 accepted
G G 2 a...

output:

2
A B 
2
A K 

result:

ok 2 test cases ok. (2 test cases)

Test #5:

score: 0
Accepted
time: 47ms
memory: 71772kb

input:

100000
1
M3JytWoaEXxkACy_mBAQ R 111 accepted
1
sQ O 151 accepted
1
JinbrcS58gNEE5yTSkT B 140 accepted
1
cklwBY V 243 accepted
1
v_o42YmvEKFwy Q 260 rejected
1
ftQVK8S_um22w K 265 accepted
1
_bQBeFeDpYQhvZcLf9l3 Z 147 accepted
1
KvDcEAIDN A 75 rejected
1
H3MUK6 A 101 rejected
1
gxYo_oCFn2J8aIben U 54...

output:

1
M3JytWoaEXxkACy_mBAQ 
1
sQ 
1
JinbrcS58gNEE5yTSkT 
1
cklwBY 
1
v_o42YmvEKFwy 
1
ftQVK8S_um22w 
1
_bQBeFeDpYQhvZcLf9l3 
1
KvDcEAIDN 
1
H3MUK6 
1
gxYo_oCFn2J8aIben 
1
_isnlUGK0ddI 
1
BERcVjyCp 
1
6In2do_50ylch 
1
f0r3SXc6brMjT 
1
7njYOapSwvogA 
1
x 
1
y1w3KvxylfxwprRBYw 
1
aGedzS 
1
iPo0GDhIF 
1
4Vf...

result:

ok 100000 test cases ok. (100000 test cases)

Test #6:

score: 0
Accepted
time: 81ms
memory: 71796kb

input:

10000
42
Bzs0PiQMXGZ5rRZ_2D G 2 accepted
9XtB_VIfbRRL E 11 accepted
FVJL M 13 rejected
a S 19 accepted
tsd Z 20 rejected
MyCqVEg1ONjZ U 22 accepted
6SgZMn N 51 rejected
Qua1Pti3vKhyQKDUm P 54 accepted
i29 M 63 accepted
zPqu D 68 rejected
xx2yiu6x C 71 rejected
fYuK1KNkuyO5HRCq L 76 rejected
tXWpYVqj...

output:

4
Qua1Pti3vKhyQKDUm fYuK1KNkuyO5HRCq xiLm0TUOF3T tsd 
2
t3 JP 
2
fhYPGC8W82NwJTQL 77sgqpbTIr_Zt1 
2
pVWDEz 3BQ 
2
tg buCeoOotAkV8DaFD6 
1
UkXQ3iaNJ 
2
vwfw ALTqPt7JUSLrl 
1
QTEzV6tp 
3
9cy_y_RNRwex8j7224hz wJlbqIU 4e1l0pO8eFjZwkDo 
2
eiuF7a_ 6mbCu5zA 
1
xy6QBr8ECi 
3
ldaKLZb1oS1sS PezeyUurYoz7N1iGU ...

result:

ok 10000 test cases ok. (10000 test cases)

Test #7:

score: 0
Accepted
time: 80ms
memory: 71664kb

input:

10000
27
bhAGFVDBjp4_Tvo U 24 accepted
bhAGFVDBjp4_Tvo O 37 rejected
bhAGFVDBjp4_Tvo D 40 accepted
bhAGFVDBjp4_Tvo H 45 accepted
bhAGFVDBjp4_Tvo B 60 rejected
bhAGFVDBjp4_Tvo J 63 accepted
bhAGFVDBjp4_Tvo M 81 rejected
bhAGFVDBjp4_Tvo M 98 rejected
bhAGFVDBjp4_Tvo D 103 rejected
bhAGFVDBjp4_Tvo Q 11...

output:

1
bhAGFVDBjp4_Tvo 
2
euenQ rl 
1
seny 
2
nLWe5xvBqfYkN 8zfFqdixKjh 
1
VDeEtfbb 
1
9PAd7wtbCZMws6u 
1
Wsfc5qold4uacAjI1y 
2
h68cyLwQ7drM__pSJub NX6GLK3Nz 
3
U7S8zgJhR6 sdf0IGct21OeEFJ yOgwg 
1
acesvM9yT 
1
2hQb 
2
P5 3twK2MJI_ 
1
eGCz 
3
tLHWIEVr5i7vlKpvlP UXRu8i 39GgHUPovILESCd0 
1
20gsbZ25SsYp8 
1
...

result:

ok 10000 test cases ok. (10000 test cases)

Test #8:

score: 0
Accepted
time: 80ms
memory: 71588kb

input:

10000
2
vVflLovvnhJEO U 3 accepted
Fg P 48 rejected
12
V9UJ5hEaWiwMq3lxwKw9 P 30 accepted
CKsw M 34 rejected
dCZBzKMxgQfgBDZO R 50 rejected
A1R2kF N 54 rejected
A1R2kF X 65 accepted
HEih51ut H 68 rejected
HEih51ut J 75 rejected
l0MCFXNXlH6T2wT I 163 accepted
A1R2kF B 180 accepted
dCZBzKMxgQfgBDZO A ...

output:

1
vVflLovvnhJEO 
2
A1R2kF V9UJ5hEaWiwMq3lxwKw9 
4
xgdxQ7t 5sFcoMh 2 fLUS3NYE 
2
2ra47EFC7LWzxTF2tSH S25TIbMLU5FMV6ys4 
2
tczurXngUW uwm 
3
gWG1aLfP1Gk DNAv Zh4tWi1QdYjTblw5 
1
qN_OnmRhGksD 
1
pAJC7fTKPJjaxPP 
2
Jr9Sqekor mElj5iV4wfu 
1
_Z13N_OO 
1
rn 
1
HhjFL6Rg 
1
2q 
5
eO6B_fLKDAZoY vdFavgJoOBT4vr...

result:

ok 10000 test cases ok. (10000 test cases)

Test #9:

score: 0
Accepted
time: 84ms
memory: 71696kb

input:

10000
4
BUqwUvN2v7co K 45 accepted
fb4ykhGx9CBzWxLcGYjf F 96 rejected
3X39YaWp0LItH14Owx R 142 rejected
7JGP4qtBonRiKpsKW U 155 rejected
3
Z0cxqdpQ69NGV5wDoht X 92 rejected
1E0aicZDqPhh E 105 accepted
a3fvTkSrKXqQipNGs4h K 261 rejected
6
LR6PY6OjDoSaZpT W 33 accepted
Et8w1E52xfM27 Q 155 accepted
LR6...

output:

1
BUqwUvN2v7co 
2
1E0aicZDqPhh Z0cxqdpQ69NGV5wDoht 
1
LR6PY6OjDoSaZpT 
3
b YX 7f 
4
WqSH sgpEsfgf_Fd o7VPp buFAkOkQ_F 
1
coTjuCSsnonAgjYkChE 
2
clGo2Z4AMe9Qp GC0Lw1Di 
2
IrJ_n_Ym FCCHBTUTGJTbTjEb 
1
fkBpEQxhBl21ARSTVR 
1
fQzlJS9JEIS97gIIG7p4 
6
CVVvEx otcG2t pqyDmprb2RmUBafc76eR ljfPMl71hE togGKu7uZ...

result:

ok 10000 test cases ok. (10000 test cases)

Test #10:

score: 0
Accepted
time: 88ms
memory: 71660kb

input:

10000
7
dBv7DiT L 42 rejected
dBv7DiT P 123 accepted
7Bj2dZF6Gy7csrXYakI T 131 rejected
9KtuO O 190 accepted
BxACEk Q 285 rejected
BxACEk Q 291 rejected
HK0pq9qsGnlkgAQT L 296 accepted
3
NQgnW3CShrFJYkKdjagN G 53 rejected
ZwZCr O 261 accepted
ZwZCr P 270 accepted
6
mbGQ7wcZYr9leKBCsFN Z 4 rejected
7...

output:

2
dBv7DiT 9KtuO 
1
ZwZCr 
2
7s1bgtS 4LUVnW93OFHOl6fJOmXK 
4
_g2LouxyEI_BXaOYQWn CZNz6k1QgLrHojbY upCvWQnHRgRSQQ pz 
3
t ungF4dKzJt290JMWNgeH q 
3
4FjAuM44Nzaz6Tc0 6mCVqSBpHVkrNZ SuBp7xLMGCHgk 
1
xXqqS7r1OU 
1
YEHiJvhHR8OmUWz 
3
m 0WZFvefoPtNo BiasA1Md2ViU 
1
MzQD 
2
MJJ4n2rC7YHRflGzEL L501za_ktc 
1
...

result:

ok 10000 test cases ok. (10000 test cases)

Test #11:

score: 0
Accepted
time: 24ms
memory: 71996kb

input:

7
110
10 A 0 accepted
0 A 100 accepted
1 A 100 accepted
2 A 100 accepted
3 A 100 accepted
4 A 100 accepted
5 A 100 accepted
6 A 100 accepted
7 A 100 accepted
8 A 100 accepted
9 A 100 accepted
0 B 100 accepted
1 B 100 accepted
2 B 100 accepted
3 B 100 accepted
4 B 100 accepted
5 B 100 accepted
6 B 10...

output:

11
0 1 2 3 4 5 6 7 8 9 10 
11
0 1 2 3 4 5 6 7 8 9 10 
11
0 1 2 3 4 5 6 7 8 9 10 
11
0 1 2 3 4 5 6 7 8 9 100 
12
0 1 2 3 4 5 6 7 8 9 10 100 
36
27 19 20 21 22 23 24 25 26 1 28 29 30 31 32 33 34 0 17 18 2 3 4 5 6 7 8 10 11 12 13 14 15 16 9 35 
35
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21...

result:

ok 7 test cases ok. (7 test cases)

Test #12:

score: 0
Accepted
time: 143ms
memory: 71908kb

input:

1000
58
8VR4968BiWGrjt0 G 1 accepted
KfduBOJVYor3ixLgzUo Y 5 accepted
r9l9P_xyc7oagiZS0ZJ G 26 accepted
PL3OrMzXRJRVskByRHHl Y 38 accepted
7wL2M4T1PWyv9rJSdzGN N 47 rejected
Vu56KH6ZGwSm E 48 rejected
8VR4968BiWGrjt0 D 53 accepted
SI7h8yP C 57 rejected
aSVEsYSH9PJjsjSAyH N 61 accepted
D3UrdM8xI S 71...

output:

5
8VR4968BiWGrjt0 PL3OrMzXRJRVskByRHHl umqh9D mn0iyGyqWOakTAs1Qw SI7h8yP 
6
9M f22a5ba_ze2qsm2_2k 3A4BJULiR9S uxPAbOmdBcWg64Q52 EYdAeGI 6OSsIJ 
25
huLWXo JjWIyr8 DIt wd5q6DH 6zU XJ9p0AKseAnbt7vmR_ lUs4Rd_AXJR2FP48 qF0kRrasPk V 9DVkaj8vMDxLV4MVh2O_ wjew0c2d FJhecJwM m4fNASlCh u nl0QcKuac D6SdnJFh6xFQ...

result:

ok 1000 test cases ok. (1000 test cases)

Test #13:

score: 0
Accepted
time: 194ms
memory: 73088kb

input:

100
974
qG R 0 accepted
k2K I 0 accepted
NelrCjQd_AHSw107 D 1 accepted
ybeH_JvdmCLMOGl9x K 1 accepted
h3 Q 2 accepted
9qOW O 2 accepted
v1IWHoW7Mkuce6qH Y 2 accepted
mlypVkK5Xl1KXw3o P 2 rejected
zs X 3 accepted
1Fpyq8oUYV_aNp I 3 rejected
e1bM8xUh E 3 rejected
myaSH0LCL4hD5BlAj F 4 rejected
IJETUS2...

output:

65
v8ok8uFd3 PGbK jpgL7AOwwgwK4fC Io5tMwXAJlbYL2Wikqqq ph3vkoSPOLM9EarA 2cBZ QXFitGeaPT8BjI T0nxKkJV ybeH_JvdmCLMOGl9x ZSGN5hzdkSTUHpfNk03 185RryPWmjK2h47NJax 1qXXQyXNhDyf97IT0n JSC6wpny7viIbAUq qG lQdXyR QGg o_d5R9oBv dHvWryQd8SGEch mBzwDDISUnGJ03 55IlpzN jp0GVUcZUKvitpzn9 3f3gDxR FJ9Y jjlJFal1mKsc...

result:

ok 100 test cases ok. (100 test cases)

Test #14:

score: 0
Accepted
time: 240ms
memory: 74756kb

input:

10
5371
r0JLpp2hFx T 0 accepted
w19l89 X 0 rejected
PeEB Y 0 accepted
2MwVQe3 Y 0 accepted
CarjodD8k4E K 0 accepted
vNjq0LmY D 0 accepted
Bvi16IvVACG3uREuoO X 0 accepted
yMlDlaWPTluR1dk43nl6 A 0 rejected
4LBA3qILgaib4lrQ X 1 accepted
vRSpyKVAU7e I 1 rejected
627aFcGG4zh8 Z 1 rejected
FHwI U 1 accept...

output:

85
FHwI us0nX6O Yg2 rYdosBQym DdOUBy W5kPWYzB Lhpil n5 CgcD1 Du2Rmmj_rlgveV I9Tfaeo6lTwLkgC90n vTtpWBju RYY7Oy5Ma3N_Q 3ntTBJ2G Tsv4prgzdtzBRbKoQO 7R iTzYUh2 FlTsTqSJ TiH aXGT Ok 9Saa 2AF3LbCAMXg vjtxbRlXkOLT fW_i UhNeNpTgJpuTp4im m8egNT9AnqXg IxS gSEQxgTIy WiikFMuk_mwuntjRW9 DoLs mbbtuMJM9C TwJGX0B5...

result:

ok 10 test cases ok. (10 test cases)

Test #15:

score: 0
Accepted
time: 400ms
memory: 80892kb

input:

1
100000
OZeDY6m2v P 0 accepted
DolcP A 0 accepted
2Z9Yd M 0 rejected
Vjl F 0 accepted
SPetC8_ru4S3nXJkkD C 0 rejected
XhLC G 0 rejected
wZvhcns7t7EaOero E 0 accepted
HRqRKcO87 I 0 rejected
dwfT7D H 0 rejected
cxvYaN8zSMGpoa9Q9xv U 0 accepted
nvXlrCa1zbx8uokfd T 0 accepted
E_bbU5C9bgpD_wGo P 0 rejec...

output:

213
WkhL56sCNA 0hH td2QZhNj3_yuVDIRv AFI6LHRQdFZsGz C43v3R4b8LW3Q9 JywY2nxqp7vDlS7acVp H0k8x8atYKY_21zGSH XCr3cyEYfUobJWWeq4Jf XpmVdJL e3j8zVv4RVEyu ijs5Fqs3HFNSIeg AUy _awjT fWb7IydN_gKzO2taC E0ujOKr8 Bd mA38ho AzFHajD2avcSUKFa _gYXF gSr1b944aMPbrjagCZO XU8Ig 7DqC__BGQC70H0v Bv2Zg6BW2i8glnP kQwNZqy...

result:

ok 1 test cases ok. (1 test case)

Test #16:

score: 0
Accepted
time: 14ms
memory: 72720kb

input:

1
100000
A A 0 accepted
B Z 299 accepted
B Z 299 accepted
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A 299 rejected
B A ...

output:

1
B 

result:

ok 1 test cases ok. (1 test case)

Test #17:

score: 0
Accepted
time: 455ms
memory: 84660kb

input:

1
100000
qyGXWlwMuXY3212 A 20 accepted
l_IeEuuLy9 A 20 accepted
nlyFO0YOiDxyiNjBb A 20 accepted
8H A 20 accepted
ek A 20 accepted
Em63tewQVLljOUO4r A 20 accepted
AHdtZtwK8debApdvxMy8 A 20 accepted
l3aTB A 20 accepted
vyFuSSSLTV5yP A 20 accepted
uzPnnAXshwHCbl7 A 20 accepted
sL A 20 accepted
K099qoYV...

output:

99965
TzIt8tE CibPaV auvRJfUAJTND9dU Pr0qOV0te 6fveIowM2 L30L5Irm9yGWHk98vI OgIoQFsuO3bX DqNA 1fsRDMoirneOPAlBYasR I9pQ2_iWQ7a 94 V XVtjvOd8gkPOH vV5RssHVQgZRkGf0 Cp zw MpzRY u_ g8M8urNPRWM G3 0e pfLbJy kcOyj1cyZOWH_GUabu A9HXLs_O2esOqFG cbDeMjxCq7GFy iyb7xj36qb8uJxcNEsd l9twqnaxXtKPhQEjaa1 _2O0I9Qv...

result:

ok 1 test cases ok. (1 test case)

Test #18:

score: 0
Accepted
time: 455ms
memory: 84660kb

input:

1
100000
xhmAFe A 20 accepted
loPCkhj2qt A 20 accepted
WIx A 20 accepted
T3zIPb A 20 accepted
xEEBg A 20 accepted
Gd0_zLXNJ1l1_Zrqa2 A 20 accepted
cM68n01suqhgjrBA A 20 accepted
LA6 A 20 accepted
AXBqy A 20 accepted
VLc4yxmdrN7S A 20 accepted
6p_z1vz2 A 20 accepted
wujWaUQNU0 A 20 accepted
eHIPyc0l3...

output:

99965
QAU0u 53XZTwZI3oDwi 0z_ja Yuli e8X0M dreyjmL iTNJ5n3CsQHY198Z krsa5w868pqT4U4C2Qs j_aZ5RR_ 6gQ0m_F1cdPYazO1G RR8EmArgx4irl WHex luNs26eJk CJSvvD0EfBu3layGkki 2oQCy_uTDZScBPKP9x JIj_KsjYaYX7F EKkuqb0 2IvvRv8Z140f7BcY YUm8eDkmZ4Tx 67aVrcyB7Q 8vQTtX3Cd DY272sC17b 2c9oYWppzlt bkaZ58YDziupZNgG YFms...

result:

ok 1 test cases ok. (1 test case)

Extra Test:

score: 0
Extra Test Passed