結果

問題 No.1905 PURE PHRASE
ユーザー rniyarniya
提出日時 2022-04-15 22:42:32
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 8 ms / 2,000 ms
コード長 8,909 bytes
コンパイル時間 2,381 ms
コンパイル使用メモリ 213,420 KB
実行使用メモリ 4,528 KB
最終ジャッジ日時 2023-08-26 08:23:12
合計ジャッジ時間 4,244 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
4,376 KB
testcase_01 AC 7 ms
4,376 KB
testcase_02 AC 7 ms
4,380 KB
testcase_03 AC 7 ms
4,500 KB
testcase_04 AC 7 ms
4,416 KB
testcase_05 AC 8 ms
4,396 KB
testcase_06 AC 7 ms
4,392 KB
testcase_07 AC 7 ms
4,376 KB
testcase_08 AC 7 ms
4,380 KB
testcase_09 AC 7 ms
4,428 KB
testcase_10 AC 7 ms
4,376 KB
testcase_11 AC 7 ms
4,384 KB
testcase_12 AC 7 ms
4,376 KB
testcase_13 AC 8 ms
4,380 KB
testcase_14 AC 8 ms
4,404 KB
testcase_15 AC 7 ms
4,376 KB
testcase_16 AC 7 ms
4,424 KB
testcase_17 AC 7 ms
4,480 KB
testcase_18 AC 7 ms
4,380 KB
testcase_19 AC 7 ms
4,412 KB
testcase_20 AC 7 ms
4,376 KB
testcase_21 AC 7 ms
4,376 KB
testcase_22 AC 7 ms
4,380 KB
testcase_23 AC 7 ms
4,392 KB
testcase_24 AC 7 ms
4,476 KB
testcase_25 AC 7 ms
4,384 KB
testcase_26 AC 7 ms
4,528 KB
testcase_27 AC 7 ms
4,416 KB
testcase_28 AC 7 ms
4,380 KB
testcase_29 AC 7 ms
4,380 KB
testcase_30 AC 7 ms
4,380 KB
testcase_31 AC 7 ms
4,400 KB
testcase_32 AC 7 ms
4,380 KB
testcase_33 AC 7 ms
4,380 KB
testcase_34 AC 7 ms
4,424 KB
testcase_35 AC 7 ms
4,376 KB
testcase_36 AC 7 ms
4,424 KB
testcase_37 AC 7 ms
4,380 KB
testcase_38 AC 7 ms
4,400 KB
testcase_39 AC 7 ms
4,384 KB
testcase_40 AC 7 ms
4,388 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == 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> 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 (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}
template <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {
    for (size_t i = 0; i < N; i++) {
        os << v[i] << (i + 1 == N ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    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(...) void(0)
#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; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / 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;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }
#pragma endregion

/**
 * @brief Fast Fourier Transform
 * @docs docs/convolution/FastFourierTransform.md
 */
struct Complex {
    double x, y;
    Complex() : x(0), y(0) {}
    Complex(double x, double y) : x(x), y(y) {}
    inline Complex operator+(const Complex& c) const { return Complex(x + c.x, y + c.y); }
    inline Complex operator-(const Complex& c) const { return Complex(x - c.x, y - c.y); }
    inline Complex operator*(const Complex& c) const { return Complex(x * c.x - y * c.y, x * c.y + y * c.x); }
    inline Complex conj() const { return Complex(x, -y); }
};
namespace FastFourierTransform {
const double PI = acosl(-1);
vector<Complex> roots = {{0, 0}, {1, 0}};
vector<int> rev = {0, 1};
int base = 1;
void ensure_base(int nbase) {
    if (nbase <= base) return;
    rev.resize(1 << nbase);
    for (int i = 0; i < (1 << nbase); i++) {
        rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (nbase - 1));
    }
    roots.resize(1 << nbase);
    for (; base < nbase; base++) {
        double angle = PI * 2.0 / (1 << (base + 1));
        for (int i = 1 << (base - 1); i < (1 << base); i++) {
            roots[i << 1] = roots[i];
            double angle_i = angle * ((i << 1 | 1) - (1 << base));
            roots[i << 1 | 1] = Complex(cos(angle_i), sin(angle_i));
        }
    }
}
void fft(vector<Complex>& a, int n) {
    int zeros = __builtin_ctz(n);
    ensure_base(zeros);
    int shift = base - zeros;
    for (int i = 0; i < n; i++) {
        if (i < (rev[i] >> shift)) {
            swap(a[i], a[rev[i] >> shift]);
        }
    }
    for (int k = 1; k < n; k <<= 1) {
        for (int i = 0; i < n; i += (k << 1)) {
            for (int j = 0; j < k; j++) {
                Complex z = a[i + j + k] * roots[j + k];
                a[i + j + k] = a[i + j] - z;
                a[i + j] = a[i + j] + z;
            }
        }
    }
}
vector<long long> multiply(const vector<int>& a, const vector<int>& b) {
    int need = a.size() + b.size() - 1;
    int nbase = 1;
    while ((1 << nbase) < need) nbase++;
    ensure_base(nbase);
    int sz = 1 << nbase;
    vector<Complex> C(sz);
    for (int i = 0; i < sz; i++) {
        int x = (i < a.size() ? a[i] : 0);
        int y = (i < b.size() ? b[i] : 0);
        C[i] = Complex(x, y);
    }
    fft(C, sz);
    Complex r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);
    for (int i = 0; i <= (sz >> 1); i++) {
        int j = (sz - i) & (sz - 1);
        Complex z = (C[j] * C[j] - (C[i] * C[i]).conj()) * r;
        C[j] = (C[i] * C[i] - (C[j] * C[j]).conj()) * r;
        C[i] = z;
    }
    for (int i = 0; i < (sz >> 1); i++) {
        Complex C0 = (C[i] + C[i + (sz >> 1)]) * t;
        Complex C1 = (C[i] - C[i + (sz >> 1)]) * t * roots[(sz >> 1) + i];
        C[i] = C0 + C1 * s;
    }
    fft(C, sz >> 1);
    vector<long long> res(need);
    for (int i = 0; i < need; i++) {
        res[i] = llround(i & 1 ? C[i >> 1].y : C[i >> 1].x);
    }
    return res;
}
}  // namespace FastFourierTransform

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;

vector<double> v = {261.6, 294.3, 327.0, 348.8, 392.4, 436.0, 490.5};
vector<string> ans = {"C4", "D4", "E4", "F4", "G4", "A4", "B4"};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;

    vector<Complex> C(32768);
    for (int i = 0; i < 32768; i++) C[i] = Complex(A[i], 0);
    FastFourierTransform::fft(C, 32768);
    double Max = 0;
    double argmax = -1;
    for (size_t i = 200; i < 400; i++) {
        if (chmax(Max, (C[i] * C[i].conj()).x)) {
            argmax = i;
        }
    }
    (argmax /= 32768) *= 44100;
    if (argmax > 500) argmax /= 2;
    double Min = INF, argmin = -1;
    for (int i = 0; i < 7; i++) {
        if (chmin(Min, abs(argmax - v[i]))) {
            argmin = i;
        }
    }
    cout << ans[argmin] << '\n';
}
0