oj.uz

Submission #865316

# Submission time Handle Problem Language Result Execution time Memory
865316 2023-10-24T07:23:06 Z Trisanu_Das Lightning Rod (NOI18_lightningrod) C++17
0 / 100
 2000 ms 243472 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2016 ms 190500 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 243472 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2016 ms 190500 KB Time limit exceeded
2 Halted 0 ms 0 KB -