Submission #921606

#TimeUsernameProblemLanguageResultExecution timeMemory
921606vjudge1Lightning Rod (NOI18_lightningrod)C++17
0 / 100
790 ms262144 KiB
#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; cin>>n; pair <ll,ll> v[n]; multiset <pair<ll,ll> > s; for(ll i=0;i<n;i++) { cin>>v[i].S>>v[i].F; s.insert({v[i].F,v[i].S}); } 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)ans--; } } for(ll i=n;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)an--; } } cout<<min(ans,an); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...