結果

問題 No.73 helloworld
ユーザー keikei
提出日時 2018-04-24 01:02:37
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 2,395 bytes
コンパイル時間 1,548 ms
コンパイル使用メモリ 169,916 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-30 06:12:21
合計ジャッジ時間 2,114 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://yukicoder.me/problems/no/73>
============================================================
Ahelloworld Shelloworld(i0,⋯,i9)
S[i0]S[i1]⋯S[i9]="helloworld"
i0<i1<⋯<i9
使helloworld
=================================================================
=============================================================
helloworld
h,e,w,r,d
================================================================
*/
ll calcl(ll lc){
if(lc <= 2) return 0;
ll ret = 0;
for(int l = 1; l <= lc-2;l++){
ll n = lc - l;
ret = max(ret,l*(n*(n-1)/2));
}
return ret;
}
ll calco(ll oc){
if(oc <= 1) return 0;
ll ret = 0;
return ret;
}
ll solve(){
ll res = 1;
vector<ll> C(26); for(auto& in:C) cin >> in;
res *= C['h'-'a'];
res *= C['e'-'a'];
res *= calcl(C['l'-'a']);
res *= (C['o'-'a']/2)*(C['o'-'a']-C['o'-'a']/2);
res *= C['w'-'a'];
res *= C['r'-'a'];
res *= C['d'-'a'];
return res;
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
cout << solve() << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0