C++(g++ 7.5.0) 解法, 执行用时: 148ms, 内存消耗: 2224K, 提交时间: 2023-06-09 21:23:15

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int a[200005],h[200005];
int main() {
	int t;
	cin>>t;
	while(t--) {
		int m,n,k,b;
		cin>>n>>m>>k>>b;
		for(int i=1; i<=n; i++)cin>>h[i];
		for(int i=1; i<=n; i++)cin>>a[i];
		for(int i=1; i<=n; i++) {
			int res=(k-h[i])/a[i];
			if(res<=0)res=1;
			else res++;
			int res1=(k-b+a[i])/a[i];
			if(res>=m)printf("%d ",h[i]+(m-1)*a[i]);
			else printf("%d ",b+ (m-1-res)%res1*a[i]);
		}

		
		printf("\n");
	}
	return 0;
}

Python3 解法, 执行用时: 1168ms, 内存消耗: 21888K, 提交时间: 2023-06-09 20:44:43

def ceil(x):
    return int(x + 1)

T = int(input())

while T:
    T -= 1
    n, m, k, b = (int(x) for x in input().split())
    h = [int(x) for x in input().split()]
    a = [int(x) for x in input().split()]
    
    m -= 1
    for i in range(n):
        m1 = ceil((k - h[i]) / a[i])
        if m1 > m:
            print(m * a[i] + h[i], end=' ')
            continue
        m2 = ceil((k - b) / a[i])
        m3 = (m - m1) % m2
        print(m3 * a[i] + b, end=' ')
    print()
    

C++(clang++ 11.0.1) 解法, 执行用时: 645ms, 内存消耗: 3012K, 提交时间: 2023-06-16 19:09:24

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+10;
ll t,n,m,k,b,d;
ll h[N],a[N];
int main()
{
	cin>>t;
	while(t--){
		cin>>n>>m>>k>>b;
		m--;
		for(int i=1;i<=n;i++) cin>>h[i];
		for(int i=1;i<=n;i++){
			cin>>a[i];
			d=(k-h[i]+a[i])/a[i];
			if(d>m) cout<<h[i]+a[i]*m<<" ";
			else{
				ll x=m-d;
				d=(k-b+a[i])/a[i];
				cout<<b+(x%d)*a[i]<<" ";
			} 
		}
		cout<<endl;
	}
}