#745255 (C++14) No.1872 Dictionary Order

• 問題: No.1872 Dictionary Order
• ユーザー: suta28407928
• 提出日時: 2022-03-11 22:24:47
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 3,426 bytes
• コンパイル時間: 1,592 ms
• コンパイル使用メモリ: 177,040 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-19 08:41:27
• 合計ジャッジ時間: 2,701 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	17 ms; 5,248 KB
testcase_01	WA	-
testcase_02	AC	8 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	13 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	6 ms; 5,376 KB
testcase_07	AC	5 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	4 ms; 5,376 KB
testcase_10	AC	5 ms; 5,376 KB
testcase_11	AC	8 ms; 5,376 KB
testcase_12	AC	4 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	9 ms; 5,376 KB
testcase_15	AC	10 ms; 5,376 KB
testcase_16	AC	3 ms; 5,376 KB
testcase_17	AC	6 ms; 5,376 KB
testcase_18	AC	6 ms; 5,376 KB
testcase_19	AC	5 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	7 ms; 5,376 KB
testcase_22	AC	16 ms; 5,376 KB
testcase_23	AC	7 ms; 5,376 KB
testcase_24	AC	5 ms; 5,376 KB
testcase_25	AC	10 ms; 5,376 KB
testcase_26	AC	5 ms; 5,376 KB
testcase_27	AC	10 ms; 5,376 KB
testcase_28	AC	13 ms; 5,376 KB
testcase_29	AC	15 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	17 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB

ソースコード

// #pragma GCC ta g("avx2")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//#include <atcoder/maxflow>
//using namespace atcoder;
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 20200000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-9;
//const int mod = 1e9 + 7;
const int mod = 998244353;

int main(){
    int n,m; cin >> n >> m;
    vl a(n); rep(i,n) cin >> a[i];
    vl p(n); rep(i,n) cin >> p[i], p[i]--;
    vl rev(n);
    rep(i,n) rev[p[i]] = i;
    vector<vb> dp(n+1,vb(m+1,false));
    dp[n][0] = true;
    for(int i=n-1; i>=0; i--){
        for(int j=m-1; j>=0; j--){
            if(a[i]+j <= m && dp[i+1][j]) dp[i][a[i]+j] = true;
            dp[i][j] = dp[i+1][j] || dp[i][j];
        }
    }
    if(!dp[0][m]){
        cout << "-1\n";
        return 0;
    }
    int now = m;
    vl ans;
    rep(i,n){
        rep(j,n){
            int id = rev[j];
            if(id < i) continue;
            if(now-a[id]>=0 && dp[id+1][now-a[id]]){
                ans.push_back(rev[j]+1);
                //debug(j,rev[j]);
                i = id;
                now -= a[id];
                break;
            }
        }
    }
    cout << ans.size() << "\n";
    print(ans);
}