제출 #1309507

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309507		thecrazycandy	Lightning Rod (NOI18_lightningrod)	C++20	0 / 100	1105 ms	263208 KiB

Main

#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#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];
int main() {
    sped_up;
    ll n;
    cin >> n;
    ll cnt = 0;
    vector <pair <ll, ll>> v;
    for (int i = 1; i <= n; i++) {
        ll x, y;
        cin >> x >> y;
        v.pb({x, y});
    }
    for (int i = 1; i <= v.size(); i++) {
        ll x = v[i - 1].F, y = v[i - 1].S;
        p[i] = max(p[i - 1], x + y);
    }
    s[v.size() + 1] = INFL;
    for (int i = v.size(); i > 0; i--) {
        ll x = v[i - 1].F, y = v[i - 1].S;
        s[i] = min(s[i + 1], x - y);
    }
    for (int i = 1; i <= v.size(); i++) {
        ll x = v[i - 1].F, y = v[i - 1].S;
        if (s[i + 1] > x - y && x + y > p[i - 1]) cnt++;
    }
    cout << cnt;
}

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