제출 #133651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
133651		miguel	Lightning Rod (NOI18_lightningrod)	C++14	66 / 100	2021 ms	178704 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll nmax=5e4+2;
const ll mod = 998244353;
int n, x[10000001], y[10000001];
bool cov[10000001];

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n;
    int mx=-2e9-1;
    for(int i=1; i<=n; i++){
        cin>>x[i]>>y[i];
        if(mx<x[i]+y[i]){
            mx=x[i]+y[i];
        }
        else cov[i]=1;
    }
    mx=-2e9-1;
    for(int i=n; i>=1; i--){
        //cin>>x[i]>>y[i];
        if(mx<y[i]-x[i]){
            mx=-x[i]+y[i];
        }
        else cov[i]=1;
    }
    int ans=0;
    for(int i=1; i<=n; i++){
        ans+=(cov[i]==0);
    }
    cout<<ans;
}

• Subtask 1: 0 / 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