Submission #921660

#	Time	Username	Problem	Language	Result	Execution time	Memory
921660		vjudge1	Lightning Rod (NOI18_lightningrod)	C++17	7 / 100	2099 ms	230496 KiB

Main

#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
//#define int long long
#define pb push_back
#define F first
#define S second
#define st 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 yes cout<<"Yes\n";
#define no cout<<"No\n";
#define lf else if 
using namespace std;
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);
    ll tests=1;
    //cin>>tests;
    for(ll i=1;i<=tests;i++)
    {
        //cout<<"Case "<<i<<":\n";
        ll n,mx=0;
        cin>>n;
        vector <pair <ll,ll> > v(n);
        for(ll i=0;i<n;i++)
        {
            cin>>v[i].S>>v[i].F;
            mx=max(mx,v[i].F);
        }
        ll ans=n,an=n;
        for(ll i=0;i<n;i++)
        {
            for(ll j=i+1;j<n;j++)
            {
                if(abs(v[j].S-v[i].S)<=v[j].F-v[i].F && i!=j)ans--;
            }
        }
        sort(v.begin(),v.end());
        for(ll i=n-1;i>=0;i--)
        {
            for(ll j=i-1;j>=0;j--)
            {
                if(abs(v[i].S-v[j].S)<=v[i].F-v[j].F && i!=j)an--;
            }
        }
        cout<<min(ans,an);
    }
}

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