Submission #362208

#	Time	Username	Problem	Language	Result	Execution time	Memory
362208		knightron0	Collecting Stamps 3 (JOI20_ho_t3)	C++17	0 / 100	1 ms	364 KiB

ho_t3

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

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN =205;

int n, k;
int a[MAXN], b[MAXN];
vector<pair<int, int>> vec;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    cin>>n>>k;
    for(int i= 1;i<=n;i++){
    	cin>>a[i];
    }
    for(int i= 1;i<=n;i++){
    	cin>>b[i];
    	vec.pb({a[i], b[i]});
    }
    int ans= 0;
    do {
    	int t= 0;
    	int last = k;
    	int num= 0;
    	for(auto s: vec){
    		int dist1 = abs(last-s.fr);
    		int dist2 = abs(abs(k-last)+s.fr);
    		t += min(dist1, dist2);
    		if(t <= s.sc) num++;
    		last = s.fr;
    	}
    	ans = max(ans, num);
    } while (next_permutation(all(vec)));
    cout<<ans<<endl;
    return 0;
}

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