제출 #1022033

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1022033		huutuan	Portal (BOI24_portal)	C++14	55 / 100	2081 ms	4172 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N=1e5+10;
int n;
pair<int, int> a[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   vector<int> vx;
   for (int i=1; i<=n; ++i){
      cin >> a[i].first >> a[i].second;
      vx.push_back(a[i].first);
   }
   int d=0;
   for (int i=1; i<=1; ++i) for (int j=1; j<=n; ++j) for (int l=1; l<=n; ++l){
      int k=j;
      int x1=a[j].first-a[i].first, y1=a[j].second-a[i].second, x2=a[l].first-a[k].first, y2=a[l].second-a[k].second;
      int tmp=__gcd(abs(x1), abs(x2));
      if (tmp==0) continue;
      int cnt1=x2/tmp, cnt2=-x1/tmp;
      d=__gcd(d, abs(y1*cnt1+y2*cnt2));
   }
   int dd=0;
   sort(vx.begin(), vx.end());
   for (int i=1; i<(int)vx.size(); ++i) dd=__gcd(dd, vx[i]-vx[i-1]);
   d*=dd;
   cout << (d==0?-1:d) << '\n';
   return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 29 / 29
• Subtask 5: 15 / 15
• Subtask 6: 0 / 35