# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
994744 |
2024-06-08T04:48:45 Z |
hmm789 |
Portal (BOI24_portal) |
C++14 |
|
2000 ms |
1884 KB |
#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(x[i]-x[i-1], gx);
gy = gcd(y[i]-y[i-1], gy);
}
if(gx*gy == 0) cout << -1;
else cout << gx*gy;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Execution timed out |
2083 ms |
1884 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2043 ms |
348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |