Submission #7257724

---

Source Code Expand

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;
  cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
  os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int MAX = 111;
int n;
int x[MAX],y[MAX];
int il_wek(int a,int b){
  return x[a] * y[b] - x[b] * y[a];
}
int res = 0;
int kw(int a){
  return a * a;
}
int prob(int rx,int ry){
  maxi(res, kw(rx) + kw(ry));
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(20);
  cerr << fixed << setprecision(6);
  cin >> n;
  R(i,n) cin >> x[i] >> y[i];
  R(i,n){
    int lx=0,ly=0;
    int rx=0,ry=0;
    int sx=0,sy=0;
    R(j,n){
      int pom = il_wek(i,j);
      if(pom < 0){
        lx += x[j];
        ly += y[j];
      }else if(pom > 0){
        rx += x[j];
        ry += y[j];
      }else{
        sx += x[j];
        sy += y[j];
      }
      prob(lx,ly);
      prob(lx + sx,ly + sy);
      
      prob(rx,ry);
      prob(rx + sx,ry + sy);
    }
  }
  cout << sqrt(res) << "\n";
}

Submission Info

Judge Result