#910795 (C++14) No.506 限られたジャパリまん

• 問題: No.506 限られたジャパリまん
• ユーザー: t98slider
• 提出日時: 2023-09-03 19:45:30
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 24 ms / 2,000 ms
• コード長: 5,074 bytes
• コンパイル時間: 3,013 ms
• コンパイル使用メモリ: 209,216 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-28 04:29:55
• 合計ジャッジ時間: 3,884 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	24 ms; 5,376 KB
testcase_09	AC	14 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	18 ms; 5,376 KB
testcase_12	AC	12 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	23 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	4 ms; 5,376 KB
testcase_20	AC	5 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	5 ms; 5,376 KB
testcase_23	AC	4 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

template <typename T> bool next_combination(const T first, const T last, int k) {
    const T subset = first + k;
    // empty container | k = 0 | k == n 
    if (first == last || first == subset || last == subset) {
        return false;
    }
    T src = subset;
    while (first != src) {
        src--;
        if (*src < *(last - 1)) {
            T dest = subset;
            while (*src >= *dest) {
                dest++;
            }
            iter_swap(src, dest);
            rotate(src + 1, dest + 1, last);
            rotate(subset, subset + (last - dest) - 1, last);
            return true;
        }
    }
    // restore
    rotate(first, subset, last);
    return false;
}

int main(){
    INT(w,h,k,p);
    vector<tuple<int,int,string>> a(k);
    map<string,int> Map;
    rep(i,k){
        cin>>get<0>(a[i])>>get<1>(a[i])>>get<2>(a[i]);
        Map[get<2>(a[i])]=i;
    }
    ll maxv = 0;
    vector<string> ans(p);
    sort(all(a));
    rep(i,p )ans[i] = get<2>(a[i]);
    do{
        vector2d(ll,dp,h+1,w+1,0);
        dp[0][0] = 1;
        set<pair<int,int>> S;
        for(int i=p;i<k;i++){
            S.insert({get<0>(a[i]),get<1>(a[i])});
        }
        rep(y,h+1){
            rep(x,w+1){
                if(S.count({x,y}))continue;
                if(x+1<=w)dp[y][x+1]+=dp[y][x];
                if(y+1<=h)dp[y+1][x]+=dp[y][x];
            }
        }
        if(dp[h][w] > maxv){
            maxv = dp[h][w];
            rep(i,p)ans[i] = get<2>(a[i]);
        }else if(dp[h][w] == maxv){
            vector<string> tmp(p);
            rep(i, p) tmp[i] = get<2>(a[i]);
            ans = min(ans, tmp);
        }
    }while(next_combination(all(a),p));
    out(maxv % MOD);
    sort(ans.begin(),ans.end(),[&](string va,string vb) {return Map[va] < Map[vb];});
    if(maxv!=0)rep(i,p)out(ans[i]);
}