提出 #26919391

---

ソースコード 拡げる

// Cookie197 
// competitive programming is sooo hardd
#pragma GCC optimize("O4,unroll-loops,no-stack-protector")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<string>
#include<iomanip>
#include<math.h>
#include<unordered_map>
#include<numeric>
using namespace std;
void Why_does_competitive_programming_even_exist() {ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
void YayXD() {return;}
#define ll long long
#define pii pair<ll,ll>
#define pdd pair<double ,double>
#define mp make_pair
#define mod 998244353
#define endl "\n"
#define inf 1e18
#define Yes_it_does true
#define Does_competitive_programming_exist Yes_it_does
int n;
double x[200005],y[200005];
pdd angle[200005];
bool isequal(double a,double b){
    if (abs(a-b)<=1e-8) return true;
    return false;
}
bool comp(pdd a,pdd b){
    if (a.second<b.second) return true;
    return (a.first<b.first);
}
signed main(){
    Why_does_competitive_programming_even_exist();
    cin>>n;
    for (int i=1;i<=n;i++){
        cin>>x[i]>>y[i];
        angle[i].second=atan2(y[i]-1,x[i]);
        angle[i].first=atan2(y[i],x[i]-1);
        //cout<<angle[i].first<<"  "<<angle[i].second<<endl;
    }
    sort(angle+1,angle+1+n);
    double now=0;
    int cnt=0;
    for (int i=1;i<=n;i++){
        //cout<<angle[i].second<<"  "<<angle[i].first<<endl;
        //if (now<angle[i].first || isequal(now,angle[i].first)){
        if (now<=angle[i].second){
            cnt++;
            now=angle[i].first;
        }
    }
    cout<<cnt<<endl;
}

提出情報

ジャッジ結果