Submission #922156

#	Time	Username	Problem	Language	Result	Execution time	Memory
922156		vjudge1	Lightning Rod (NOI18_lightningrod)	C++17	76 / 100	1171 ms	262144 KiB

Main

#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define int long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define str string
#define pii pair<int,int>
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define mii map<int,int>
#define mll map<ll,ll>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yess cout<<"Yes\n";
#define noo cout<<"No\n";
using namespace std;

#define maxn 2000101
#define mod  1000000007

void solve(){
    int n;
    cin>>n;
    vector<pair<int,int>> v;
    for(int i=1;i<=n;i++){
        int q,w;
        cin>>q>>w;
        if(v.size()==0){
            v.pb(mp(q,w));
            continue;
        }
        else{
            pair<int,int>p=v.back();
            if(abs(p.ff-q)<=p.ss-w){
                continue;
            }
            while(v.size()){
                pair<int,int>p=v.back();
                if(abs(p.ff-q)<=w-p.ss){
                    v.pop_back();
                }
                else{
                    break;
                }
            }
            v.pb(mp(q,w));
        }
    }
    cout<<v.size();
}

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	//srand( time(0));
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
    int tests=1;
    //cin>>tests;
    for(int i=1;i<=tests;i++){
		//cout<<"Case "<<i<<": \n";
		solve();
	}
}

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