QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#616770 | #2364. Endgame | erering | WA | 80ms | 26152kb | C++20 | 1.2kb | 2024-10-06 11:19:38 | 2024-10-06 11:19:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl '\n'
#define int long long
const int N=1e5+5,MOD=325235241211,inf=2e18;
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
srand(1298659691);
int n; cin>>n;
map<pair<int,int>,bool> mp;
int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2;
bool flag=0;
pair<int,int> a[n+1];
a[n]={0,0};
mp[{0,0}]=1;
for(int i=0;i<n;i++){
cin>>a[i].first>>a[i].second;
int x=a[i].first,y=a[i].second;
mp[{x,y}]=1;
if(x1+x<=n && y+y1<=n && x1+x>0 && y+y1>0 && mp[{x2-(x1+x),y2-(y+y1)}])flag=1;
}
if(flag){
cout<<"Alice wins";
}
else{
for(int j=0;j<150;j++){
int a1=rand()%n+1,b1=rand()%n+1;
flag=0;
for(int i=0;i<=n;i++){
int x=a[i].first,y=a[i].second;
if(x2+x<=n && y+y2<=n && x2+x>0 && y+y2>0 && mp[{a1-(x2+x),b1-(y+y2)}]){
flag=1;
break;
}
}
if(!flag){
cout<<"tie "<<a1<<" "<<b1;
return 0;
}
}
cout<<"Bob wins";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3772kb
input:
3 2 3 1 3 1 0 0 -1 1 -1
output:
Bob wins
result:
ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3468kb
input:
3 3 3 1 1 1 0 1 1 0 1
output:
Bob wins
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
3 2 2 3 1 -1 0 -1 1 0 1
output:
Bob wins
result:
ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
5 2 1 1 2 -2 2 1 -1 1 1 2 2 3 3
output:
tie 4 4
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
2 1 1 1 2 1 -1 1 1
output:
tie 1 1
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
3 1 2 2 1 2 -2 -1 1 -2 2
output:
tie 3 3
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
2 2 2 1 1 1 1 1 0
output:
tie 1 2
result:
ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3524kb
input:
2 1 1 2 2 -1 -1 1 0
output:
tie 1 2
result:
ok
Test #9:
score: 0
Accepted
time: 80ms
memory: 25212kb
input:
100000 2 100000 1 100000 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20 0 21 0 22 0 23 0 24 0 25 0 26 0 27 0 28 0 29 0 30 0 31 0 32 0 33 0 34 0 35 0 36 0 37 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 47 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57 0...
output:
tie 50935 7919
result:
ok
Test #10:
score: 0
Accepted
time: 64ms
memory: 23836kb
input:
100000 2 1 1 1 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20 0 21 0 22 0 23 0 24 0 25 0 26 0 27 0 28 0 29 0 30 0 31 0 32 0 33 0 34 0 35 0 36 0 37 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 47 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57 0 58 0 59 0...
output:
tie 18619 86089
result:
ok
Test #11:
score: 0
Accepted
time: 72ms
memory: 26152kb
input:
100000 1 2 1 1 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20 0 21 0 22 0 23 0 24 0 25 0 26 0 27 0 28 0 29 0 30 0 31 0 32 0 33 0 34 0 35 0 36 0 37 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 47 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57 0 58 0 59...
output:
tie 50935 7919
result:
ok
Test #12:
score: 0
Accepted
time: 64ms
memory: 23904kb
input:
100000 100000 2 100000 1 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20 0 21 0 22 0 23 0 24 0 25 0 26 0 27 0 28 0 29 0 30 0 31 0 32 0 33 0 34 0 35 0 36 0 37 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 47 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57...
output:
tie 18619 86089
result:
ok
Test #13:
score: 0
Accepted
time: 63ms
memory: 23836kb
input:
100000 2 2 1 1 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20 0 21 0 22 0 23 0 24 0 25 0 26 0 27 0 28 0 29 0 30 0 31 0 32 0 33 0 34 0 35 0 36 0 37 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 47 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57 0 58 0 59 0...
output:
tie 18619 86089
result:
ok
Test #14:
score: 0
Accepted
time: 1ms
memory: 3736kb
input:
2 2 1 1 1 0 -1 1 -1
output:
tie 2 2
result:
ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
3 2 3 3 3 0 1 -2 2 -1 2
output:
tie 1 1
result:
ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
4 2 4 4 1 3 -3 2 0 -1 0 3 0
output:
Alice wins
result:
ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
5 4 2 5 2 -1 -1 2 -1 3 0 4 3 -2 -2
output:
tie 4 4
result:
ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
6 4 3 3 4 -4 -4 -3 -1 0 3 -3 0 3 -2 5 -4
output:
tie 3 3
result:
ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
7 4 6 2 4 -3 2 -1 -5 2 -6 3 -2 -5 4 2 6 4 5
output:
tie 3 1
result:
ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
8 5 3 8 6 -5 5 3 -2 5 -7 2 7 4 4 -4 -5 -2 -3 -2 6
output:
tie 3 1
result:
ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
9 6 1 6 4 -6 -6 -5 6 -5 4 -2 1 -4 -4 -3 -6 7 2 -1 5 3 -6
output:
tie 3 9
result:
ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3524kb
input:
10 7 8 1 4 6 -7 -7 9 -2 2 -8 -3 7 5 0 -2 8 9 8 -4 7 2 9 -2
output:
tie 9 9
result:
ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
50 42 20 46 50 -29 -46 -35 42 3 -42 -21 -14 -31 20 24 -14 33 12 -28 47 -46 -9 -27 -35 14 -3 -8 -49 18 -22 -48 44 25 39 26 22 -23 -26 -8 33 31 19 -31 -31 -8 -32 -10 19 -34 17 -13 -39 31 -22 -3 30 19 -1 35 41 4 7 -1 45 -38 41 -24 -19 4 -30 -9 -1 -37 34 -38 -16 34 39 -47 15 9 15 -20 -4 4 -7 13 5 -9 -19...
output:
tie 19 39
result:
ok
Test #24:
score: -100
Wrong Answer
time: 0ms
memory: 3612kb
input:
5 2 1 5 1 -4 3 -3 0 0 4 3 -4 4 -2
output:
tie 4 4
result:
wrong answer Author claims 'tie', but judge claims 'alice'