Submission #630268

#	Time	Username	Problem	Language	Result	Execution time	Memory
630268		Karliver	Collecting Stamps 3 (JOI20_ho_t3)	C++17	15 / 100	14 ms	5204 KiB

ho_t3

	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;
const  long  long inf = 1e18;
template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)



void solve() {	
		
	int n;
	cin >> n;
	int L;
	cin >> L;
	assert(n <= 15);
	vector<int> a(n), t(n);
	
	for(int &c : a) cin >> c;
	for(int &c : t) cin >> c;
	
	VV<long long> dp((1 << n), V<long long>(n, inf));
	for(int i = 0;i < n;++i) {
		if(min(L-a[i], a[i]) <= t[i]) dp[(1 << i)][i] = min(L-a[i], a[i]);
	}
	int ans = 0;
	for(int s = 1;s < (1 << n);++s) {
		for(int j = 0;j < n;++j) {
			if(dp[s][j] == inf)continue;
			ckma(ans, __builtin_popcount(s));
			for(int  i = 0;i < n;++i) {
				if(~s>>i&1) {
					ll need = dp[s][j] + min(abs(a[j]-a[i]), L-abs(a[j]-a[i]));
					if(need <= t[i]) ckmi(dp[s | (1 << i)][i], need);
				}
			}
		}
	}
	cout << ans << '\n';
}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75