# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
940917 | LittleOrange | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 3581 ms | 1048576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll big = 1e18;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
ll n,l;
cin >> n >> l;
vector<ll> x(n),t(n);
for(ll &i : x) cin >> i;
for(ll &i : t) cin >> i;
vector<vector<ll>> dp(1<<n,vector<ll>(n,big));
for(ll i = 0;i<n;i++){
ll d = min(x[i],l-x[i]);
if(d<=t[i]){
dp[1<<i][i] = d;
}
}
ll ans = 0;
for(ll i = 1;i<(1<<n);i++){
for(ll j = 0;j<n;j++) if(i>>j&1){
for(ll k = 0;k<n;k++) if(i>>k&1^1){
ll dd = abs(x[j]-x[k]);
ll d = dp[i][j]+min(dd,l-dd);
if (d<=t[k]){
dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k],d);
}
}
if(dp[i][j]<big) ans = max(ans,(ll)__builtin_popcountll(i));
}
}
cout << ans << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |