QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#547394#8230. Submissionsucup-team4821AC ✓104ms85860kbC++146.6kb2024-09-04 21:14:232024-09-04 21:14:24

Judging History

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

  • [2024-09-04 21:14:24]
  • 评测
  • 测评结果:AC
  • 用时:104ms
  • 内存:85860kb
  • [2024-09-04 21:14:23]
  • 提交

answer

#include <bits/stdc++.h>
int T, n, m, a[100005], b[100005], c[100005], rk[100005], addtim;
std::pair<int, int> best[100005], now[100005], worst[100005];
std::string f[100005];
std::pair<int, int> max[100005];
bool pp[100005];
bool d[100005];
std::vector<int> e[100005][26], ans;
std::map<std::string, int> map;
bool cmp(const std::pair<int, int> &A, const std::pair<int, int> &B) { return A.first == B.first ? A.second < B.second : A.first > B.first; }
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> T;
    while (T--)
    {
        std::cin >> n;
        m = 0;
        addtim = -1;
        for (int i = 1; i <= n; ++i)
        {
            static std::string str1, str2;
            static char c1;
            std::cin >> str1 >> c1 >> c[i] >> str2;
            a[i] = map.insert({str1, map.size()}).first->second;
            b[i] = c1 - 'A';
            d[i] = str2 == "accepted";
            e[a[i]][b[i]].push_back(i);
        }
        for (auto i : map)
            f[i.second] = i.first;
        for (std::size_t i = 0; i != map.size(); ++i)
        {
            for (int j = 0; j != 26; ++j)
            {
                int cur = 0;
                for (auto k : e[i][j])
                    if (d[k])
                    {
                        now[i].first += 1;
                        now[i].second += cur * 20 + c[k];
                        break;
                    }
                    else
                        ++cur;
            }
        }
        std::iota(rk, rk + map.size(), 0);
        std::sort(rk, rk + map.size(), [&](const int &A, const int &B)
                  { return cmp(now[A], now[B]); });
        for (std::size_t i = 0; i != map.size(); ++i)
        {
            if (now[i].first == 0)
                for (int j = 0; j != 26; ++j)
                    if (!e[i][j].empty())
                        addtim = std::max(addtim, c[e[i][j].back()] + int(e[i][j].size() - 1) * 20);
            m += bool(now[i].first);
            best[i] = worst[i] = now[i];
            for (int j = 0; j != 26; ++j)
            {
                static std::vector<int>::iterator p;
                int cur = 0;
                bool found = false;
                for (auto k : e[i][j])
                    if (d[k])
                    {
                        cur = cur * 20 + c[k];
                        found = true;
                        break;
                    }
                    else
                        ++cur;
                p = std::find_if(e[i][j].begin(), e[i][j].end(), [&](const int &X)
                                 { return !d[X]; });
                if (p != e[i][j].end())
                {
                    d[*p] ^= true;
                    int curr = 0;
                    bool foundr = false;
                    for (auto k : e[i][j])
                        if (d[k])
                        {
                            curr = curr * 20 + c[k];
                            foundr = true;
                            break;
                        }
                        else
                            ++curr;
                    std::pair<int, int> tmp = now[i];
                    if (found)
                    {
                        tmp.first -= 1;
                        tmp.second -= cur;
                    }
                    if (foundr)
                    {
                        tmp.first += 1;
                        tmp.second += curr;
                    }
                    best[i] = std::min(best[i], tmp, cmp);
                    d[*p] ^= true;
                }
                p = std::find_if(e[i][j].begin(), e[i][j].end(), [&](const int &X)
                                 { return d[X]; });
                if (p != e[i][j].end())
                {
                    d[*p] ^= true;
                    int curr = 0;
                    bool foundr = false;
                    for (auto k : e[i][j])
                        if (d[k])
                        {
                            curr = curr * 20 + c[k];
                            foundr = true;
                            break;
                        }
                        else
                            ++curr;
                    std::pair<int, int> tmp = now[i];
                    if (found)
                    {
                        tmp.first -= 1;
                        tmp.second -= cur;
                    }
                    if (foundr)
                    {
                        tmp.first += 1;
                        tmp.second += curr;
                    }
                    worst[i] = std::max(worst[i], tmp, cmp);
                    d[*p] ^= true;
                }
            }
        }
        max[0] = {114514, 0};
        for (std::size_t i = 0; i != map.size(); ++i)
        {
            pp[i + 1] = pp[i];
            max[i + 1] = max[i];
            if (worst[rk[i]].first == 0)
                pp[i + 1] = true;
            else
                max[i + 1] = std::max(max[i], worst[rk[i]], cmp);
        }
        for (std::size_t i = 0; i != map.size(); ++i)
        {
            int tr = std::lower_bound(rk, rk + map.size(), now[rk[i]], [&](const int &A, const std::pair<int, int> &B)
                                      { return cmp(now[A], B); }) -
                     rk;
            bool flag = false;
            // std::cout << f[rk[i]] << ' ' << max[i].first << ' ' << max[i].second << ' ' << now[rk[i]].first << ' ' << now[rk[i]].second << ' ' << pp[i] << std::endl;
            if (!cmp(max[tr], now[rk[i]]))
                flag |= tr - 1 < std::min((m + 9) / 10, 35);
            if (pp[tr])
                flag |= tr - 1 < std::min((m + 8) / 10, 35);
            int nr = std::lower_bound(rk, rk + map.size(), best[rk[i]], [&](const int &A, const std::pair<int, int> &B)
                                      { return cmp(now[A], B); }) -
                     rk;
            flag |= nr < std::min((m + 9 + (now[rk[i]].first == 0)) / 10, 35);
            if (~addtim)
                flag |= tr + cmp(std::pair<int, int>(1, addtim), now[rk[i]]) < std::min((m + 10) / 10, 35);
            if (flag)
                ans.push_back(rk[i]);
        }
        std::cout << ans.size() << std::endl;
        for (std::size_t i = 0; i != ans.size(); ++i)
            std::cout << f[ans[i]] << " \n"[i + 1 == ans.size()];
        ans.clear();
        for (std::size_t i = 0; i != map.size(); ++i)
        {
            now[i] = {0, 0};
            for (int j = 0; j != 26; ++j)
                e[i][j].clear();
        }
        map.clear();
    }
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 8ms
memory: 72212kb

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: 15ms
memory: 71292kb

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

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: 8ms
memory: 71272kb

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: 104ms
memory: 68876kb

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
4Vf5RXaTmySkFcXgHLOh
1...

result:

ok 100000 test cases ok. (100000 test cases)

Test #6:

score: 0
Accepted
time: 48ms
memory: 71756kb

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

result:

ok 10000 test cases ok. (10000 test cases)

Test #7:

score: 0
Accepted
time: 45ms
memory: 70740kb

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
iLUv
2
_lFUYRDV...

result:

ok 10000 test cases ok. (10000 test cases)

Test #8:

score: 0
Accepted
time: 64ms
memory: 68816kb

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

result:

ok 10000 test cases ok. (10000 test cases)

Test #9:

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

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

result:

ok 10000 test cases ok. (10000 test cases)

Test #10:

score: 0
Accepted
time: 43ms
memory: 70676kb

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

result:

ok 10000 test cases ok. (10000 test cases)

Test #11:

score: 0
Accepted
time: 10ms
memory: 71644kb

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

result:

ok 7 test cases ok. (7 test cases)

Test #12:

score: 0
Accepted
time: 37ms
memory: 72604kb

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

result:

ok 1000 test cases ok. (1000 test cases)

Test #13:

score: 0
Accepted
time: 44ms
memory: 73280kb

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: 71ms
memory: 74980kb

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: 97ms
memory: 81060kb

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: 23ms
memory: 72780kb

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: 104ms
memory: 85816kb

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: 100ms
memory: 85860kb

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