ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#159120 | #227. random | onepeople666 | 100 | 2117ms | 1924kb | C++ | 1011b | 2022-09-21 15:15:44 | 2022-09-21 15:15:44 |
answer
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0;
char c=getchar();
for(;c>'9'||c<'0';c=getchar());
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+c-'0';
return x;
}
int a[100001],b[100001];
int n,ans,qu;
int f(int num,int l,int r){
if(l>r)
return r;
int c=a[num];
int mid=(l+r)>>1;
if(c>b[mid])
return f(num,mid+1,r);
else
return f(num,l,mid-1);
}
int q(int num,int l,int r){
if(l>r)
return r;
int c=a[num];
int mid=(l+r)>>1;
if(c>=b[mid])
return q(num,mid+1,r);
else
return q(num,l,mid-1);
}
int main(){
int t=read();
while(t--){
ans=0,qu=0;
n=read();
for(int i=1;i<=n;i++)
a[i]=read();
for(int i=1;i<=n;i++)
b[i]=read();
sort(a+1,a+n+1);
sort(b+1,b+1+n);
for(int i=1;i<=n;i++)
ans+=f(i,1,n),qu=qu-f(i,1,n)+q(i,1,n);
if(ans>(n*n-qu)/2)
cout<<"Alice\n";
else if(ans<(n*n-qu)/2)
cout<<"Bob\n";
else
cout<<"Tie\n";
}
return 0;
}
/*
1
6
1 2 3 4 5 6
6 5 4 3 2 1
*/
Details
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 4ms
memory: 1156kb
input:
10 1000 101215 213370 853573 556809 576787 831897 820627 832617 819277 407455 483615 672899 835594 3...
output:
Alice Alice Bob Alice Alice Bob Bob Alice Alice Alice
result:
ok 10 lines
Test #2:
score: 10
Accepted
time: 3ms
memory: 1152kb
input:
10 1000 726572 630317 792678 34049 443782 297049 565292 47174 349955 333016 418996 708341 819288 920...
output:
Alice Bob Alice Alice Bob Bob Alice Alice Alice Alice
result:
ok 10 lines
Test #3:
score: 10
Accepted
time: 4ms
memory: 1156kb
input:
10 1000 672153 407098 98222 837830 790709 973955 819359 508851 467617 50563 720647 128305 191590 921...
output:
Bob Alice Bob Bob Bob Alice Bob Alice Alice Bob
result:
ok 10 lines
Test #4:
score: 10
Accepted
time: 3ms
memory: 1152kb
input:
10 1000 983561 839734 945863 171639 28630 174616 124538 701582 440330 411841 386200 584592 604303 81...
output:
Alice Alice Alice Alice Bob Alice Bob Bob Alice Alice
result:
ok 10 lines
Test #5:
score: 10
Accepted
time: 1ms
memory: 1156kb
input:
10 1000 804549 749001 547843 412181 194796 120977 171088 137799 296893 155632 247002 586601 338092 3...
output:
Bob Alice Bob Bob Bob Alice Bob Bob Bob Bob
result:
ok 10 lines
Test #6:
score: 10
Accepted
time: 3ms
memory: 1152kb
input:
10 1000 104636 728452 850974 588963 661234 559307 718748 339759 364748 557 543632 602736 143807 6536...
output:
Bob Alice Alice Alice Alice Alice Bob Alice Bob Bob
result:
ok 10 lines
Test #7:
score: 10
Accepted
time: 399ms
memory: 1924kb
input:
10 100000 959809 7522 973124 122563 501139 86200 151864 669643 885173 722057 411912 627224 703986 36...
output:
Bob Bob Alice Alice Bob Bob Bob Alice Alice Tie
result:
ok 10 lines
Test #8:
score: 10
Accepted
time: 577ms
memory: 1920kb
input:
10 100000 492550 252620 164472 816290 942301 851945 192440 79614 597695 278279 342292 71636 163373 9...
output:
Alice Alice Bob Bob Alice Bob Bob Bob Alice Tie
result:
ok 10 lines
Test #9:
score: 10
Accepted
time: 692ms
memory: 1924kb
input:
10 100000 464109 432323 874881 300908 659763 674722 32703 260646 495037 83277 893267 817700 939508 8...
output:
Alice Alice Bob Bob Alice Bob Bob Alice Alice Tie
result:
ok 10 lines
Test #10:
score: 10
Accepted
time: 431ms
memory: 1924kb
input:
10 100000 778478 218818 519364 642551 48000 845682 293702 267599 874080 997029 553067 830719 561770 ...
output:
Alice Alice Alice Bob Alice Bob Bob Alice Bob Tie
result:
ok 10 lines