#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int gcd(int a, int b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(a, b%a);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
int x[n], y[n], gx = 0, gy = 0;
for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
for(int i = 1; i < n; i++) {
gx = gcd(abs(x[i]-x[i-1]), gx);
gy = gcd(abs(y[i]-y[i-1]), gy);
}
if(gx*gy == 0) cout << -1;
else cout << gx*gy;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
15 ms |
2012 KB |
Output is correct |
3 |
Correct |
13 ms |
1884 KB |
Output is correct |
4 |
Correct |
13 ms |
1924 KB |
Output is correct |
5 |
Correct |
13 ms |
1880 KB |
Output is correct |
6 |
Correct |
13 ms |
1884 KB |
Output is correct |
7 |
Correct |
13 ms |
1884 KB |
Output is correct |
8 |
Correct |
13 ms |
1884 KB |
Output is correct |
9 |
Correct |
13 ms |
2016 KB |
Output is correct |
10 |
Correct |
14 ms |
2020 KB |
Output is correct |
11 |
Correct |
13 ms |
2016 KB |
Output is correct |
12 |
Correct |
14 ms |
1884 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
13 ms |
1884 KB |
Output is correct |
15 |
Correct |
13 ms |
2016 KB |
Output is correct |
16 |
Correct |
13 ms |
1880 KB |
Output is correct |
17 |
Correct |
15 ms |
1884 KB |
Output is correct |
18 |
Correct |
14 ms |
1884 KB |
Output is correct |
19 |
Correct |
13 ms |
1884 KB |
Output is correct |
20 |
Correct |
14 ms |
1880 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |