[BOJ] 숫자 카드 2

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> v;
int ans;
void go(int value){
    if (! binary_search(v.begin(), v.end(), value)){
        ans = 0;
        printf("%d ",0);
        return ;
    }
    
    int l = 0, r = (int) v.size()-1;
    int cnt = 0;
    while (l <= r) {
        int mid = ( l + r ) >> 1;
        
        if( value == v[mid]){
            // [1]
            /*
            for( int i=l; i<=r; i++)
                if( value == v[i] )
                    ans ++;
            break;
             */

            // [2] 
            cnt ++;
            for(int i=mid+1; v[i] == value; i++){
                cnt++;
            }
            for(int i=mid-1; v[i] == value; i--){
                cnt++;
            }
            break;
        }
        else if( value > v[mid] ){
            l = mid + 1;
        }
        else {
            r = mid - 1;
        }
    }
    ans = cnt;
    printf("%d ",ans);
}

int main() {
    int n,m;
    cin >> n;
    
    int input;
    for(int i=0; i<n; i++){
        scanf("%d",&input);
        v.push_back(input);
    }
    sort(v.begin(), v.end());
    

    // Sector 1 Begin 
    cin >> m;
    vector<int> v2;
    for(int i=0; i<m; i++){
        scanf("%d",&input);
        v2.push_back(input);
        
        // [3]
        if( i>0 ){
            if( v2[i] == v2[i-1]){
                printf("%d ",ans );
                continue;
            }
        }
        go(input);
    }
    // Sector 1 End



    // Sector 2 Begin 
    cin >> m;
    int pre_input = 10000001 ;
    for(int i=0; i<m; i++){
        scanf("%d",&input);
        
        if( input == pre_input ){
            printf("%d ",ans );
            pre_input = input;
            continue;
        }
        
        pre_input = input;
        go(input);
    }
    // Sector 2 End 




    return 0;
}

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main(void) {
    int n;
    scanf("%d", &n);
    vector<int> v;
    for (int i = 0; i < n; i++) {
        int num;
        scanf("%d", &num);
        v.push_back(num);
    }
    sort(v.begin(), v.end());
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        int num;
        scanf("%d", &num);
        if (binary_search(v.begin(), v.end(), num) == 0) {
            printf("0 ");
        }
        else{
            printf("%ld ", upper_bound(v.begin(), v.end(), num) - lower_bound(v.begin(), v.end(), num));
        }
    }
}

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int arr[20000005];
int n, m;

int main() {
	scanf("%d", &n);
	for (int i = 1, x; i <= n; i++) {
		scanf("%d", &x);
		arr[10000000 + x]++;
	}
    scanf("%d", &m);
	while (m--) {
		int x; scanf("%d", &x);
		printf("%d ", arr[x + 10000000]);
	}
	return 0;
}