提出 #2129665

---

ソースコード 拡げる

// {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>

#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define ALL(A)     (A).begin(), (A).end()

using namespace std;

// }}}

int main(){
        int N;
        cin>>N;
        vector <int> x,y;

        int totalcount = 0;
        vector <int> eachcount;

        FOR(i,0,N){
                int tmpx,tmpy;
                cin>>tmpx>>tmpy;
                x.push_back(tmpx);
                y.push_back(tmpy);
                eachcount.push_back(0);
        }


        for (double a = 0; a < 2 * 3.14159265358979; a+=0.00002) {
                long long testx = (long long) ((double) (1LL << 60) * cos(a));
                long long testy = (long long) ((double) (1LL << 60) * sin(a));

                int nearest = -1;
                __int128 nearest_ever = 1;
                nearest_ever <<= 126;

                FOR(i,0,N) {
                        __int128 distx = testx - x[i];
                        __int128 disty = testy - y[i];

                        __int128 dest = distx * distx + disty * disty;

                        if (dest < nearest_ever) {
                                nearest_ever = dest;
                                nearest = i;
                        }
                }

                eachcount[nearest]++;
                totalcount++;
        }

        FOR(i,0,N){
                cout<<(double)eachcount[i] / (double)totalcount << endl;
        }

}

提出情報

ジャッジ結果