Submission #477341

#	Time	Username	Problem	Language	Result	Execution time	Memory
477341		BThero	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	1084 ms	976 KiB

bulves

#include <bits/stdc++.h>

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using namespace std;

typedef long long ll;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	vector<int> a(n), b(n);

	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
	}

	ll ans = 0;

	for (int i = 0; i + 1 < n; i++) {
		ll x = 0, y = 0;

		for (int j = 0; j <= i; j++) {
			x += a[j];
			x -= b[j];
		}

		for (int j = i + 1; j < n; j++) {
			y += a[j];
			y -= b[j];
		}

		if (x >= 0 && y >= 0) {
			// ignore
		}
		else if (x >= 0 && y < 0) {
			ans += -y;
		}
		else if (x < 0 && y >= 0) {
			ans += -x;
		}
		else {
			assert(0);
		}
	}
	
	cout << ans << '\n';
	return 0;
}

• Subtask 1: 0 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36