제출 #895971

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
895971		omsincoconut	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	0 ms	2648 KiB

bulves

#include <bits/stdc++.h>

using namespace std;

typedef long long int lli;
typedef long double ld;
typedef pair<ld, ld> pld;
typedef pair<lli, lli> pll;
#define mp(x, y) make_pair(x, y)

const lli MAXN = 5e5+5;

lli N;
lli a[MAXN], b[MAXN];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> N;
    for (lli i = 0; i < N; i++) cin >> a[i] >> b[i];
    lli c[N];
    for (lli i = 0; i < N; i++) c[i] = a[i] - b[i];

    lli ans = 0;
    for (lli i = 0; i < N; i++) {
        ans += abs(c[i]) + abs(c[N-i-1]);
        if (i+1 < N) c[i+1] += c[i];
        if (N-i-2 > 0) c[N-i-2] += c[N-i-1];
    }

    cout << ans;

    return 0;
}

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