제출 #899324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
899324		stefanneagu	Advertisement 2 (JOI23_ho_t2)	C++17	0 / 100	1 ms	348 KiB

Main

// prea multe comentarii

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int nmax = 1e5 + 1;

struct str {
  int a, b;
  const bool operator < (str ult) const {
    if(b != ult.b) {
      return b < ult.b;
    }
    return a < ult.a;
  }
} v[nmax];

bool f[nmax];

int32_t main() {
  int n, ult = -1, ok = 1;
  cin >> n;
  set<str> ms;
  for(int i = 1; i <= n; i ++) {
    cin >> v[i].a >> v[i].b;
    //cout << "bag " << v[i].a << " " << v[i].b << endl;
    if(ult != -1 && v[i].b != ult) {
      ok = 0;
    }
    ult = v[i].b;
  }
  if(ok == 1) {
    cout << ms.size();
    return 0;
  }
  for(int i = 1; i <= n; i ++) {
    ms.insert({v[i].a, v[i].b});
  }
  int ans = 0;
  while(!ms.empty()) {
      //cout << endl;
    //cout << "la inceput:\n";
    //for(auto it : ms) {
      //cout << it.a << " " << it.b << "\n";
    //}
    auto it = ms.rbegin();
    ans ++;
    int ita = (*it).a, itb = (*it).b;
    //cout << "luam\n";
    //cout << ita << " " << itb << ":\n";
    for(int i = 1; i <= n; i ++) {
      if(!f[i] && abs(v[i].a - ita) <= itb - v[i].b) {
        f[i] = 1;
        if(ms.find({v[i].a, v[i].b}) != ms.end()) {
          //cout << "er\n";
          ms.erase({v[i].a, v[i].b});
        }
        //cout << v[i].a << " " << v[i].b << "\n";
      }
    }
    //cout << "\n";
  }
  //cout << "RASP: ";
  cout << ans;
  //cout << '\n';
  //for(int i = 1; i <= n; i ++) {
    //cout << i << ": " << f[i] << endl;
  //}
  return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 23
• Subtask 3: 0 / 36
• Subtask 4: 0 / 31