QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#423796 | #8708. Portal | Matutino | 0 | 0ms | 3832kb | C++14 | 710b | 2024-05-28 16:47:04 | 2024-05-28 16:47:04 |
Judging History
answer
#include<bits/stdc++.h>
// #define int long long
#define reg register
inline int read(){
int k=1,x=0;char ch=getchar();
while (ch<'0'||ch>'9') {if (ch=='-') k=-1; ch=getchar();}
while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-48,ch=getchar();
return k*x;
}
const int N=810,V=400;
int n,fa[N*N],ID[N][N],idx;
struct Node{int x,y;}p[N];
inline int cabs(reg int x){return x<0?-x:x;}
signed main(){
n=read();
for (reg int i=1;i<=n;i++) p[i].x=read(),p[i].y=read();
reg int gx=0,gy=0;
for (reg int i=1;i<=n;i++) for (reg int j=1;j<=n;j++){
reg int lx=cabs(p[i].x-p[j].x),ly=cabs(p[i].y-p[j].y);
gx=std::__gcd(gx,lx),gy=std::__gcd(gy,ly);
}
printf("%lld\n",1ll*gx*gy);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3756kb
input:
1 1 -1
output:
0
result:
wrong answer 1st lines differ - expected: '-1', found: '0'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Time Limit Exceeded
Test #40:
score: 0
Time Limit Exceeded
input:
99840 -359536 735499 -710626 400619 -468266 -282389 -192706 43659 204034 -543669 -100576 -749013 -118006 -283125 -341276 405771 560934 835595 -923936 506603 239724 956299 -680746 -737237 286204 982795 -847576 -282389 -949666 986475 996684 -429589 672984 -133717 140954 696491 -879116 -442837 985064 7...
output:
result:
Subtask #4:
score: 0
Wrong Answer
Test #59:
score: 29
Accepted
time: 0ms
memory: 3832kb
input:
5 0 0 1 0 -1 0 0 1 0 -1
output:
1
result:
ok single line: '1'
Test #60:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
100 -30 -13 -22 -19 32 9 -18 -11 50 19 16 5 -50 -17 -46 -21 10 -1 -56 -19 2 -11 -24 -15 -4 -11 -8 -11 4 7 -8 -5 34 9 18 7 20 1 -12 -11 -30 -23 -42 -13 -24 -3 16 11 -16 -7 -24 -21 2 -9 28 11 6 -9 -22 -11 4 -7 28 7 -36 -15 -20 -21 4 11 -8 5 20 5 30 21 58 19 4 -1 -46 -19 -6 3 2 11 46 15 18 -1 -24 -7 -2...
output:
4
result:
ok single line: '4'
Test #61:
score: -29
Wrong Answer
time: 0ms
memory: 3756kb
input:
100 66 27 38 -18 -39 -35 -4 9 -18 -24 24 26 17 6 -4 -26 -46 -6 52 1 17 -15 73 26 31 -10 -46 -27 -4 23 17 -29 -74 -37 -11 -39 -4 2 -11 10 3 -34 3 -41 -39 0 10 -14 31 -3 -18 -10 -25 -30 10 0 -53 -33 -18 -31 38 31 10 -35 24 5 52 22 -60 -32 -11 -32 17 13 -81 -36 3 29 -18 -45 -67 -31 45 23 31 -17 45 30 -...
output:
7
result:
wrong answer 1st lines differ - expected: '49', found: '7'
Subtask #5:
score: 0
Skipped
Dependency #2:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
0%