Submission #1309513

#	Time	Username	Problem	Language	Result	Execution time	Memory
1309513		thecrazycandy	Lightning Rod (NOI18_lightningrod)	C++20	70 / 100	1008 ms	156380 KiB

Main

#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll int
#define sped_up ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define rall(v) (v).rbegin(), (v).rend()
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define S second
#define F first
const ll INF = (ll)1e9 + 1, INFL = (ll)1e18 + 1;
const ll mod = (ll)1e9 + 7, MAXN = (ll)1e7 + 7;
ll p[MAXN], s[MAXN];
ll x[MAXN], y[MAXN];
int main() {
    sped_up;
    ll n;
    cin >> n;
    ll cnt = 0;
    p[0] = -INF;
    s[n + 1] = INF;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i];
        p[i] = max(p[i - 1], x[i] + y[i]);
    }
    for (int i = n; i >= 1; i--) {
        s[i] = min(s[i + 1], x[i] - y[i]);
    }
    for (int i = 1; i <= n; i++) {
        if (s[i + 1] > x[i] - y[i] && x[i] + y[i] > p[i - 1]) cnt++;
    }
    cout << cnt;
}

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