QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#794237#9807. Make Them Believeucup-team159#AC ✓0ms3880kbC++202.8kb2024-11-30 13:08:222024-11-30 13:08:23

Judging History

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

  • [2024-11-30 13:08:23]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3880kb
  • [2024-11-30 13:08:22]
  • 提交

answer

#line 1 "J.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "J.cpp"

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	V<string> s(8);
	V<int> a(8);
	rep(i,8) cin >> s[i] >> a[i];
	int x = max_element(a.begin(),a.begin()+4) - a.begin();
	int y = max_element(a.begin()+4,a.end()) - a.begin();
	if(a[x] < a[y]) swap(x,y);
	cout << s[x] << " beats " << s[y] << endl;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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