Submission #1172869

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172869		uranhishig	Bikeparking (EGOI24_bikeparking)	C++20	16 / 100	1095 ms	4936 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
const int mod = 1e9 + 7;
const int mx = 3e5 + 5;

signed main() {
	int n;	cin >> n;
	vector<int> a(n);
	vector<int> b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}
	
	if (n == 1) {
		cout << 0 << endl;
		return 0;
	}
	
	int ans = 0;
	int j = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (a[i] >= b[j]) {
				ans += b[j];
				a[i] -= b[j];
				b[j] = 0;
				j++;
			} 
			else {
				b[j] -= a[i];
				ans += a[i];
				a[i] = 0;
				break;
			}
		}
	}
	
	for (int i = 0; i < n; i++ ) {
		int t = min(a[i], b[i]);
		a[i] -= t;
		b[i] -= t;
	} 
	for (int i = 0; i < n; i++) {
		if (b[i] > 0) {
			ans -= b[i];
		}
	}
	cout << ans << endl;
	return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 0 / 9
• Subtask 3: 0 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32