제출 #865316

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
865316		Trisanu_Das	Lightning Rod (NOI18_lightningrod)	C++17	0 / 100	2062 ms	243472 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second

 
int main(){
  int n; cin >> n;
  set<pair<int, int> > s;
  for(int i = 0; i < n; i++){
    int x, y; cin >> x >> y;
    s.insert({y, x});
  }
  int ans = 0;
  while(!s.empty()){
    pair<int, int> a = *s.rbegin();
    vector<pair<int, int> > v;
    for(auto i : s) if(abs(a.ss - i.ss) <= a.ff - i.ff) v.push_back(i);
    for(auto i : v) s.erase(i);
  }
  cout << ans << '\n';
}

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