#620933 (C++17) No.1385 Simple Geometry 2

提出ソース

結果

問題	No.1385 Simple Geometry 2
ユーザー	rniya
提出日時	2021-02-21 16:23:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	212 ms / 500 ms
コード長	4,849 bytes
コンパイル時間	2,416 ms
コンパイル使用メモリ	204,788 KB
実行使用メモリ	7,808 KB
最終ジャッジ日時	2024-09-19 14:30:34
合計ジャッジ時間	18,536 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	3 ms 5,376 KB
testcase_05	AC	3 ms 5,376 KB
testcase_06	AC	3 ms 5,376 KB
testcase_07	AC	3 ms 5,376 KB
testcase_08	AC	6 ms 5,376 KB
testcase_09	AC	5 ms 5,376 KB
testcase_10	AC	6 ms 5,376 KB
testcase_11	AC	6 ms 5,376 KB
testcase_12	AC	5 ms 5,376 KB
testcase_13	AC	197 ms 7,552 KB
testcase_14	AC	179 ms 7,368 KB
testcase_15	AC	194 ms 7,776 KB
testcase_16	AC	174 ms 7,552 KB
testcase_17	AC	171 ms 7,660 KB
testcase_18	AC	174 ms 7,552 KB
testcase_19	AC	191 ms 7,552 KB
testcase_20	AC	166 ms 7,564 KB
testcase_21	AC	181 ms 7,672 KB
testcase_22	AC	167 ms 7,628 KB
testcase_23	AC	168 ms 7,552 KB
testcase_24	AC	166 ms 7,664 KB
testcase_25	AC	157 ms 7,552 KB
testcase_26	AC	159 ms 7,548 KB
testcase_27	AC	185 ms 7,552 KB
testcase_28	AC	171 ms 7,612 KB
testcase_29	AC	174 ms 7,556 KB
testcase_30	AC	162 ms 7,492 KB
testcase_31	AC	161 ms 7,632 KB
testcase_32	AC	185 ms 7,776 KB
testcase_33	AC	163 ms 7,808 KB
testcase_34	AC	164 ms 7,552 KB
testcase_35	AC	162 ms 7,552 KB
testcase_36	AC	165 ms 7,680 KB
testcase_37	AC	166 ms 7,772 KB
testcase_38	AC	168 ms 7,660 KB
testcase_39	AC	170 ms 7,552 KB
testcase_40	AC	160 ms 7,536 KB
testcase_41	AC	164 ms 7,772 KB
testcase_42	AC	162 ms 7,764 KB
testcase_43	AC	163 ms 7,676 KB
testcase_44	AC	169 ms 7,428 KB
testcase_45	AC	185 ms 7,552 KB
testcase_46	AC	208 ms 7,780 KB
testcase_47	AC	188 ms 7,488 KB
testcase_48	AC	184 ms 7,552 KB
testcase_49	AC	170 ms 7,552 KB
testcase_50	AC	163 ms 7,680 KB
testcase_51	AC	212 ms 7,504 KB
testcase_52	AC	167 ms 7,668 KB
testcase_53	AC	164 ms 7,680 KB
testcase_54	AC	165 ms 7,680 KB
testcase_55	AC	169 ms 7,432 KB
testcase_56	AC	169 ms 7,656 KB
testcase_57	AC	166 ms 7,772 KB
testcase_58	AC	162 ms 7,552 KB
testcase_59	AC	153 ms 7,488 KB
testcase_60	AC	120 ms 7,656 KB
testcase_61	AC	136 ms 7,472 KB
testcase_62	AC	171 ms 7,592 KB
testcase_63	AC	181 ms 7,808 KB
testcase_64	AC	175 ms 7,680 KB
testcase_65	AC	168 ms 7,552 KB
testcase_66	AC	166 ms 7,552 KB
testcase_67	AC	157 ms 7,680 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const long double PI = acosl(-1);

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    int N;
    ll L;
    cin >> N >> L;
    vector<ll> T(N);
    for (int i = 0; i < N; i++) cin >> T[i];

    auto COS = [&](int i) { return cosl(2 * PI * T[i] / L); };
    auto SIN = [&](int i) { return sinl(2 * PI * T[i] / L); };

    long double ans = 0;
    vector<long double> cossum(3, 0), sinsum(3, 0);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 3; j++) {
            ans += SIN(i) * cossum[j] * (j == 2 ? i : 1);
            ans -= COS(i) * sinsum[j] * (j == 2 ? i : 1);
            cossum[j] += COS(i) * (j == 0 ? N * 0.5 : (j == 1 ? i : -1));
            sinsum[j] += SIN(i) * (j == 0 ? N * 0.5 : (j == 1 ? i : -1));
        }
    }

    cout << ans * 6 / (ll(N) * (N - 1) * (N - 2)) << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード