結果

問題 No.10 +か×か
ユーザー keikei
提出日時 2018-03-29 23:09:58
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,384 bytes
コンパイル時間 1,919 ms
コンパイル使用メモリ 174,420 KB
実行使用メモリ 43,384 KB
最終ジャッジ日時 2024-06-26 00:04:12
合計ジャッジ時間 2,710 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 52 ms
43,380 KB
testcase_04 AC 30 ms
29,868 KB
testcase_05 WA -
testcase_06 AC 52 ms
43,384 KB
testcase_07 AC 30 ms
29,868 KB
testcase_08 AC 12 ms
11,008 KB
testcase_09 AC 18 ms
17,812 KB
testcase_10 AC 3 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

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/10>
============================================================
IsaacOCR
OCR
+*?
{+,*}
++ → +* → *+ → ** 
1 ? 2 ? 10 ? 1=31 1+2*10+1
((1+2)*10)+1=31 
=================================================================
=============================================================
================================================================
*/
void solve(){
int N; cin >> N;
int T; cin >> T;
vector<int> A(N);
for(auto& in:A) cin >> in;
vector<vector<int>> dp(N+1,vector<int>(T+1,0));
dp[1][A[0]] = 1;
for(int i = 1; i < N;i++){
for(int j = 0; j < T; j++){
if(dp[i][j] == 0) continue;
if(j + A[i] <= T) dp[i+1][j+A[i]] = 1;
if(j*A[i] <= T) dp[i+1][j*A[i]] = 1;
}
}
vector<vector<int>> dp2(N+1,vector<int>(T+1,0));
dp2[N][T] = 1;
for(int i = N;i>1;i--){
for(int j = 0; j <= T;j++){
if(dp2[i][j] == 0) continue;
if(j-A[i-1] >= 0 && dp[i-1][j-A[i-1]]){
dp2[i-1][j-A[i-1]] = 1;
}
if(j%A[i-1] == 0 && dp[i-1][j/A[i-1]]){
dp2[i-1][j/A[i-1]] = 1;
}
}
}
string ans = "";
int now = A[0];
for(int i = 1; i < N;i++){
if(now+A[i] <= T && dp2[i+1][now+A[i]]){
ans += "+";
now += A[i];
continue;
}
if(now*A[i] <= T && dp2[i+1][now*A[i]]){
ans += "*";
now *= A[i];
continue;
}
}
cout << ans << endl;
}
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0