Submission #896211

#	Time	Username	Problem	Language	Result	Execution time	Memory
896211		8pete8	Lightning Rod (NOI18_lightningrod)	C++17	21 / 100	1128 ms	161092 KiB

Main

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<float.h>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
#define int long long
#define double long double
const int mod=998244353,mxn=1e6,lg=22;//inf=1e18,minf=-1e18,Mxn=100000;
int32_t main(){
    fastio
	int n;cin>>n;
	stack<pii>st;
	for(int i=0;i<n;i++){
		int a,b;cin>>a>>b;
		if(!st.empty()&&b-abs(a-st.top().f)>=st.top().s)st.pop();
		if(st.empty()||st.top().s-(abs(a-st.top().f))<b)st.push({a,b});
	}
	cout<<st.size();
	return 0;
}

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