#933252 (C++17) No.2555 Intriguing Triangle

提出ソース

結果

問題	No.2555 Intriguing Triangle
ユーザー	hotman78
提出日時	2023-12-01 21:42:58
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	9,102 bytes
コンパイル時間	3,395 ms
コンパイル使用メモリ	229,220 KB
実行使用メモリ	6,548 KB
最終ジャッジ日時	2023-12-01 21:43:03
合計ジャッジ時間	4,511 ms
ジャッジサーバーID （参考情報）	judge12 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,548 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	2 ms 6,548 KB
testcase_06	AC	2 ms 6,548 KB
testcase_07	AC	2 ms 6,548 KB
testcase_08	AC	2 ms 6,548 KB
testcase_09	AC	2 ms 6,548 KB
testcase_10	AC	3 ms 6,548 KB
testcase_11	AC	3 ms 6,548 KB
testcase_12	AC	3 ms 6,548 KB
testcase_13	AC	4 ms 6,548 KB
testcase_14	AC	2 ms 6,548 KB
testcase_15	WA	-
testcase_16	AC	2 ms 6,548 KB
testcase_17	AC	2 ms 6,548 KB
testcase_18	WA	-
testcase_19	AC	2 ms 6,548 KB
testcase_20	AC	2 ms 6,548 KB
testcase_21	AC	9 ms 6,548 KB
testcase_22	WA	-
testcase_23	AC	1 ms 6,548 KB
testcase_24	AC	2 ms 6,548 KB
testcase_25	AC	2 ms 6,548 KB
testcase_26	AC	2 ms 6,548 KB
testcase_27	AC	2 ms 6,548 KB
testcase_28	AC	2 ms 6,548 KB
testcase_29	AC	2 ms 6,548 KB

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

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:12:24: warning: narrowing conversion of 'i' from 'long long int' to 'long double' [-Wnarrowing]
   12 | //         rep(j,1,b+c){
      |                        ^
main.cpp:13:26: warning: narrowing conversion of '(i + a)' from 'long long int' to 'long double' [-Wnarrowing]
   13 | //             if(i+j+a>=b+c)continue;
      |                        ~~^~~
main.cpp:14:30: warning: narrowing conversion of '((i + a) + j)' from 'long long int' to 'long double' [-Wnarrowing]
   14 | //             point B={0,0};
      |                        ~~~~~~^

ソースコード

raw source code

// author: hotman78
// date: 2023/12/01-21:42:47

// --- begin raw code -----------------
// #include"cpplib/util/template.hpp"
// 
// int main(){
//     lint a,b,c;
//     cin>>a>>b>>c;
//     using point=complex<long double>;
//     rep(i,1,b+c){
//         rep(j,1,b+c){
//             if(i+j+a>=b+c)continue;
//             point B={0,0};
//             point D={i,0};
//             point E={i+a,0};
//             point C={i+a+j,0};
//             long double s=(b+c+(i+j+a))/2.0;
//             long double S=sqrt(s*(s-b)*(s-c)*(s-(i+j+a)));
//             long double h=2*S/(i+j+a);
//             point A={sqrt(b*b-h*h),h};
//             long double arg1=arg(E-A)+arg(D-A)-arg(B-A)-arg(C-A);
//             if( abs(arg1) <= 1e-8 || abs(abs(arg1)-M_PIl*2) <= 1e-8 ){
//                 cout<<"Yes"<<endl;
//                 return 0;
//             }
//         }
//     }
//     cout<<"No"<<endl;
// }

// --- end raw code -----------------

#line 2 "cpplib/util/template.hpp"
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#line 1 "cpplib/util/ioutil.hpp"
// template <class Head,class... Args>
// std::ostream& output(std::ostream& out,const Head& head,const Args&... args){
//     out>>head;
//     return output(head,args...);
// }
// template <class Head>
// std::ostream& output(std::ostream& out,const Head& head){
//     out>>head;
//     return out;
// }

template <typename T, typename E>
std::ostream &operator<<(std::ostream &out, std::pair<T, E> v) {
    out << "(" << v.first << "," << v.second << ")";
    return out;
}

// template <class... Args>
// ostream& operator<<(ostream& out,std::tuple<Args...>v){
//     std::apply(output,v);
//     return out;
// }
#line 11 "cpplib/util/template.hpp"
struct __INIT__ {
    __INIT__() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __INIT__;
typedef long long lint;
constexpr long long INF = 1LL << 60;
constexpr int IINF = 1 << 30;
constexpr double EPS = 1e-10;
#ifndef REACTIVE
#define endl '\n';
#endif
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
#define output(t)                                                              \
    {                                                                          \
        bool f = 0;                                                            \
        for (auto val : (t)) {                                                 \
            cout << (f ? " " : "") << val;                                     \
            f = 1;                                                             \
        }                                                                      \
        cout << endl;                                                          \
    }
#define output2(t)                                                             \
    {                                                                          \
        for (auto i : t)                                                       \
            output(i);                                                         \
    }
#define debug(t)                                                               \
    {                                                                          \
        bool f = 0;                                                            \
        for (auto i : t) {                                                     \
            cerr << (f ? " " : "") << i;                                       \
            f = 1;                                                             \
        }                                                                      \
        cerr << endl;                                                          \
    }
#define debug2(t)                                                              \
    {                                                                          \
        for (auto i : t)                                                       \
            debug(i);                                                          \
    }
#define loop(n) for (long long _ = 0; _ < (long long)(n); ++_)
#define _overload4(_1, _2, _3, _4, name, ...) name
#define __rep(i, a) repi(i, 0, a, 1)
#define _rep(i, a, b) repi(i, a, b, 1)
#define repi(i, a, b, c)                                                       \
    for (long long i = (long long)(a); i < (long long)(b); i += c)
#define rep(...) _overload4(__VA_ARGS__, repi, _rep, __rep)(__VA_ARGS__)
#define _overload3_rev(_1, _2, _3, name, ...) name
#define _rep_rev(i, a) repi_rev(i, 0, a)
#define repi_rev(i, a, b)                                                      \
    for (long long i = (long long)(b)-1; i >= (long long)(a); --i)
#define rrep(...) _overload3_rev(__VA_ARGS__, repi_rev, _rep_rev)(__VA_ARGS__)

#define all(n) begin(n), end(n)
template <typename T, typename E> bool chmin(T &s, const E &t) {
    bool res = s > t;
    s = min<T>(s, t);
    return res;
}
template <typename T, typename E> bool chmax(T &s, const E &t) {
    bool res = s < t;
    s = max<T>(s, t);
    return res;
}
const vector<lint> dx = {1, 0, -1, 0, 1, 1, -1, -1};
const vector<lint> dy = {0, 1, 0, -1, 1, -1, 1, -1};
#define SUM(v) accumulate(all(v), 0LL)
#if __cplusplus >= 201703L
template <typename T, typename... Args>
auto make_vector(T x, int arg, Args... args) {
    if constexpr (sizeof...(args) == 0)
        return vector<T>(arg, x);
    else
        return vector(arg, make_vector<T>(x, args...));
}
#endif
#define bit(n, a) ((n >> a) & 1)
#define extrep(v, ...) for (auto v : make_mat_impl({__VA_ARGS__}))
vector<vector<long long>> make_mat_impl(vector<long long> v) {
    if (v.empty())
        return vector<vector<long long>>(1, vector<long long>());
    long long n = v.back();
    v.pop_back();
    vector<vector<long long>> ret;
    vector<vector<long long>> tmp = make_mat_impl(v);
    for (auto e : tmp)
        for (long long i = 0; i < n; ++i) {
            ret.push_back(e);
            ret.back().push_back(i);
        }
    return ret;
}
using graph = vector<vector<int>>;
template <typename T> using graph_w = vector<vector<pair<int, T>>>;

#if __cplusplus >= 201703L
constexpr inline long long powll(long long a, long long b) {
    long long res = 1;
    while (b--)
        res *= a;
    return res;
}
#endif

template <typename T, typename E>
pair<T, E> &operator+=(pair<T, E> &s, const pair<T, E> &t) {
    s.first += t.first;
    s.second += t.second;
    return s;
}
template <typename T, typename E>
pair<T, E> &operator-=(pair<T, E> &s, const pair<T, E> &t) {
    s.first -= t.first;
    s.second -= t.second;
    return s;
}
template <typename T, typename E>
pair<T, E> operator+(const pair<T, E> &s, const pair<T, E> &t) {
    auto res = s;
    return res += t;
}
template <typename T, typename E>
pair<T, E> operator-(const pair<T, E> &s, const pair<T, E> &t) {
    auto res = s;
    return res -= t;
}
#define BEGIN_STACK_EXTEND(size)                                               \
    void *stack_extend_memory_ = malloc(size);                                 \
    void *stack_extend_origin_memory_;                                         \
    char *stack_extend_dummy_memory_ = (char *)alloca(                         \
        (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16);            \
    *stack_extend_dummy_memory_ = 0;                                           \
    asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp"                          \
                 : "=b"(stack_extend_origin_memory_)                           \
                 : "a"((char *)stack_extend_memory_ + (size)-1024));
#define END_STACK_EXTEND                                                       \
    asm volatile("mov %%rax, %%rsp" ::"a"(stack_extend_origin_memory_));       \
    free(stack_extend_memory_);
int floor_pow(int n) { return n ? 31 - __builtin_clz(n) : 0; }
#line 2 "main.cpp"

int main() {
    lint a, b, c;
    cin >> a >> b >> c;
    using point = complex<long double>;
    rep(i, 1, b + c) {
        rep(j, 1, b + c) {
            if (i + j + a >= b + c)
                continue;
            point B = {0, 0};
            point D = {i, 0};
            point E = {i + a, 0};
            point C = {i + a + j, 0};
            long double s = (b + c + (i + j + a)) / 2.0;
            long double S = sqrt(s * (s - b) * (s - c) * (s - (i + j + a)));
            long double h = 2 * S / (i + j + a);
            point A = {sqrt(b * b - h * h), h};
            long double arg1 =
                arg(E - A) + arg(D - A) - arg(B - A) - arg(C - A);
            if (abs(arg1) <= 1e-8 || abs(abs(arg1) - M_PIl * 2) <= 1e-8) {
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout << "No" << endl;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード