obocheton's blog

By obocheton, history, 9 months ago, In English

I was trying this problem CSES 1084.

I greedily choose the lowest sized valid apartment for every applicant (sorted both lists ascendingly).

But it turns out to be a wrong approach.

Why my approach is wrong?

 
 
 
 
  • Vote: I like it
  • +2
  • Vote: I do not like it

»
9 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Inserting the apartment sizes into the set may remove some apartments with the same size. Try using a multiset or a regular vector

  • »
    »
    9 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    what about erasing an element from vector, isn't it O(n)?

»
9 months ago, # |
Rev. 3   Vote: I like it +1 Vote: I do not like it

There can be multiple apartments with same size so instead of using set use multiset. And use inbuilt lowerbound function of set as thats faster .And to remove only one element from the multiset use s.erase(it) instead of s.erase(*it) as the later will remove all occurrences of *it.

Spoiler
  • »
    »
    7 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks. I was searching for this one. Your code was helpful for me.

  • »
    »
    2 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    would you describe a bit, that lower bound part? I'm having some problem there.

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Here was my idea previously.

Maintain two pointers, left and right. Sort both lists, lets call them A and B.

Then the answer is just the number of points of the arrays that match up together (by x).

Many people are looking at multi set, but to be honest, I think two pointers is a really easy to understand approach, and it's just as efficient / effective.

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

FYI, lower bound on sets is O(n), so you should probably use -> (set name).lower_bound(iterator).

»
7 weeks ago, # |
  Vote: I like it -9 Vote: I do not like it

given problem is not clear that why its take lot of tym to solve. but now i have solution for this.

include <bits/stdc++.h>

using namespace std;

define int long long

signed main(){ int n , m , k ; cin >> n >> m >> k; int a[n] ; for(int i = 0 ; i < n ; i++) cin >> a[i]; int b[m] ; for(int i = 0 ; i < m ; i++) cin >> b[i];

sort(a , a+n);
sort(b , b+m);

int i = n - 1 , j = m - 1;

int applicants = 0;

while(i >= 0 && j >= 0){

    if (b[j] < a[i] - k)
        i--;
    else if (b[j] > a[i] + k)
        j--;
    else
    {
        applicants++;
        i--;
        j--;
    }
}
cout << applicants << endl;

}