Submission #1164245

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164245		ChottuF	Lightning Rod (NOI18_lightningrod)	C++20	100 / 100	452 ms	78396 KiB

Main

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;


inline int readInt() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
	cout.tie(0);
    int n;
    n = readInt();

    int pref[n], suff[n];

    for (int i = 0; i < n; i++) {
        int x, y;
        x = readInt();
		y = readInt();
        pref[i] = x + y;
        suff[i] = y - x;
        if (i > 0)
            pref[i] = max(pref[i], pref[i - 1]);
    }

    int ans = 0;

    for (int i = n - 1; i >= 0; i--) {
        ans += ((i == 0) || pref[i] > pref[i - 1]) && ((i == n - 1) || suff[i] > suff[i + 1]);
        if (i != n - 1)
            suff[i] = max(suff[i], suff[i + 1]);
    }

    cout << ans << endl;

    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 26 / 26
• Subtask 6: 10 / 10
• Subtask 7: 20 / 20