結果
問題 | No.1905 PURE PHRASE |
ユーザー |
|
提出日時 | 2022-06-14 00:38:31 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 3,569 bytes |
コンパイル時間 | 3,981 ms |
コンパイル使用メモリ | 231,736 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-01 14:16:53 |
合計ジャッジ時間 | 9,664 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,b) for(int i=0;i<b;i++)#define rrep(i,b) for(int i=b-1;i>=0;i--)#define rep1(i,b) for(int i=1;i<b;i++)#define repx(i,x,b) for(int i=x;i<b;i++)#define fore(i,a) for(auto i:a)#define fore1(i,a) for(auto &i:a)#define rng(x) (x).begin(), (x).end()#define rrng(x) (x).rbegin(), (x).rend()#define sz(x) ((int)(x).size())#define pb push_back#define fi first#define se secondusing namespace std;using namespace atcoder;using ll = long long;template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}#define dame { cout << "No" << endl; return 0;}#define dame1 { cout << -1 << endl; return 0;}#define test(x) cout << "test" << x << endl;#define deb(x,y) cout << x << " " << y << endl;#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;#define out cout << ans << endl;#define outv fore(yans , ans) cout << yans << "\n";#define show(x) cerr<<#x<<" = "<<x<<endl;#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define showv2(v) fore(vy , v) cout << vy << "\n";using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using tp = tuple<int ,int ,int>;using vi = vector<int>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;using mint = modint998244353;using vm = vector<mint>;using vvm = vector<vector<mint>>;vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;int main(){int n; cin>>n;vl a(n);rep(i,n) cin>>a[i];ll ans = 0;ll mn = LINF;repx(i,59,170){vl b,c;repx(j,i+1,n) b.pb(a[j]);rep(j,n-i-1) c.pb(a[j]);ll sum = 0;// if (sz(b) != sz(c)) test(1);rep(j,sz(b)) sum += abs(b[j] - c[j]);if (chmin(mn , sum)){ans = i + 1;}}// cout << ans << endl;if (ans == 60) assert(0);// if (ans == 0) assert(0);ll tmp = round(((long double)n / ans) * 10);// cout << tmp << endl;string anss;int thre = 100;if (abs(tmp - 2616) <= thre){anss = "C4";}else if (abs(tmp-2943) <= thre){anss = "D4";}else if (abs(tmp-3270) <= thre){anss = "E4";}else if (abs(tmp-3488) <= thre){anss = "F4";}else if (abs(tmp-3924) <= thre){anss = "G4";}else if (abs(tmp-4360) <= thre){anss = "A4";}else if (abs(tmp-4905) <= thre){anss = "B4";}else{// assert(0);}cout << anss << endl;return 0;}