Submission #7292812


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define rep(i, n) for(int i = 0;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
const int MOD = 1000000007;
 
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n;cin >> n;
  vector<ll> a(2*n),b(2*n);
  vector<pair<long double,P>> v;
  rep(i,n){
      cin >> a[i] >> b[i];
      if(a[i]<0){
          v.push_back(mp(atan((long double)-a[i]/b[i]), mp(a[i],b[i])));
          v.push_back(mp(atan((long double)-a[i]/b[i])+2*M_PI, mp(a[i],b[i])));
      }else{
          v.push_back(mp(atan((long double)a[i]/b[i]), mp(a[i],b[i])));
          v.push_back(mp(atan((long double)a[i]/b[i])+2*M_PI, mp(a[i],b[i])));
      }
  }
  sort(all(v));
  ll ans = 0;
  rep(i,n){
      ll x = 0;
      ll y = 0;
      ll j = i;
      while(v[j].first-v[i].first<=M_PI){
          x+= v[j].second.first;
          y += v[j].second.second;
          j++;
      }
      ans = max(ans,x*x+y*y);
  }
  printf("%.11Lf\n",sqrt((long double)ans));
}

Submission Info

Submission Time
Task F - Engines
User mathda1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1323 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 5
WA × 2
AC × 24
WA × 17
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 00-sample-04.txt, 00-sample-05.txt, 00-sample-06.txt, 00-sample-07.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 00-sample-04.txt, 00-sample-05.txt, 00-sample-06.txt, 00-sample-07.txt, 01-random-very-small-01.txt, 01-random-very-small-02.txt, 01-random-very-small-03.txt, 02-random-small-01.txt, 02-random-small-02.txt, 02-random-small-03.txt, 03-random-01.txt, 03-random-02.txt, 03-random-03.txt, 04-zero-01.txt, 05-same-01.txt, 05-same-02.txt, 06-linear-01.txt, 06-linear-02.txt, 06-linear-03.txt, 07-linear-positive-01.txt, 07-linear-positive-02.txt, 07-linear-positive-03.txt, 08-90-degree-01.txt, 08-90-degree-02.txt, 09-180-degree-01.txt, 09-180-degree-02.txt, 10-sandglass-01.txt, 10-sandglass-02.txt, 11-circle-01.txt, 11-circle-02.txt, 11-circle-03.txt, 11-circle-04.txt, 11-circle-05.txt, 12-square-01.txt, 12-square-02.txt, 12-square-03.txt, 13-corner-01.txt, 13-corner-02.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 256 KB
00-sample-02.txt WA 1 ms 256 KB
00-sample-03.txt AC 1 ms 256 KB
00-sample-04.txt AC 1 ms 256 KB
00-sample-05.txt AC 1 ms 256 KB
00-sample-06.txt WA 1 ms 256 KB
00-sample-07.txt AC 1 ms 256 KB
01-random-very-small-01.txt WA 1 ms 256 KB
01-random-very-small-02.txt WA 1 ms 256 KB
01-random-very-small-03.txt WA 1 ms 256 KB
02-random-small-01.txt AC 1 ms 256 KB
02-random-small-02.txt WA 1 ms 256 KB
02-random-small-03.txt WA 1 ms 256 KB
03-random-01.txt WA 1 ms 256 KB
03-random-02.txt WA 1 ms 256 KB
03-random-03.txt WA 1 ms 256 KB
04-zero-01.txt AC 1 ms 256 KB
05-same-01.txt AC 1 ms 256 KB
05-same-02.txt AC 1 ms 256 KB
06-linear-01.txt WA 1 ms 256 KB
06-linear-02.txt WA 1 ms 256 KB
06-linear-03.txt AC 1 ms 256 KB
07-linear-positive-01.txt AC 1 ms 256 KB
07-linear-positive-02.txt AC 1 ms 256 KB
07-linear-positive-03.txt AC 1 ms 256 KB
08-90-degree-01.txt AC 1 ms 256 KB
08-90-degree-02.txt AC 1 ms 256 KB
09-180-degree-01.txt WA 1 ms 256 KB
09-180-degree-02.txt WA 1 ms 256 KB
10-sandglass-01.txt AC 1 ms 256 KB
10-sandglass-02.txt AC 1 ms 256 KB
11-circle-01.txt AC 1 ms 256 KB
11-circle-02.txt AC 1 ms 256 KB
11-circle-03.txt WA 1 ms 256 KB
11-circle-04.txt AC 1 ms 256 KB
11-circle-05.txt WA 1 ms 256 KB
12-square-01.txt AC 1 ms 256 KB
12-square-02.txt AC 1 ms 256 KB
12-square-03.txt WA 1 ms 256 KB
13-corner-01.txt AC 1 ms 256 KB
13-corner-02.txt AC 1 ms 256 KB