제출 #1309521

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309521		tnt	Lightning Rod (NOI18_lightningrod)	C++20	14 / 100	981 ms	88072 KiB

Main

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#define pb push_back                    
#define ll long long  
#define f first
#define s second
//#define sz(v) int(v.size())
#define all(v) v.begin(),v.end()

int mod =  1e9 + 7;
const int N = 1e7 + 2,k = 317 + 1;
const int inf = 2e9;
int pr = 0,sf = inf;
bool d[N];
void solve(){
    int n,ans = 0;
    cin >> n;
    int x[n + 1],y[n + 1];
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i];
        if(pr >= x[i] + y[i]) d[i] = 1;
        pr = max(pr,x[i] + y[i]);
    }
    for(int i = n; i >= 1; i--){
        if(sf <= x[i] - y[i]) d[i] = 1;
        sf = min(sf,x[i] - y[i]);
        ans += (d[i] == 0);
    }
    cout << ans;
}
signed main(){
    //freopen("time.in", "r", stdin);
    //freopen("time.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while(t--){
        solve();
    }
}                          	

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