Submission #1203625

#TimeUsernameProblemLanguageResultExecution timeMemory
1203625BigBadBullyPortal (BOI24_portal)C++20
11 / 100
47 ms1980 KiB
#include <bits/stdc++.h> #define int long long #define pii pair<int,int> #define ff first #define ss second using namespace std; int mcd(int a,int b) { if (a>b)swap(a,b); if (a==0)return b; a = abs(a),b = abs(b); return __gcd(a,b); } signed main() { int n; cin >> n; vector<pii> v(n); for (int i = 0; i < n ;i++) cin >> v[i].ff >> v[i].ss; for (int i = n-1; i >= 0; i--) v[i].ff-=v[0].ff,v[i].ss-=v[0].ss; int x = 0, y = 0; int px=0,py=0; for (int i = 1; i < n; i++) { y = mcd(v[i].ss,y); int add = 0; if (v[i].ss == 0) add = v[i].ff; else if (py!=0) { int lc = v[i].ss*py/mcd(v[i].ss,py); int c1 = lc/py; int c2 = lc/v[i].ss; add = c2*v[i].ff - c1*px; px = v[i].ff; py = v[i].ss; } x = mcd(x,add); } if (x*y == 0) cout << -1; else cout << x*y; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...