結果
問題 | No.1905 PURE PHRASE |
ユーザー | eggkid6 |
提出日時 | 2022-04-15 22:57:26 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,507 bytes |
コンパイル時間 | 2,689 ms |
コンパイル使用メモリ | 207,764 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-25 02:08:45 |
合計ジャッジ時間 | 4,118 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 6 ms
5,248 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 6 ms
5,248 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 6 ms
5,248 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 6 ms
5,248 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using V = vector<ll>;using VV = vector<V>;using VVV = vector<VV>;using VVVV = vector<VVV>;using VVVVV = vector<VVVV>;using VVVVVV = vector<VVVVV>;using VS = vector<string>;using VB = vector<bool>;using VVB = vector<VB>;using P = pair<ll,ll>;using M = map<ll,ll>;using Q = queue<ll>;using PQ = priority_queue<ll>;using PQG = priority_queue<ll,V,greater<ll>>;using S = set<ll>;using VP = vector<P>;const ll MOD = 1000000007;const ll mod = 998244353;const ll INF = 1LL << 60;#define rep(i,n) for(ll i = 0; i < n; i++)#define rep2(i,s,n) for(ll i = s; i < n; i++)#define per(i,n) for(ll i = n-1; i >= 0; i--)#define per2(i,s,n) for(ll i = n-1; i >= s; i--)#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()#define fi first#define se second#define pb push_back#define pf push_front#define ppb pop_back#define ppf pop_front#define eb emplace_back#define lb lower_bound#define ub upper_bound#define cfix(x) fixed<<setprecision(x)template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return true;}return false;}template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return true;}return false;}template<class T>void Vin(vector<T>&a){rep(i,(ll)a.size())cin>>a[i];}template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}template<class T>void Vout(const vector<T>&a){rep(i,(int)a.size()-1)cout<<a[i]<<" ";cout<<a.back()<<'\n';}template<class T>void Voutl(const vector<T>&a){rep(i,(int)a.size())cout<<a[i]<<'\n';}ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n, eggkid = 1500;cin >> n;V a(n);Vin(a);VP b;vector<double> ans = {261.6, 294.3, 327.0, 348.8, 392.4, 436.0, 490.5};VS ans_ = {"C4", "D4", "E4", "F4", "G4", "A4", "B4"};/*rep2(i, 80, n) {if(abs(a[i] - a[0]) < eggkid) b.pb({i, 0});for(P& p : b) if(p.fi != -1) {if(abs(a[p.se++] - a[i]) >= eggkid) p.fi = -1;else if(p.fi == p.se) {double d = 1. * n / p.fi, sa = 44100;ll x = 0;rep(j, 7) if(chmin(sa, fabs(ans[j] - d))) x = j;cout << ans_[x] << '\n';return 0;}}}*/if(a[0] < -2048) cout << ans_[6] << '\n';}// -4096 <= a[0] < 0