Submission #69112545

---

Source Code Expand

#include <string>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
vector<lint> RH_B = {1532834020, 1388622299};
vector<lint> RH_M = {2147482409, 2147478017};
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<lint> X(N), Y(N);
  REP(i, N) cin >> X[i] >> Y[i];
  REP(loop, 1000) {
    int i = rand() % N;
    int j = rand() % N;
    if(i == j) continue;
    lint a, b, c;
    if(X[i] == X[j]) {
      a = 1;
      b = 0;
      c = -X[i];
    } else {
      a = Y[j] - Y[i];
      b = X[i] - X[j];
      c = X[j] * Y[i] - X[i] * Y[j];
    }
    int cnt = 0;
    REP(k, N) {
      if(a * X[k] + b * Y[k] + c == 0) cnt++;
    }
    if(cnt >= (N+1) / 2) {
      cout << "Yes\n";
      cout << a << " " << b << " " << c << "\n";
      return 0;
    }
  }
  cout << "No\n";
}

Submission Info

Judge Result