結果

問題 No.1029 JJOOII 3
ユーザー ningenMeningenMe
提出日時 2020-04-17 23:05:06
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,000 bytes
コンパイル時間 1,779 ms
コンパイル使用メモリ 186,572 KB
実行使用メモリ 7,296 KB
最終ジャッジ日時 2024-10-03 15:00:11
合計ジャッジ時間 35,677 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 387 ms
6,816 KB
testcase_04 AC 1,171 ms
6,816 KB
testcase_05 AC 1,767 ms
6,820 KB
testcase_06 AC 1,355 ms
6,816 KB
testcase_07 AC 1,502 ms
6,816 KB
testcase_08 AC 1,767 ms
6,816 KB
testcase_09 AC 1,500 ms
6,820 KB
testcase_10 AC 1,606 ms
6,816 KB
testcase_11 AC 1,822 ms
6,816 KB
testcase_12 AC 1,090 ms
6,816 KB
testcase_13 AC 1,824 ms
6,820 KB
testcase_14 AC 1,844 ms
6,956 KB
testcase_15 AC 1,057 ms
6,820 KB
testcase_16 AC 1,310 ms
6,820 KB
testcase_17 AC 1,228 ms
6,820 KB
testcase_18 AC 1,445 ms
6,816 KB
testcase_19 AC 15 ms
6,816 KB
testcase_20 AC 207 ms
6,816 KB
testcase_21 AC 213 ms
6,820 KB
testcase_22 AC 266 ms
6,816 KB
testcase_23 AC 199 ms
6,820 KB
testcase_24 AC 248 ms
6,816 KB
testcase_25 AC 265 ms
6,820 KB
testcase_26 AC 269 ms
6,816 KB
testcase_27 AC 330 ms
6,816 KB
testcase_28 AC 248 ms
6,820 KB
testcase_29 AC 202 ms
6,816 KB
testcase_30 AC 291 ms
6,816 KB
testcase_31 AC 257 ms
6,816 KB
testcase_32 TLE -
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
testcase_36 TLE -
testcase_37 AC 1 ms
6,816 KB
testcase_38 AC 26 ms
6,824 KB
testcase_39 AC 2 ms
6,816 KB
testcase_40 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N,K; cin >> N >> K;
    vector<string> S(N);
    vector<ll> C(N);
    map<vector<int>,ll> mp;
    for(int i = 0; i < N; ++i) {
        cin >> S[i] >> C[i];
        S[i] = "." + S[i] + ".";
        int M = S[i].size();
        vector<ll> LJ(M,0),CO(M,0),RI(M,0);
        for(int j = 0; j < M; ++j){
            if(S[i][j]=='J') LJ[j]++;
            if(S[i][j]=='O') CO[j]++;
            if(S[i][j]=='I') RI[j]++;
        }
        for(int j = 1; j < M; ++j){
            LJ[j]+=LJ[j-1];
            CO[j]+=CO[j-1];
            RI[j]+=RI[j-1];
        }
        for(int j = 0; j < M; ++j){
            for(int k = j; k < M; ++k){
                for(int l = k; l < M; ++l){
                    int J = LJ[j];
                    int O = CO[k]-CO[j];
                    int I = RI[l]-RI[k];
                    vector<int> v = {J,O,I};
                    if(!mp.count(v)) mp[v] = C[i];
                    else chmin(mp[v],C[i]);
                }
            }
        }
    }
    string X = "."+string(K,'J')+string(K,'O')+string(K,'I');
    vector<ll> dp(3*K+1,LOWINF);
    dp[0] = 0;
    for(int i = 1; i <= 3*K; ++i){
        vector<int> v = {0,0,0};
        for(int j = 0; j < 80 && i + j <= 3*K; ++j){
            if(X[i+j]=='J') v[0]++;
            if(X[i+j]=='O') v[1]++;
            if(X[i+j]=='I') v[2]++;
            if(mp.count(v)) chmin(dp[i+j],dp[i-1]+mp[v]);
        }
    }
    if(dp.back()==LOWINF) dp.back()=-1;
    cout << dp.back() << endl;
    return 0;
}
0