QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#781769#9807. Make Them Believesusanzhishen#AC ✓0ms3860kbC++202.2kb2024-11-25 17:25:582024-11-25 17:26:00

Judging History

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

  • [2024-11-25 17:26:00]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3860kb
  • [2024-11-25 17:25:58]
  • 提交

answer

#pragma GCC optimize(3, "Ofast", "inline")
#include<bits/stdc++.h>
#define int long long
#define fr first 
#define sc second 
#define DEBUG_
#ifdef DEBUG_
#define dbg(a) std::cerr << #a << ':' << a << '\n'
template<class T>
void print_(T &t) {
   std::cerr << t << '\n';
}
template<class T, class... Args>
void print_(T &t, Args&... args) {
   std::cerr << t << ' ';
   print_(args...);
}
#else
#define dbg(a)
template<class T>
void print_(T &t) {
}
template<class T, class... Args>
void print_(T &t, Args&... args) {
}
#endif
#define rep(i, a, b) for(int i = (a);i <= (b); ++i)
#define per(i, a, b) for(int i = (a);i >= (b); --i)
#define pb push_back
#define eb emplace_back
#define mem(a, b) memset(a, b, sizeof a)
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
#define PY puts("YES")
#define Py puts("Yes")
#define PN puts("NO")
#define Pn puts("No")
#define all(x, l, r) x.begin() + l, x.begin() + r + 1
//using namespace std;
const int N = 1e6 + 10;
const int M = 320;
const int INF = 1e18 + 10;
const int mod = 998244353;
//const int mod = 1e9 + 7;
const int base1 = 131;
const int base2 = 13331;
using PII = std::pair<int, int>;
using ull = unsigned long long;
using ll = long long;
using std::array;
using std::cin;
using std::cout;
using std::vector;
template <class T>
using pq_g = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using pq_ = std::priority_queue<T>;

int n;
int m;
int k;
int w;

void solve() {
    vector<std::string> v(8);
    vector<int> val(8);
    rep(i, 0, 7) {
        cin >> v[i] >> val[i];
    }
    int max1 = 0, max2 = 0;
    std::string s1, s2;
    rep(i, 0, 3) {
        if (val[i] > max1) {
            max1 = val[i];
            s1 = v[i];
        }
    }
    rep(i, 4, 7) {
        if (val[i] > max2) {
            max2 = val[i];
            s2 = v[i];
        }
    }
    if (max1 > max2) {
        cout << s1 << " beats " << s2 << '\n';
    } else {
        cout << s2 << " beats " << s1 << '\n';
    }
}

signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0), std::cout.tie(0);
    int _ = 1;
    // std::cin >> _;
    while (_--) {
        solve();
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3620kb

input:

LNG 55
WBG 65
HLE 70
BLG 75
TES 48
T1 80
GEN 60
FLY 50

output:

T1 beats BLG

result:

ok 3 tokens

Test #2:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

LNG 55
WBG 65
HLE 70
BLG 81
TES 48
T1 80
GEN 60
FLY 50

output:

BLG beats T1

result:

ok 3 tokens

Test #3:

score: 0
Accepted
time: 0ms
memory: 3808kb

input:

P6 73
4 22
UN 84
Q 55
J 68
QR8 18
W 27
9J7 1

output:

UN beats J

result:

ok 3 tokens

Test #4:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

DZ 63
5J 8
F4 34
L9 85
9 90
2 47
6EL 69
W 86

output:

9 beats L9

result:

ok 3 tokens

Test #5:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

H 37
LQU 58
8 51
25E 71
LWI 91
0EZ 61
F 56
G 33

output:

LWI beats 25E

result:

ok 3 tokens

Test #6:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

L 81
AB 15
N0 30
HO 55
1 92
A 69
8 12
44 14

output:

1 beats L

result:

ok 3 tokens

Test #7:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

PGI 95
0DO 90
4 55
Q4R 30
U 68
1 82
5XT 64
BJ8 6

output:

PGI beats 1

result:

ok 3 tokens

Test #8:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

D9C 48
UH 10
DN 39
VK 77
OY 70
1 93
BA 1
V 3

output:

1 beats VK

result:

ok 3 tokens

Test #9:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

HM 88
TP 60
B 84
J 13
C 78
W5I 94
K 66
O1 96

output:

O1 beats HM

result:

ok 3 tokens

Test #10:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

L 63
H 13
KX 37
AP 55
9 50
3R 11
F 2
E 16

output:

L beats 9

result:

ok 3 tokens

Test #11:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

P 7
6P 37
DE 30
3F 66
5 31
0 76
58 59
2G 61

output:

0 beats 3F

result:

ok 3 tokens

Test #12:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

QPU 71
HN 72
M 41
H 45
T4 37
LF 46
99C 40
QT0 63

output:

HN beats QT0

result:

ok 3 tokens

Test #13:

score: 0
Accepted
time: 0ms
memory: 3812kb

input:

U2 55
8 72
2YZ 4
0ER 6
KO 64
NGO 90
G9 5
2G 65

output:

NGO beats 8

result:

ok 3 tokens

Test #14:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

YW 40
TN 32
R 26
UF 29
FNB 12
H 23
E 15
X 24

output:

YW beats X

result:

ok 3 tokens

Test #15:

score: 0
Accepted
time: 0ms
memory: 3852kb

input:

M 55
T 96
8FJ 13
P4Q 1
J 76
O 38
E 79
S 51

output:

T beats E

result:

ok 3 tokens

Test #16:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

Q 4
Y 78
J 57
T73 72
92B 16
P 18
I 51
4B 11

output:

Y beats I

result:

ok 3 tokens

Test #17:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

UC9 23
N 1
K8T 47
1L 51
U3X 16
3RC 59
87N 20
HM1 63

output:

HM1 beats 1L

result:

ok 3 tokens

Test #18:

score: 0
Accepted
time: 0ms
memory: 3808kb

input:

Y5 83
L 94
8C 55
3OF 99
RDN 47
8G 59
8 60
P 68

output:

3OF beats P

result:

ok 3 tokens

Test #19:

score: 0
Accepted
time: 0ms
memory: 3620kb

input:

MJ 65
MT 4
5 30
DBD 26
R9F 42
O 70
F 88
7 19

output:

F beats MJ

result:

ok 3 tokens

Test #20:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

Q 81
573 66
XPW 15
I 12
2 94
EWP 93
LLC 67
6SN 80

output:

2 beats Q

result:

ok 3 tokens

Test #21:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

U 30
UTY 23
QH 22
EO 94
PL 63
E2 25
BNB 21
56 75

output:

EO beats 56

result:

ok 3 tokens

Test #22:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

J33 81
LYS 54
8 50
9P 39
B6 90
I0 77
4L 60
KG 88

output:

B6 beats J33

result:

ok 3 tokens

Test #23:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

OW 12
IG 63
R 13
W6 61
WD8 37
AZ 57
4H 52
M9 47

output:

IG beats AZ

result:

ok 3 tokens

Test #24:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

CQ 90
4R 17
JBR 26
1M6 100
I 82
Z9J 27
F2 34
L5F 63

output:

1M6 beats I

result:

ok 3 tokens

Test #25:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

8 8
10 10
6 6
11 11
13 13
7 7
9 9
12 12

output:

13 beats 11

result:

ok 3 tokens

Test #26:

score: 0
Accepted
time: 0ms
memory: 3860kb

input:

000 100
0OO 13
OO0 14
08O 10
0O0 11
OOO 12
O0O 15
O09 16

output:

000 beats O09

result:

ok 3 tokens

Extra Test:

score: 0
Extra Test Passed