$O(nm)$ 都能过掉

提交记录

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

ll n, m, a[200010];

int main(){
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	for(int i = 1; i <= m; i ++){
		int x;
		cin >> x;
		int l = 0, r = x - 1, f = 0;
		for(int j = 1; j <= n; j ++){
			if(a[j] > r){
//				cout << i << " " << j << endl;
				a[j] += r - l + 1;
//				cout << r - l + 1 << endl;
				f = 1;
				break;
			} else if(a[j] > l){
				int tmp = a[j];
//				cout << tmp - l << endl;
				a[j] += tmp - l;
				l = tmp;
//				cout << l << endl;
			}
		}
		if(f) continue;
	}
	for(int i = 1; i <= n; i ++)
		cout << a[i] << "\n";
	return 0;
}